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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.7K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 13:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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.2K 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-N0005P1-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678325450059

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-N0005P1
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 01:30:53] [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 01:30:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 01:30:53] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-09 01:30:53] [INFO ] Transformed 25 places.
[2023-03-09 01:30:53] [INFO ] Transformed 18 transitions.
[2023-03-09 01:30:53] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 14 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 01:30:53] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 01:30:53] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-09 01:30:53] [INFO ] Invariant cache hit.
[2023-03-09 01:30:53] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-09 01:30:53] [INFO ] Invariant cache hit.
[2023-03-09 01:30:53] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 20 out of 25 places after structural reductions.
[2023-03-09 01:30:54] [INFO ] Flatten gal took : 24 ms
[2023-03-09 01:30:54] [INFO ] Flatten gal took : 15 ms
[2023-03-09 01:30:54] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 4031 steps, including 6 resets, run visited all 21 properties in 104 ms. (steps per millisecond=38 )
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' '!(F(G(((F(p1)&&p0) U X(X(p2))))))'
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 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 4 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 01:30:54] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-09 01:30:54] [INFO ] Implicit Places using invariants in 56 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 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 2 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 65 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 879 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}, { cond=p0, acceptance={0} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 6}, { cond=(NOT p1), acceptance={} source=2 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=9 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s16 1)), p1:(GEQ s15 1), p2:(AND (GEQ s1 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2217 reset in 566 ms.
Product exploration explored 100000 steps with 2206 reset in 376 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) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 1136 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 774 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Finished random walk after 284 steps, including 0 resets, run visited all 9 properties in 8 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND (NOT p1) p0 (NOT p2))), (F p0), (F p1), (F (AND (NOT p1) p0)), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 1538 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 607 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 556 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 01:31:01] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 01:31:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-09 01:31:01] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 01:31:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:01] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-09 01:31:01] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-09 01:31:01] [INFO ] Added : 13 causal constraints over 3 iterations in 54 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 01:31:01] [INFO ] Invariant cache hit.
[2023-03-09 01:31:01] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-09 01:31:01] [INFO ] Invariant cache hit.
[2023-03-09 01:31:01] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-09 01:31:01] [INFO ] Invariant cache hit.
[2023-03-09 01:31:01] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 1359 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 708 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Finished random walk after 638 steps, including 1 resets, run visited all 9 properties in 7 ms. (steps per millisecond=91 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND (NOT p1) p0 (NOT p2))), (F p0), (F p1), (F (AND (NOT p1) p0)), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 1554 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 607 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 596 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
[2023-03-09 01:31:06] [INFO ] Invariant cache hit.
[2023-03-09 01:31:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 01:31:06] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 01:31:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-09 01:31:06] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-09 01:31:06] [INFO ] Added : 13 causal constraints over 3 iterations in 51 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 651 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 2182 reset in 411 ms.
Product exploration explored 100000 steps with 2252 reset in 324 ms.
Applying partial POR strategy [false, false, true, false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 550 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 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 4 place count 22 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 22 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 22 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 21 transition count 17
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 21 transition count 17
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 12 rules in 22 ms. Remains 21 /22 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2023-03-09 01:31:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 21 cols
[2023-03-09 01:31:09] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 01:31:09] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/22 places, 17/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 21/22 places, 17/18 transitions.
Built C files in :
/tmp/ltsmin1852168306093497291
[2023-03-09 01:31:09] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1852168306093497291
Running compilation step : cd /tmp/ltsmin1852168306093497291;'/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 386 ms.
Running link step : cd /tmp/ltsmin1852168306093497291;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin1852168306093497291;'/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/stateBased2373589230245841460.hoa' '--buchi-type=spotba'
LTSmin run took 510 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-00 finished in 15626 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 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 11 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 01:31:10] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 01:31:10] [INFO ] Implicit Places using invariants in 42 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 9/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-09 01:31:10] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 01:31:10] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 01:31:10] [INFO ] Invariant cache hit.
[2023-03-09 01:31:10] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 143 ms. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s5 1) (AND (GEQ s3 1) (GEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4824 steps with 0 reset in 10 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-01 finished in 232 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(p0))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 16 transition count 10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 14 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 8 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-09 01:31:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 01:31:10] [INFO ] Implicit Places using invariants in 60 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 8/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 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 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 3 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-09 01:31:10] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 01:31:10] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-09 01:31:10] [INFO ] Invariant cache hit.
[2023-03-09 01:31:10] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 157 ms. Remains : 8/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, p0, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7461 reset in 223 ms.
Product exploration explored 100000 steps with 7514 reset in 298 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 181 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[true, p0, (NOT p0)]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[true, p0, (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, p0, (NOT p0)]
[2023-03-09 01:31:12] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), true]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[true, p0, (NOT p0)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-09 01:31:12] [INFO ] Invariant cache hit.
[2023-03-09 01:31:12] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-09 01:31:12] [INFO ] Invariant cache hit.
[2023-03-09 01:31:12] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-09 01:31:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:31:12] [INFO ] Invariant cache hit.
[2023-03-09 01:31:12] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 8/8 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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[true, p0, (NOT p0)]
Finished random walk after 119 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[true, p0, (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[true, p0, (NOT p0)]
[2023-03-09 01:31:13] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), true]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[true, p0, (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[true, p0, (NOT p0)]
Product exploration explored 100000 steps with 7469 reset in 134 ms.
Stack based approach found an accepted trace after 21030 steps with 1571 reset with depth 16 and stack size 16 in 61 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-02 finished in 3857 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((G(p0)||(p1 U p2)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 11 place count 18 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 17 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 7 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-09 01:31:14] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 01:31:14] [INFO ] Implicit Places using invariants in 49 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 8/18 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 7
Applied a total of 2 rules in 2 ms. Remains 9 /10 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-09 01:31:14] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 01:31:14] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-09 01:31:14] [INFO ] Invariant cache hit.
[2023-03-09 01:31:14] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 1), p2:(AND (GEQ s5 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2543 reset in 228 ms.
Stuttering criterion allowed to conclude after 99344 steps with 2673 reset in 264 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-04 finished in 764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G(p1)))))'
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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 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 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Applied a total of 20 rules in 8 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-09 01:31:15] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 01:31:15] [INFO ] Implicit Places using invariants in 44 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/25 places, 10/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 7
Applied a total of 6 rules in 2 ms. Remains 9 /12 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-09 01:31:15] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 01:31:15] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-09 01:31:15] [INFO ] Invariant cache hit.
[2023-03-09 01:31:15] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 144 ms. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s7 1), p1:(AND (GEQ s4 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-05 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||(p1&&F(p2)))))))'
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 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 01:31:15] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 01:31:15] [INFO ] Implicit Places using invariants in 58 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 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 66 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 365 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p2:(OR (LT s5 1) (LT s14 1)), p0:(AND (GEQ s4 1) (GEQ s18 1)), p1:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 103 ms.
Product exploration explored 100000 steps with 25000 reset in 127 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 p2 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 402 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 2224 steps, including 3 resets, run visited all 8 properties in 15 ms. (steps per millisecond=148 )
Knowledge obtained : [(AND p2 (NOT p0) p1), true]
False Knowledge obtained : [(F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F p0), (F (NOT p2)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 2 factoid took 390 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 404 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 412 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 01:31:18] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 01:31:18] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-09 01:31:18] [INFO ] Invariant cache hit.
[2023-03-09 01:31:18] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-09 01:31:18] [INFO ] Invariant cache hit.
[2023-03-09 01:31:18] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 447 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 1619 steps, including 2 resets, run visited all 8 properties in 12 ms. (steps per millisecond=134 )
Knowledge obtained : [(AND p2 (NOT p0) p1), true]
False Knowledge obtained : [(F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F p0), (F (NOT p2)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 2 factoid took 394 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 403 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 402 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 25000 reset in 115 ms.
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Applying partial POR strategy [true, true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 415 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 17 transition count 14
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 17 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 17 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 16 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 16 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 21 rules in 9 ms. Remains 16 /21 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2023-03-09 01:31:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-09 01:31:21] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 01:31:21] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/21 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 16/21 places, 13/18 transitions.
Built C files in :
/tmp/ltsmin12121353654908191112
[2023-03-09 01:31:21] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12121353654908191112
Running compilation step : cd /tmp/ltsmin12121353654908191112;'/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 163 ms.
Running link step : cd /tmp/ltsmin12121353654908191112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12121353654908191112;'/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/stateBased4582190597741033133.hoa' '--buchi-type=spotba'
LTSmin run took 130 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-06 finished in 6145 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||X(F((X(p1)&&G(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 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 01:31:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 01:31:21] [INFO ] Implicit Places using invariants in 43 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 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 5 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 52 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s19 1)), p2:(GEQ s10 1), p1:(LT s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3649 reset in 204 ms.
Product exploration explored 100000 steps with 3689 reset in 243 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 p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 269 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 3278 steps, including 1 resets, run visited all 4 properties in 8 ms. (steps per millisecond=409 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 4 factoid took 294 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 260 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 01:31:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 01:31:24] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 01:31:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:24] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-09 01:31:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:31:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 01:31:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:24] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-09 01:31:24] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 01:31:24] [INFO ] Added : 11 causal constraints over 3 iterations in 31 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-09 01:31:24] [INFO ] Invariant cache hit.
[2023-03-09 01:31:24] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 01:31:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:24] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-09 01:31:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:31:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 01:31:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-09 01:31:24] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 01:31:24] [INFO ] Added : 9 causal constraints over 2 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 01:31:24] [INFO ] Invariant cache hit.
[2023-03-09 01:31:24] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 01:31:24] [INFO ] Invariant cache hit.
[2023-03-09 01:31:24] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-09 01:31:24] [INFO ] Invariant cache hit.
[2023-03-09 01:31:24] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1070 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=152 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 3 factoid took 252 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 269 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-09 01:31:25] [INFO ] Invariant cache hit.
[2023-03-09 01:31:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 01:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:25] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-09 01:31:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:31:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 01:31:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:25] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-09 01:31:25] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-09 01:31:25] [INFO ] Added : 11 causal constraints over 3 iterations in 30 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-09 01:31:25] [INFO ] Invariant cache hit.
[2023-03-09 01:31:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 01:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-09 01:31:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:31:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 01:31:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:26] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-09 01:31:26] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 01:31:26] [INFO ] Added : 9 causal constraints over 2 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 260 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3691 reset in 191 ms.
Product exploration explored 100000 steps with 3737 reset in 219 ms.
Built C files in :
/tmp/ltsmin14959074981871812676
[2023-03-09 01:31:26] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14959074981871812676
Running compilation step : cd /tmp/ltsmin14959074981871812676;'/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 166 ms.
Running link step : cd /tmp/ltsmin14959074981871812676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14959074981871812676;'/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/stateBased17886709017123264310.hoa' '--buchi-type=spotba'
LTSmin run took 3867 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-07 finished in 9265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((X(p1)&&p0) U p2) U G(p3))))'
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 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 01:31:31] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 01:31:31] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 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 31 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p3), (NOT p3), true, (OR (NOT p2) (NOT p1)), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) (NOT p3)))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p3 p2) (AND p3 p0)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) p0 (NOT p1))), acceptance={} source=5 dest: 2}, { cond=(OR (AND p3 p2 (NOT p1)) (AND p3 p0 (NOT p1))), acceptance={} source=5 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s8 1) (GEQ s14 1)), p2:(GEQ s12 1), p0:(AND (GEQ s8 1) (GEQ s14 1)), p1:(OR (LT s12 1) (AND (GEQ s8 1) (GEQ s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 8 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-09 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&F(!p1)))))))'
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 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 4 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 01:31:31] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 01:31:31] [INFO ] Implicit Places using invariants in 35 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 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 53 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 261 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s17 1)), p0:(OR (LT s8 1) (LT s14 1) (LT s1 1) (LT s17 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 25000 reset in 102 ms.
Product exploration explored 100000 steps with 25000 reset in 112 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Finished random walk after 2040 steps, including 2 resets, run visited all 3 properties in 9 ms. (steps per millisecond=226 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 2 factoid took 210 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 263 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 01:31:32] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-09 01:31:33] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-09 01:31:33] [INFO ] Invariant cache hit.
[2023-03-09 01:31:33] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-09 01:31:33] [INFO ] Invariant cache hit.
[2023-03-09 01:31:33] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Finished random walk after 877 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=146 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 362 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 259 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 25000 reset in 96 ms.
Product exploration explored 100000 steps with 25000 reset in 112 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 263 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 18 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 18 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 18 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 17 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 17 transition count 14
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 18 rules in 9 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2023-03-09 01:31:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2023-03-09 01:31:35] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-09 01:31:35] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 14/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 17/21 places, 14/18 transitions.
Built C files in :
/tmp/ltsmin8840644722508314976
[2023-03-09 01:31:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8840644722508314976
Running compilation step : cd /tmp/ltsmin8840644722508314976;'/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 149 ms.
Running link step : cd /tmp/ltsmin8840644722508314976;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8840644722508314976;'/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/stateBased6534261025514242252.hoa' '--buchi-type=spotba'
LTSmin run took 142 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-10 finished in 4373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 16 transition count 10
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 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 3 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 01:31:35] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 01:31:35] [INFO ] Implicit Places using invariants in 34 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/25 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41 ms. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24818 reset in 82 ms.
Product exploration explored 100000 steps with 25069 reset in 101 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 165 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 50 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 199 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
// Phase 1: matrix 7 rows 9 cols
[2023-03-09 01:31:36] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 01:31:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 01:31:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:36] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-09 01:31:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:31:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 01:31:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:36] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-09 01:31:36] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 01:31:36] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-09 01:31:36] [INFO ] Invariant cache hit.
[2023-03-09 01:31:36] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 01:31:36] [INFO ] Invariant cache hit.
[2023-03-09 01:31:36] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-09 01:31:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:31:36] [INFO ] Invariant cache hit.
[2023-03-09 01:31:36] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 9/9 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 200 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-09 01:31:37] [INFO ] Invariant cache hit.
[2023-03-09 01:31:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 01:31:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:37] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-09 01:31:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 01:31:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 01:31:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:37] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-09 01:31:37] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 01:31:37] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24958 reset in 87 ms.
Product exploration explored 100000 steps with 25098 reset in 107 ms.
Built C files in :
/tmp/ltsmin5823195164733524126
[2023-03-09 01:31:37] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2023-03-09 01:31:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 01:31:37] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2023-03-09 01:31:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 01:31:37] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2023-03-09 01:31:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 01:31:37] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5823195164733524126
Running compilation step : cd /tmp/ltsmin5823195164733524126;'/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 143 ms.
Running link step : cd /tmp/ltsmin5823195164733524126;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5823195164733524126;'/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/stateBased9636962228977166769.hoa' '--buchi-type=spotba'
LTSmin run took 80 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-11 finished in 2296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&(F(!p1)||p2)))))'
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 01:31:37] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 01:31:38] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-09 01:31:38] [INFO ] Invariant cache hit.
[2023-03-09 01:31:38] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-09 01:31:38] [INFO ] Invariant cache hit.
[2023-03-09 01:31:38] [INFO ] Dead Transitions using invariants and state equation in 48 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 148 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 286 ms :[true, p1, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GEQ s12 1), p0:(AND (GEQ s2 1) (GEQ s14 1)), p2:(OR (LT s4 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-12 finished in 462 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 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 14 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 8 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-09 01:31:38] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 01:31:38] [INFO ] Implicit Places using invariants in 45 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 8/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 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 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 3 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-09 01:31:38] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 01:31:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-09 01:31:38] [INFO ] Invariant cache hit.
[2023-03-09 01:31:38] [INFO ] Implicit Places using invariants and state equation in 34 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, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 8/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-13 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:(AND (GEQ s1 1) (GEQ s7 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 7431 reset in 116 ms.
Product exploration explored 100000 steps with 7478 reset in 129 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 238 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 105 ms :[(NOT p0), (NOT p0)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 192 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 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
[2023-03-09 01:31:39] [INFO ] Invariant cache hit.
[2023-03-09 01:31:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 01:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-09 01:31:39] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 01:31:39] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-09 01:31:39] [INFO ] Invariant cache hit.
[2023-03-09 01:31:39] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 01:31:39] [INFO ] Invariant cache hit.
[2023-03-09 01:31:39] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-09 01:31:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 01:31:39] [INFO ] Invariant cache hit.
[2023-03-09 01:31:39] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 8/8 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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 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 99 ms :[(NOT p0), (NOT p0)]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 200 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 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
[2023-03-09 01:31:40] [INFO ] Invariant cache hit.
[2023-03-09 01:31:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 01:31:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 01:31:40] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-09 01:31:40] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 01:31:40] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7454 reset in 112 ms.
Product exploration explored 100000 steps with 7443 reset in 134 ms.
Built C files in :
/tmp/ltsmin11055045284404860893
[2023-03-09 01:31:40] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2023-03-09 01:31:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 01:31:40] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2023-03-09 01:31:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 01:31:40] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2023-03-09 01:31:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 01:31:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11055045284404860893
Running compilation step : cd /tmp/ltsmin11055045284404860893;'/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 135 ms.
Running link step : cd /tmp/ltsmin11055045284404860893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11055045284404860893;'/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/stateBased6770590619028432427.hoa' '--buchi-type=spotba'
LTSmin run took 204 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-13 finished in 2955 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(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 01:31:41] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 01:31:41] [INFO ] Implicit Places using invariants in 39 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s4 1) (LT s18 1) (LT s10 1)), p0:(OR (LT s5 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 178 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-15 finished in 606 ms.
All properties solved by simple procedures.
Total runtime 48840 ms.

BK_STOP 1678325503144

--------------------
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-N0005P1"
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-N0005P1, 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-167814396100236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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