Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.6K Apr 29 12:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 12:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 12:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 12:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.2K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-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 1652691745665

Running Version 202205111006
[2022-05-16 09:02:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 09:02:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:02:26] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2022-05-16 09:02:26] [INFO ] Transformed 25 places.
[2022-05-16 09:02:26] [INFO ] Transformed 18 transitions.
[2022-05-16 09:02:26] [INFO ] Parsed PT model containing 25 places and 18 transitions in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 9 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 09:02:27] [INFO ] Computed 7 place invariants in 5 ms
[2022-05-16 09:02:27] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 09:02:27] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-16 09:02:27] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 09:02:27] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 09:02:27] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 18/18 transitions.
Support contains 23 out of 24 places after structural reductions.
[2022-05-16 09:02:27] [INFO ] Flatten gal took : 15 ms
[2022-05-16 09:02:27] [INFO ] Flatten gal took : 5 ms
[2022-05-16 09:02:27] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 295 steps, including 0 resets, run visited all 18 properties in 25 ms. (steps per millisecond=11 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((p0 U F((G(p1)||F(!F(p2)))))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 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 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 18 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 17 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 11 place count 17 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 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 21 place count 12 transition count 9
Applied a total of 21 rules in 9 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 09:02:27] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:02:27] [INFO ] Implicit Places using invariants in 24 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 11/24 places, 9/18 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND p2 (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p2:(OR (GEQ s10 1) (AND (GEQ s2 1) (GEQ s8 1))), p1:(GEQ s10 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 20 reset in 259 ms.
Stack based approach found an accepted trace after 253 steps with 0 reset with depth 254 and stack size 249 in 1 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-00 finished in 477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 5 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2022-05-16 09:02:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 09:02:28] [INFO ] Implicit Places using invariants in 23 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/24 places, 9/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 6
Applied a total of 6 rules in 2 ms. Remains 9 /12 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 09:02:28] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:02:28] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 09:02:28] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:02:28] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/24 places, 6/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s8 1), p1:(OR (LT s3 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4462 reset in 112 ms.
Stack based approach found an accepted trace after 162 steps with 11 reset with depth 55 and stack size 55 in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-01 finished in 266 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(F(p0))))&&G(X(G(p1)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 5 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:02:28] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (LT s0 1) (LT s13 1)), p0:(AND (GEQ s8 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-02 finished in 214 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U F(G(!X(!((p1 U p0) U (p2 U p3))))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 19 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 18 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 18 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 13 transition count 10
Applied a total of 19 rules in 4 ms. Remains 13 /24 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2022-05-16 09:02:28] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:02:28] [INFO ] Implicit Places using invariants in 22 ms returned [8, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 10/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 9
Applied a total of 2 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-16 09:02:28] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 09:02:28] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-16 09:02:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 09:02:28] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/24 places, 9/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/24 places, 9/18 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p3 p2 p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 1}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(OR (AND p3 (NOT p0) (NOT p1)) (AND p2 (NOT p0) (NOT p1))), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p3 (NOT p0) p1) (AND p2 (NOT p0) p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p2) p0) (AND (NOT p3) (NOT p2) p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) p2 p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(GEQ s9 1), p2:(GEQ s2 1), p0:(AND (GEQ s0 1) (GEQ s6 1)), p1:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 7250 reset in 137 ms.
Stack based approach found an accepted trace after 65 steps with 3 reset with depth 21 and stack size 21 in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-04 finished in 485 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F(p1))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:29] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:02:29] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:02:29] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:29] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 09:02:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s12 1), p0:(AND (GEQ s2 1) (GEQ s14 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7386 reset in 145 ms.
Product exploration explored 100000 steps with 7448 reset in 164 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 238 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 251 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 255 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:02:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:02:30] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 09:02:30] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 09:02:30] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:30] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:02:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:02:30] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 09:02:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:02:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:02:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:02:30] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 09:02:30] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:02:30] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:02:30] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:30] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-16 09:02:30] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:30] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:02:30] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 245 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 2353 steps, including 6 resets, run visited all 3 properties in 10 ms. (steps per millisecond=235 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:31] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:02:31] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:02:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 09:02:31] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:02:31] [INFO ] Added : 10 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:31] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 09:02:31] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:02:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 09:02:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:02:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:02:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:02:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 09:02:31] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:02:31] [INFO ] Added : 9 causal constraints over 2 iterations in 12 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 7345 reset in 101 ms.
Product exploration explored 100000 steps with 7402 reset in 226 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 3 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 3 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 14 rules in 7 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2022-05-16 09:02:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2022-05-16 09:02:32] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-16 09:02:32] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/21 places, 16/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 12105 reset in 169 ms.
Product exploration explored 100000 steps with 12121 reset in 191 ms.
Built C files in :
/tmp/ltsmin15261258572831288719
[2022-05-16 09:02:32] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15261258572831288719
Running compilation step : cd /tmp/ltsmin15261258572831288719;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 154 ms.
Running link step : cd /tmp/ltsmin15261258572831288719;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15261258572831288719;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9271786621005103617.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:47] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:02:47] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:47] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 09:02:48] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:02:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:02:48] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin11215193209405107950
[2022-05-16 09:02:48] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11215193209405107950
Running compilation step : cd /tmp/ltsmin11215193209405107950;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin11215193209405107950;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin11215193209405107950;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16664061331103644040.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 09:03:03] [INFO ] Flatten gal took : 3 ms
[2022-05-16 09:03:03] [INFO ] Flatten gal took : 2 ms
[2022-05-16 09:03:03] [INFO ] Time to serialize gal into /tmp/LTL10184613358993388154.gal : 1 ms
[2022-05-16 09:03:03] [INFO ] Time to serialize properties into /tmp/LTL5598153693454007295.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10184613358993388154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5598153693454007295.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1018461...267
Read 1 LTL properties
Checking formula 0 : !((F((X("((SF>=1)&&(Mi>=1))"))&&(F("(MpG>=1)")))))
Formula 0 simplified : !F(X"((SF>=1)&&(Mi>=1))" & F"(MpG>=1)")
Detected timeout of ITS tools.
[2022-05-16 09:03:18] [INFO ] Flatten gal took : 4 ms
[2022-05-16 09:03:18] [INFO ] Applying decomposition
[2022-05-16 09:03:18] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16142390291381402180.txt' '-o' '/tmp/graph16142390291381402180.bin' '-w' '/tmp/graph16142390291381402180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16142390291381402180.bin' '-l' '-1' '-v' '-w' '/tmp/graph16142390291381402180.weights' '-q' '0' '-e' '0.001'
[2022-05-16 09:03:18] [INFO ] Decomposing Gal with order
[2022-05-16 09:03:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 09:03:18] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 09:03:18] [INFO ] Flatten gal took : 26 ms
[2022-05-16 09:03:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 09:03:18] [INFO ] Time to serialize gal into /tmp/LTL9855742248046449287.gal : 1 ms
[2022-05-16 09:03:18] [INFO ] Time to serialize properties into /tmp/LTL11327477237598031568.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9855742248046449287.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11327477237598031568.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9855742...246
Read 1 LTL properties
Checking formula 0 : !((F((X("((i1.u2.SF>=1)&&(i0.u3.Mi>=1))"))&&(F("(i0.u0.MpG>=1)")))))
Formula 0 simplified : !F(X"((i1.u2.SF>=1)&&(i0.u3.Mi>=1))" & F"(i0.u0.MpG>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin190321974831445750
[2022-05-16 09:03:33] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin190321974831445750
Running compilation step : cd /tmp/ltsmin190321974831445750;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin190321974831445750;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin190321974831445750;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-05 finished in 79251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(p0)||p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 3 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 09:03:48] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:03:48] [INFO ] Implicit Places using invariants in 34 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s20 1)), p0:(AND (GEQ s11 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5733 reset in 100 ms.
Product exploration explored 100000 steps with 5727 reset in 108 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 09:03:49] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 09:03:49] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:03:49] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 09:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:03:49] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 09:03:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:03:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:03:49] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 09:03:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:03:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 09:03:49] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:03:49] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 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 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 09:03:49] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 09:03:49] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 09:03:49] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 09:03:49] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 09:03:49] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 09:03:49] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 09:03:50] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 09:03:50] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:03:50] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 09:03:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:03:50] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 09:03:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:03:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:03:50] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 09:03:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:03:50] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 09:03:50] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 09:03:50] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5676 reset in 74 ms.
Product exploration explored 100000 steps with 5743 reset in 82 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 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 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 22 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 22 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 20 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 20 transition count 16
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 20 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 18 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 18 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 18 rules in 10 ms. Remains 18 /22 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2022-05-16 09:03:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2022-05-16 09:03:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 09:03:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/22 places, 14/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/22 places, 14/18 transitions.
Product exploration explored 100000 steps with 10232 reset in 78 ms.
Product exploration explored 100000 steps with 10206 reset in 93 ms.
Built C files in :
/tmp/ltsmin17717219786850767550
[2022-05-16 09:03:50] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17717219786850767550
Running compilation step : cd /tmp/ltsmin17717219786850767550;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin17717219786850767550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17717219786850767550;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17093575321636186414.hoa' '--buchi-type=spotba'
LTSmin run took 2261 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-06 finished in 4701 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:03:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:03:53] [INFO ] Implicit Places using invariants in 29 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
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={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 24962 reset in 53 ms.
Product exploration explored 100000 steps with 24922 reset in 66 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 91 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
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 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 09:03:53] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:03:53] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 09:03:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:03:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 09:03:53] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:03:53] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 9
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 10 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 10 transition count 6
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 24 place count 8 transition count 6
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 28 place count 6 transition count 4
Applied a total of 28 rules in 2 ms. Remains 6 /20 variables (removed 14) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-16 09:03:53] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 09:03:53] [INFO ] Implicit Places using invariants in 21 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/20 places, 4/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 5/20 places, 4/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-07 finished in 687 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X(X(p0)))))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:03:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:03:53] [INFO ] Implicit Places using invariants in 23 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-08 finished in 130 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(p0)))&&F(G((X(p1)||X(p2))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:03:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:03:53] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:03:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:03:54] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:03:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:03:54] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s14 1)), p1:(LT s16 1), p2:(LT s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-09 finished in 211 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(X(p0)))&&G(p0))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 09:03:54] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 09:03:54] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-10 finished in 123 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 16 transition count 12
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 15 place count 15 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 12 transition count 9
Applied a total of 21 rules in 4 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 09:03:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:03:54] [INFO ] Implicit Places using invariants in 33 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/24 places, 9/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 7
Applied a total of 4 rules in 5 ms. Remains 8 /10 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 09:03:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 09:03:54] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 09:03:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 09:03:54] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/24 places, 7/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s7 1), p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5720 reset in 62 ms.
Product exploration explored 100000 steps with 5729 reset in 63 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 286 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 116 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 349 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p0), (NOT p0)]
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 09:03:55] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 09:03:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 09:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:03:55] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 09:03:55] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 09:03:55] [INFO ] Added : 1 causal constraints over 1 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 09:03:55] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 09:03:55] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 09:03:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 09:03:55] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-16 09:03:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 09:03:55] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 09:03:55] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 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 : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 276 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 98 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 316 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p0), (NOT p0)]
// Phase 1: matrix 7 rows 8 cols
[2022-05-16 09:03:56] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 09:03:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 09:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:03:56] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 09:03:56] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:03:56] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5734 reset in 59 ms.
Product exploration explored 100000 steps with 5728 reset in 72 ms.
Built C files in :
/tmp/ltsmin11520558012857850388
[2022-05-16 09:03:56] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-16 09:03:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:03:56] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-16 09:03:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:03:56] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-16 09:03:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:03:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11520558012857850388
Running compilation step : cd /tmp/ltsmin11520558012857850388;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin11520558012857850388;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11520558012857850388;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15110248441536455646.hoa' '--buchi-type=spotba'
LTSmin run took 51 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-11 finished in 2808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(((X(p0)||p1) U G(p2)))||!p0)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:03:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:03:57] [INFO ] Implicit Places using invariants in 19 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s9 1), p2:(GEQ s6 1), p1:(AND (GEQ s5 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 45 ms.
Product exploration explored 100000 steps with 50000 reset in 53 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 p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 7 states, 12 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-12 finished in 471 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G(F(X(F(p0)))))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 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 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 18 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 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 13 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 19 place count 13 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 11 transition count 8
Applied a total of 23 rules in 6 ms. Remains 11 /24 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2022-05-16 09:03:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:03:57] [INFO ] Implicit Places using invariants in 19 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/24 places, 8/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 5
Applied a total of 6 rules in 1 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 09:03:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 09:03:57] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 09:03:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 09:03:57] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/24 places, 5/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-14 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 s3 1) (GEQ s5 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 5249 reset in 60 ms.
Product exploration explored 100000 steps with 5018 reset in 75 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 09:03:58] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:03:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 09:03:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:03:58] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 09:03:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:03:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-16 09:03:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:03:58] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 09:03:58] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 09:03:58] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 09:03:58] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:03:58] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 09:03:58] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:03:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-16 09:03:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 09:03:58] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 09:03:58] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 09:03:58] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 09:03:58] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 09:03:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:03:58] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 09:03:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:03:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 09:03:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:03:58] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 09:03:58] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 09:03:59] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5047 reset in 62 ms.
Product exploration explored 100000 steps with 4995 reset in 74 ms.
Built C files in :
/tmp/ltsmin3865358531013525583
[2022-05-16 09:03:59] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-16 09:03:59] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:03:59] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-16 09:03:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:03:59] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-16 09:03:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:03:59] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3865358531013525583
Running compilation step : cd /tmp/ltsmin3865358531013525583;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin3865358531013525583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3865358531013525583;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10041009845832423882.hoa' '--buchi-type=spotba'
LTSmin run took 57 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-14 finished in 1814 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(!p1)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:03:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:03:59] [INFO ] Implicit Places using invariants in 21 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 122 ms :[p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s17 1), p1:(AND (GEQ s5 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 55 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 8 factoid took 118 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-15 finished in 386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F(p1))))'
Found a CL insensitive property : ClientsAndServers-PT-N0005P1-LTLFireability-05
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 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 7 rules applied. Total rules applied 7 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 12 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 13 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 11 transition count 8
Applied a total of 23 rules in 2 ms. Remains 11 /24 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2022-05-16 09:03:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:03:59] [INFO ] Implicit Places using invariants in 17 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 10/24 places, 8/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 10/24 places, 8/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s6 1), p0:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14034 reset in 50 ms.
Product exploration explored 100000 steps with 14051 reset in 54 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 138 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=138 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 305 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 09:04:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:04:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 09:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:04:00] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 09:04:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:04:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 09:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:04:00] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 09:04:00] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 09:04:00] [INFO ] Added : 4 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 09:04:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:04:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 09:04:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:04:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 09:04:01] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:04:01] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 09:04:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 09:04:01] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 09:04:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 09:04:01] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 09:04:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 09:04:01] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 198 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 247 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 350 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 09:04:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 09:04:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 09:04:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:04:01] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 09:04:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:04:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 09:04:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:04:02] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 09:04:02] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:04:02] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 09:04:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:04:02] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 09:04:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:04:02] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 09:04:02] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 09:04:02] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 14106 reset in 55 ms.
Product exploration explored 100000 steps with 14023 reset in 57 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2022-05-16 09:04:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 09:04:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:04:02] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 8/8 transitions.
Product exploration explored 100000 steps with 14000 reset in 63 ms.
Product exploration explored 100000 steps with 14018 reset in 73 ms.
Built C files in :
/tmp/ltsmin4648092724745694457
[2022-05-16 09:04:02] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4648092724745694457
Running compilation step : cd /tmp/ltsmin4648092724745694457;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin4648092724745694457;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4648092724745694457;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased518053383100001740.hoa' '--buchi-type=spotba'
LTSmin run took 741 ms.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-05 finished in 3743 ms.
CL/SL decision was in the wrong direction : CL + false
[2022-05-16 09:04:03] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12457927384995601006
[2022-05-16 09:04:03] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2022-05-16 09:04:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:04:03] [INFO ] Applying decomposition
[2022-05-16 09:04:03] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2022-05-16 09:04:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:04:03] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2022-05-16 09:04:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:04:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12457927384995601006
Running compilation step : cd /tmp/ltsmin12457927384995601006;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 09:04:03] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4941245739109626366.txt' '-o' '/tmp/graph4941245739109626366.bin' '-w' '/tmp/graph4941245739109626366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4941245739109626366.bin' '-l' '-1' '-v' '-w' '/tmp/graph4941245739109626366.weights' '-q' '0' '-e' '0.001'
[2022-05-16 09:04:03] [INFO ] Decomposing Gal with order
[2022-05-16 09:04:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 09:04:03] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 09:04:03] [INFO ] Flatten gal took : 3 ms
[2022-05-16 09:04:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 09:04:03] [INFO ] Time to serialize gal into /tmp/LTLFireability9865572571522059125.gal : 1 ms
[2022-05-16 09:04:03] [INFO ] Time to serialize properties into /tmp/LTLFireability15107331429656067072.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9865572571522059125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15107331429656067072.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((F((X("((i0.u2.SF>=1)&&(i2.u3.Mi>=1))"))&&(F("(i2.u4.MpG>=1)")))))
Formula 0 simplified : !F(X"((i0.u2.SF>=1)&&(i2.u3.Mi>=1))" & F"(i2.u4.MpG>=1)")
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin12457927384995601006;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin12457927384995601006;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: LTL layer: formula: <>((X((LTLAPp0==true))&&<>((LTLAPp1==true))))
pins2lts-mc-linux64( 3/ 8), 0.000: "<>((X((LTLAPp0==true))&&<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.103: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.103: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.103: State length is 25, there are 26 groups
pins2lts-mc-linux64( 0/ 8), 0.103: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.103: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.103: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.103: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.125: ~90 levels ~960 states ~2728 transitions
pins2lts-mc-linux64( 3/ 8), 0.130: ~90 levels ~1920 states ~4136 transitions
pins2lts-mc-linux64( 1/ 8), 0.145: ~88 levels ~3840 states ~8392 transitions
pins2lts-mc-linux64( 1/ 8), 0.168: ~88 levels ~7680 states ~16008 transitions
pins2lts-mc-linux64( 1/ 8), 0.200: ~88 levels ~15360 states ~34600 transitions
pins2lts-mc-linux64( 1/ 8), 0.277: ~88 levels ~30720 states ~72592 transitions
pins2lts-mc-linux64( 2/ 8), 0.443: ~123 levels ~61440 states ~151632 transitions
pins2lts-mc-linux64( 2/ 8), 0.685: ~123 levels ~122880 states ~316104 transitions
pins2lts-mc-linux64( 2/ 8), 1.055: ~123 levels ~245760 states ~670576 transitions
pins2lts-mc-linux64( 4/ 8), 1.516: ~316 levels ~491520 states ~1208064 transitions
pins2lts-mc-linux64( 4/ 8), 2.096: ~316 levels ~983040 states ~2499328 transitions
pins2lts-mc-linux64( 6/ 8), 2.909: ~352 levels ~1966080 states ~5632736 transitions
pins2lts-mc-linux64( 6/ 8), 4.500: ~352 levels ~3932160 states ~12011064 transitions
pins2lts-mc-linux64( 6/ 8), 7.600: ~352 levels ~7864320 states ~24484928 transitions
pins2lts-mc-linux64( 6/ 8), 14.240: ~352 levels ~15728640 states ~51967568 transitions
pins2lts-mc-linux64( 6/ 8), 28.543: ~352 levels ~31457280 states ~108625856 transitions
pins2lts-mc-linux64( 6/ 8), 59.438: ~352 levels ~62914560 states ~232121160 transitions
pins2lts-mc-linux64( 7/ 8), 125.637: ~367 levels ~125829120 states ~468815536 transitions
pins2lts-mc-linux64( 2/ 8), 153.504: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 153.536:
pins2lts-mc-linux64( 0/ 8), 153.536: mean standard work distribution: 3.9% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 153.536:
pins2lts-mc-linux64( 0/ 8), 153.536: Explored 134210726 states 531173327 transitions, fanout: 3.958
pins2lts-mc-linux64( 0/ 8), 153.536: Total exploration time 153.410 sec (153.360 sec minimum, 153.396 sec on average)
pins2lts-mc-linux64( 0/ 8), 153.536: States per second: 874850, Transitions per second: 3462442
pins2lts-mc-linux64( 0/ 8), 153.536:
pins2lts-mc-linux64( 0/ 8), 153.536: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 153.536: Redundant explorations: -0.0048
pins2lts-mc-linux64( 0/ 8), 153.536:
pins2lts-mc-linux64( 0/ 8), 153.536: Queue width: 8B, total height: 2170, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 153.536: Tree memory: 1103.3MB, 8.6 B/state, compr.: 8.5%
pins2lts-mc-linux64( 0/ 8), 153.536: Tree fill ratio (roots/leafs): 99.0%/30.0%
pins2lts-mc-linux64( 0/ 8), 153.536: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 153.536: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 153.536: Est. total memory use: 1103.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12457927384995601006;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12457927384995601006;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2022-05-16 09:24:35] [INFO ] Flatten gal took : 1 ms
[2022-05-16 09:24:35] [INFO ] Time to serialize gal into /tmp/LTLFireability3781227586583996936.gal : 1 ms
[2022-05-16 09:24:35] [INFO ] Time to serialize properties into /tmp/LTLFireability4731900538874658835.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3781227586583996936.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4731900538874658835.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((F((X("((SF>=1)&&(Mi>=1))"))&&(F("(MpG>=1)")))))
Formula 0 simplified : !F(X"((SF>=1)&&(Mi>=1))" & F"(MpG>=1)")
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
79096 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,790.975,3336016,1,0,1387,2.10802e+07,14,932,669,1.97677e+07,728
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 2130885 ms.

BK_STOP 1652693877735

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-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-4028"
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 r024-tall-165251919000804"
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 ;