Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 13:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 26 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 13:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678270039671

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0100P0
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 10:07:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 10:07:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:07:22] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-08 10:07:23] [INFO ] Transformed 25 places.
[2023-03-08 10:07:23] [INFO ] Transformed 18 transitions.
[2023-03-08 10:07:23] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 21 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 10:07:23] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-08 10:07:23] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-08 10:07:23] [INFO ] Invariant cache hit.
[2023-03-08 10:07:23] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-08 10:07:23] [INFO ] Invariant cache hit.
[2023-03-08 10:07:23] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 360 ms. Remains : 23/25 places, 18/18 transitions.
Support contains 18 out of 23 places after structural reductions.
[2023-03-08 10:07:23] [INFO ] Flatten gal took : 25 ms
[2023-03-08 10:07:23] [INFO ] Flatten gal took : 8 ms
[2023-03-08 10:07:23] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10044 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=193 ) properties (out of 15) seen :11
Finished Best-First random walk after 630 steps, including 0 resets, run visited all 4 properties in 17 ms. (steps per millisecond=37 )
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X((p0 U !p0)) U p1))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 10:07:24] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 10:07:24] [INFO ] Implicit Places using invariants in 54 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s2 1) (GEQ s14 1)), p1:(AND (GEQ s5 1) (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, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-00 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 6 rules applied. Total rules applied 6 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 17 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 11 place count 17 transition count 12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 16 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 14 transition count 10
Applied a total of 17 rules in 19 ms. Remains 14 /23 variables (removed 9) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-08 10:07:24] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 10:07:24] [INFO ] Implicit Places using invariants in 48 ms returned [9, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/23 places, 10/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 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 8 transition count 6
Applied a total of 8 rules in 3 ms. Remains 8 /12 variables (removed 4) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-08 10:07:24] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 10:07:25] [INFO ] Implicit Places using invariants in 32 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/23 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 106 ms. Remains : 7/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s2 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 363 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-01 finished in 538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U (F(p1) U p2)))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 20 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 5 place count 20 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 13 place count 16 transition count 12
Applied a total of 13 rules in 4 ms. Remains 16 /23 variables (removed 7) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 16 cols
[2023-03-08 10:07:25] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 10:07:25] [INFO ] Implicit Places using invariants in 37 ms returned [12, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/23 places, 12/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 14 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Applied a total of 6 rules in 2 ms. Remains 11 /14 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 11 cols
[2023-03-08 10:07:25] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 10:07:25] [INFO ] Implicit Places using invariants in 25 ms returned [10]
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 2 : 10/23 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 72 ms. Remains : 10/23 places, 9/18 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 5}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s9 1)), p1:(GEQ s7 1), p0:(GEQ s4 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 16399 reset in 273 ms.
Product exploration explored 100000 steps with 16401 reset in 235 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 p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))), (X (AND (NOT p2) (NOT p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 15 factoid took 1081 ms. Reduced automaton from 6 states, 25 edges and 3 AP (stutter insensitive) to 6 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 358 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10052 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=913 ) properties (out of 8) seen :7
Finished Best-First random walk after 650 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=92 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))), (X (AND (NOT p2) (NOT p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (AND (NOT p1) p2) (AND (NOT p1) p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p1) p2 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) p2 p0))]
Knowledge based reduction with 15 factoid took 1432 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter insensitive) to 6 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 315 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 298 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
// Phase 1: matrix 9 rows 10 cols
[2023-03-08 10:07:29] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 10:07:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 10:07:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:07:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:30] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-08 10:07:30] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 10:07:30] [INFO ] Added : 7 causal constraints over 2 iterations in 26 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 3 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-08 10:07:30] [INFO ] Invariant cache hit.
[2023-03-08 10:07:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 10:07:30] [INFO ] Invariant cache hit.
[2023-03-08 10:07:30] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-08 10:07:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:07:30] [INFO ] Invariant cache hit.
[2023-03-08 10:07:30] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 10/10 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 15 factoid took 1173 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter insensitive) to 6 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 376 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10051 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=717 ) properties (out of 8) seen :7
Finished Best-First random walk after 663 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=94 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 15 factoid took 1453 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter insensitive) to 6 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 314 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
[2023-03-08 10:07:33] [INFO ] Invariant cache hit.
[2023-03-08 10:07:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 10:07:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-08 10:07:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:07:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-08 10:07:34] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 10:07:34] [INFO ] Added : 7 causal constraints over 2 iterations in 22 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 309 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 16557 reset in 255 ms.
Product exploration explored 100000 steps with 16370 reset in 219 ms.
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-08 10:07:34] [INFO ] Invariant cache hit.
[2023-03-08 10:07:34] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 10:07:34] [INFO ] Invariant cache hit.
[2023-03-08 10:07:34] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-08 10:07:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:07:34] [INFO ] Invariant cache hit.
[2023-03-08 10:07:35] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 10/10 places, 9/9 transitions.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-02 finished in 9600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U p1))) U ((X(X((p0 U p1)))&&(!p0||F(p2)))||X(X(G((p0 U p1)))))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 10:07:35] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 10:07:35] [INFO ] Implicit Places using invariants in 46 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 469 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s13 1)), p2:(LT s10 1), p1:(AND (GEQ s11 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-03 finished in 551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 6 rules applied. Total rules applied 6 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 12 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 13 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 13 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 15 place count 15 transition count 11
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 23 place count 11 transition count 7
Applied a total of 23 rules in 9 ms. Remains 11 /23 variables (removed 12) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2023-03-08 10:07:35] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 10:07:35] [INFO ] Implicit Places using invariants in 44 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/23 places, 7/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 5 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-08 10:07:35] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 10:07:35] [INFO ] Implicit Places using invariants in 25 ms returned [6]
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 2 : 6/23 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 90 ms. Remains : 6/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-04 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 s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8238 reset in 75 ms.
Product exploration explored 100000 steps with 12534 reset in 158 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 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 202 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=202 )
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 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2023-03-08 10:07:36] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 10:07:36] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 10:07:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:36] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-08 10:07:36] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-08 10:07:36] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 10:07:36] [INFO ] Invariant cache hit.
[2023-03-08 10:07:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 10:07:36] [INFO ] Invariant cache hit.
[2023-03-08 10:07:36] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-08 10:07:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:07:36] [INFO ] Invariant cache hit.
[2023-03-08 10:07:36] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 6/6 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 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 202 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=202 )
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 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
[2023-03-08 10:07:37] [INFO ] Invariant cache hit.
[2023-03-08 10:07:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:37] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-08 10:07:37] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 10:07:37] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12949 reset in 61 ms.
Product exploration explored 100000 steps with 10194 reset in 139 ms.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 10:07:37] [INFO ] Invariant cache hit.
[2023-03-08 10:07:37] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 10:07:37] [INFO ] Invariant cache hit.
[2023-03-08 10:07:37] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-08 10:07:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:07:37] [INFO ] Invariant cache hit.
[2023-03-08 10:07:37] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-04 finished in 2180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(p1)&&p0))&&X(X(F(!p2))))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 10:07:37] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 10:07:37] [INFO ] Implicit Places using invariants in 36 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), (AND (NOT p0) p1), p2, p2]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s14 1)), p1:(GEQ s18 1), p2:(AND (GEQ s5 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22737 reset in 109 ms.
Product exploration explored 100000 steps with 22752 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 10 factoid took 602 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), (AND (NOT p0) p1), p2, p2]
Incomplete random walk after 10043 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2008 ) properties (out of 6) seen :5
Finished Best-First random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p2), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 872 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), (AND (NOT p0) p1), p2, p2]
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), (AND (NOT p0) p1), p2, p2]
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 10:07:40] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 10:07:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 10:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:40] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-08 10:07:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:07:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-08 10:07:40] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 10:07:40] [INFO ] Added : 9 causal constraints over 2 iterations in 22 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-08 10:07:40] [INFO ] Invariant cache hit.
[2023-03-08 10:07:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 10:07:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:07:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:40] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-08 10:07:40] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 10:07:40] [INFO ] Added : 15 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 10:07:40] [INFO ] Invariant cache hit.
[2023-03-08 10:07:40] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 10:07:40] [INFO ] Invariant cache hit.
[2023-03-08 10:07:41] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-08 10:07:41] [INFO ] Invariant cache hit.
[2023-03-08 10:07:41] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 10 factoid took 752 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), (AND (NOT p0) p1), p2, p2]
Incomplete random walk after 10043 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2008 ) properties (out of 6) seen :5
Finished Best-First random walk after 181 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=181 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p2), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 939 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), (AND (NOT p0) p1), p2, p2]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), (AND (NOT p0) p1), p2, p2]
[2023-03-08 10:07:43] [INFO ] Invariant cache hit.
[2023-03-08 10:07:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-08 10:07:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:07:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-08 10:07:43] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-08 10:07:43] [INFO ] Added : 9 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-08 10:07:43] [INFO ] Invariant cache hit.
[2023-03-08 10:07:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:43] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-08 10:07:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:07:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 10:07:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-08 10:07:43] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 10:07:43] [INFO ] Added : 15 causal constraints over 3 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), (AND (NOT p0) p1), p2, p2]
Product exploration explored 100000 steps with 22713 reset in 80 ms.
Product exploration explored 100000 steps with 22620 reset in 96 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), (AND (NOT p0) p1), p2, p2]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 20 transition count 18
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 14 place count 15 transition count 13
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 15 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 15 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 14 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 14 transition count 12
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 23 rules in 15 ms. Remains 14 /20 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2023-03-08 10:07:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 14 cols
[2023-03-08 10:07:44] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 10:07:44] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/20 places, 12/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 14/20 places, 12/18 transitions.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 10:07:44] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 10:07:44] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 10:07:44] [INFO ] Invariant cache hit.
[2023-03-08 10:07:44] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-08 10:07:44] [INFO ] Invariant cache hit.
[2023-03-08 10:07:44] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-05 finished in 7132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(!p0))&&(G(!p1)||G(F(!p2))))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 19 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 7 place count 19 transition count 12
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 13 place count 16 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 18 place count 13 transition count 10
Applied a total of 18 rules in 5 ms. Remains 13 /23 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-08 10:07:44] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 10:07:45] [INFO ] Implicit Places using invariants in 53 ms returned [9, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/23 places, 10/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 8
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-08 10:07:45] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 10:07:45] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-08 10:07:45] [INFO ] Invariant cache hit.
[2023-03-08 10:07:45] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/23 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 126 ms. Remains : 9/23 places, 8/18 transitions.
Stuttering acceptance computed with spot in 447 ms :[(OR p0 (AND p1 p2)), p0, (AND p1 (NOT p0) p2), (AND p1 p2), (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2)), (OR (AND p0 p2) (AND p1 p2)), (AND (NOT p1) p2 p0), (AND p0 p2)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}, { cond=(AND p1 p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) p2), acceptance={1} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=5 dest: 7}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(OR (AND (NOT p1) p2) (AND p2 (NOT p0))), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p2 p0), acceptance={1} source=7 dest: 3}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s7 1)), p2:(GEQ s5 1), p0:(GEQ s8 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1805 reset in 110 ms.
Stack based approach found an accepted trace after 252 steps with 11 reset with depth 33 and stack size 33 in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-06 finished in 720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 10:07:45] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 10:07:45] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 10:07:45] [INFO ] Invariant cache hit.
[2023-03-08 10:07:45] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-08 10:07:45] [INFO ] Invariant cache hit.
[2023-03-08 10:07:45] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s3 1) (LT s14 1)), p0:(OR (GEQ s6 1) (AND (GEQ s4 1) (GEQ s19 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-07 finished in 582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(!p0)))))))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 16 transition count 12
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 11
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 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 12 transition count 8
Applied a total of 21 rules in 7 ms. Remains 12 /23 variables (removed 11) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-08 10:07:46] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 10:07:46] [INFO ] Implicit Places using invariants in 46 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/23 places, 8/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 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 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 5
Applied a total of 6 rules in 3 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-08 10:07:46] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 10:07:46] [INFO ] Implicit Places using invariants in 44 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/23 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 114 ms. Remains : 6/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10195 reset in 99 ms.
Product exploration explored 100000 steps with 10198 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 604 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=604 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2023-03-08 10:07:47] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 10:07:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 10:07:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:47] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-08 10:07:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:07:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 10:07:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-08 10:07:47] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 10:07:47] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 10:07:47] [INFO ] Invariant cache hit.
[2023-03-08 10:07:47] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 10:07:47] [INFO ] Invariant cache hit.
[2023-03-08 10:07:47] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-08 10:07:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:07:47] [INFO ] Invariant cache hit.
[2023-03-08 10:07:47] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 6/6 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 204 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=204 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-08 10:07:47] [INFO ] Invariant cache hit.
[2023-03-08 10:07:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 10:07:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:47] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-08 10:07:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:07:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 10:07:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:47] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-08 10:07:47] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 10:07:47] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10206 reset in 98 ms.
Product exploration explored 100000 steps with 10258 reset in 118 ms.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 10:07:48] [INFO ] Invariant cache hit.
[2023-03-08 10:07:48] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 10:07:48] [INFO ] Invariant cache hit.
[2023-03-08 10:07:48] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-08 10:07:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:07:48] [INFO ] Invariant cache hit.
[2023-03-08 10:07:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-08 finished in 2041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p1)||G(p2)||p0))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 10:07:48] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 10:07:48] [INFO ] Implicit Places using invariants in 40 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LT s10 1), p0:(OR (LT s3 1) (LT s14 1)), p2:(OR (LT s8 1) (LT s15 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0 p2)
Knowledge based reduction with 9 factoid took 292 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-09 finished in 616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U G(p1))||(G(!p1) U p2)))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
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 3 rules applied. Total rules applied 3 place count 23 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 7 place count 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 19 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 19 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 17 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 10
Applied a total of 16 rules in 4 ms. Remains 15 /23 variables (removed 8) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 15 cols
[2023-03-08 10:07:48] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-08 10:07:48] [INFO ] Implicit Places using invariants in 40 ms returned [9, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/23 places, 10/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 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 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 10 transition count 7
Applied a total of 6 rules in 5 ms. Remains 10 /13 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 10:07:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 10:07:48] [INFO ] Implicit Places using invariants in 32 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/23 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 85 ms. Remains : 9/23 places, 7/18 transitions.
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), p1, (NOT p2), (AND p1 (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p1 p0), acceptance={} source=4 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(GEQ s3 1), p0:(AND (GEQ s5 1) (GEQ s8 1)), p2:(OR (GEQ s3 1) (AND (GEQ s5 1) (GEQ s8 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 19 steps with 1 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-10 finished in 452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X(G(p1)))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 10:07:49] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 10:07:49] [INFO ] Implicit Places using invariants in 36 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s18 1), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-11 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0||X(p1)))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-08 10:07:49] [INFO ] Invariant cache hit.
[2023-03-08 10:07:49] [INFO ] Implicit Places using invariants in 28 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s14 1)), p1:(GEQ s12 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 15082 reset in 62 ms.
Product exploration explored 100000 steps with 15139 reset in 72 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 1003 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=501 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 10:07:50] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 10:07:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:50] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-08 10:07:50] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 10:07:50] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (AND p0 (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 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 10:07:50] [INFO ] Invariant cache hit.
[2023-03-08 10:07:50] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 10:07:50] [INFO ] Invariant cache hit.
[2023-03-08 10:07:50] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-08 10:07:50] [INFO ] Invariant cache hit.
[2023-03-08 10:07:50] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 1003 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=501 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-08 10:07:51] [INFO ] Invariant cache hit.
[2023-03-08 10:07:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 10:07:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 10:07:51] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 10:07:51] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 104 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 15105 reset in 61 ms.
Product exploration explored 100000 steps with 15053 reset in 74 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 157 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND 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 0 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.
[2023-03-08 10:07:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2023-03-08 10:07:52] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 10:07:52] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/21 places, 16/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 19/21 places, 16/18 transitions.
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 3 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 10:07:52] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 10:07:52] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 10:07:52] [INFO ] Invariant cache hit.
[2023-03-08 10:07:52] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-08 10:07:52] [INFO ] Invariant cache hit.
[2023-03-08 10:07:52] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-15 finished in 2697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U (F(p1) U p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(p1)&&p0))&&X(X(F(!p2))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0100P0-LTLFireability-05
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), (AND (NOT p0) p1), p2, p2]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 3 rules applied. Total rules applied 3 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 20 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 18 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 18 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 16 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 18 place count 13 transition count 10
Applied a total of 18 rules in 6 ms. Remains 13 /23 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-08 10:07:52] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 10:07:52] [INFO ] Implicit Places using invariants in 27 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/23 places, 10/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 7
Applied a total of 6 rules in 4 ms. Remains 9 /12 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-08 10:07:52] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 10:07:52] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-08 10:07:52] [INFO ] Invariant cache hit.
[2023-03-08 10:07:53] [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.
Starting structural reductions in LI_LTL mode, iteration 2 : 9/23 places, 7/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 94 ms. Remains : 9/23 places, 7/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s6 1)), p1:(GEQ s7 1), p2:(AND (GEQ s2 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22445 reset in 135 ms.
Stack based approach found an accepted trace after 946 steps with 211 reset with depth 7 and stack size 7 in 2 ms.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-05 finished in 614 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(!p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0||X(p1)))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0100P0-LTLFireability-15
Stuttering acceptance computed with spot in 138 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 5 rules applied. Total rules applied 5 place count 22 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 10 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 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 12 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 16 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 22 place count 11 transition count 8
Applied a total of 22 rules in 5 ms. Remains 11 /23 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 10:07:53] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 10:07:53] [INFO ] Implicit Places using invariants in 27 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/23 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 LI_LTL mode , in 2 iterations and 34 ms. Remains : 10/23 places, 8/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s7 1)), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25003 reset in 49 ms.
Product exploration explored 100000 steps with 25022 reset in 71 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
// Phase 1: matrix 8 rows 10 cols
[2023-03-08 10:07:54] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 10:07:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:54] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 10:07:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:07:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:54] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-08 10:07:54] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 10:07:54] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p1) p0)
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 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 10:07:54] [INFO ] Invariant cache hit.
[2023-03-08 10:07:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-08 10:07:54] [INFO ] Invariant cache hit.
[2023-03-08 10:07:54] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-08 10:07:54] [INFO ] Invariant cache hit.
[2023-03-08 10:07:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 10/10 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 202 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=202 )
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-08 10:07:55] [INFO ] Invariant cache hit.
[2023-03-08 10:07:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 10:07:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:55] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 10:07:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:07:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 10:07:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:07:55] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-08 10:07:55] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 10:07:55] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 119 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 24903 reset in 86 ms.
Product exploration explored 100000 steps with 25096 reset in 102 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 124 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND 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.
[2023-03-08 10:07:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:07:56] [INFO ] Invariant cache hit.
[2023-03-08 10:07:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34 ms. Remains : 10/10 places, 8/8 transitions.
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.
[2023-03-08 10:07:56] [INFO ] Invariant cache hit.
[2023-03-08 10:07:56] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-08 10:07:56] [INFO ] Invariant cache hit.
[2023-03-08 10:07:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-08 10:07:56] [INFO ] Invariant cache hit.
[2023-03-08 10:07:56] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 10/10 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-15 finished in 3035 ms.
[2023-03-08 10:07:56] [INFO ] Flatten gal took : 7 ms
[2023-03-08 10:07:56] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-08 10:07:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 23 places, 18 transitions and 50 arcs took 1 ms.
Total runtime 33645 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N0100P0
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678270087634

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 ClientsAndServers-PT-N0100P0-LTLFireability-05
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ClientsAndServers-PT-N0100P0-LTLFireability-05
lola: result : false
lola: markings : 32741
lola: fired transitions : 32873
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 12 ClientsAndServers-PT-N0100P0-LTLFireability-15
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for ClientsAndServers-PT-N0100P0-LTLFireability-15
lola: result : true
lola: markings : 281001
lola: fired transitions : 420900
lola: time used : 1.000000
lola: memory pages used : 2
lola: LAUNCH task # 10 (type EXCL) for 9 ClientsAndServers-PT-N0100P0-LTLFireability-08
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for ClientsAndServers-PT-N0100P0-LTLFireability-08
lola: result : false
lola: markings : 5001
lola: fired transitions : 5001
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 ClientsAndServers-PT-N0100P0-LTLFireability-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0100P0-LTLFireability-05: LTL false LTL model checker
ClientsAndServers-PT-N0100P0-LTLFireability-08: LTL false LTL model checker
ClientsAndServers-PT-N0100P0-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0100P0-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0100P0-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/1799 20/32 ClientsAndServers-PT-N0100P0-LTLFireability-04 2941553 m, 588310 m/sec, 4866234 t fired, .

Time elapsed: 5 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 4 (type EXCL) for ClientsAndServers-PT-N0100P0-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0100P0-LTLFireability-05: LTL false LTL model checker
ClientsAndServers-PT-N0100P0-LTLFireability-08: LTL false LTL model checker
ClientsAndServers-PT-N0100P0-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0100P0-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0100P0-LTLFireability-04: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 1 (type EXCL) for 0 ClientsAndServers-PT-N0100P0-LTLFireability-02
lola: time limit : 3590 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ClientsAndServers-PT-N0100P0-LTLFireability-02
lola: result : false
lola: markings : 3206
lola: fired transitions : 3207
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 5

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0100P0-LTLFireability-02: LTL false LTL model checker
ClientsAndServers-PT-N0100P0-LTLFireability-04: LTL unknown AGGR
ClientsAndServers-PT-N0100P0-LTLFireability-05: LTL false LTL model checker
ClientsAndServers-PT-N0100P0-LTLFireability-08: LTL false LTL model checker
ClientsAndServers-PT-N0100P0-LTLFireability-15: LTL true LTL model checker


Time elapsed: 10 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0100P0"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ClientsAndServers-PT-N0100P0, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397800316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0100P0.tgz
mv ClientsAndServers-PT-N0100P0 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;