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-167814397900331.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-N0500P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397900331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 13:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 13:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.1K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678270840227

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0500P0
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 10:20:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 10:20:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:20:43] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-08 10:20:43] [INFO ] Transformed 25 places.
[2023-03-08 10:20:43] [INFO ] Transformed 18 transitions.
[2023-03-08 10:20:43] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 23 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-08 10:20:43] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-08 10:20:44] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-08 10:20:44] [INFO ] Invariant cache hit.
[2023-03-08 10:20:44] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-08 10:20:44] [INFO ] Invariant cache hit.
[2023-03-08 10:20:44] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 495 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 19 out of 24 places after structural reductions.
[2023-03-08 10:20:44] [INFO ] Flatten gal took : 34 ms
[2023-03-08 10:20:44] [INFO ] Flatten gal took : 11 ms
[2023-03-08 10:20:44] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 12005 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=353 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 19) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 10:20:45] [INFO ] Invariant cache hit.
[2023-03-08 10:20:45] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 10:20:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 10:20:45] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:20:45] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-08 10:20:45] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 10:20:45] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 8568 steps, including 0 resets, run visited all 1 properties in 31 ms. (steps per millisecond=276 )
Parikh walk visited 4 properties in 1390 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&F(G(p1))))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 3 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 10:20:47] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-08 10:20:47] [INFO ] Implicit Places using invariants in 67 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 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 75 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 556 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 s17), p1:(LEQ s9 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-02 finished in 736 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((X(p0)||(p1 U G(p2))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 10:20:47] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 10:20:47] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-08 10:20:47] [INFO ] Invariant cache hit.
[2023-03-08 10:20:47] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-08 10:20:47] [INFO ] Invariant cache hit.
[2023-03-08 10:20:48] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 539 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(AND (LEQ 2 s20) (LEQ s9 s14)), p1:(LEQ s1 s6), p0:(OR (LEQ s9 s6) (LEQ 2 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24983 reset in 530 ms.
Product exploration explored 100000 steps with 25037 reset in 359 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) p1 p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1098 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 428 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=2000 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 10:20:51] [INFO ] Invariant cache hit.
[2023-03-08 10:20:51] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:7
[2023-03-08 10:20:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 10:20:51] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-08 10:20:51] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-08 10:20:51] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Finished Parikh walk after 33845 steps, including 2 resets, run visited all 7 properties in 852 ms. (steps per millisecond=39 )
Parikh walk visited 7 properties in 851 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (G (NOT (AND p2 (NOT p0)))), (G (NOT (AND p2 (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F p2), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p2 (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p2) p1))), (F (AND p2 p1))]
Knowledge based reduction with 16 factoid took 1643 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 372 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 10:20:55] [INFO ] Invariant cache hit.
[2023-03-08 10:20:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 10:20:55] [INFO ] Invariant cache hit.
[2023-03-08 10:20:55] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-08 10:20:55] [INFO ] Invariant cache hit.
[2023-03-08 10:20:55] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p1), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 516 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 368 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=2000 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-08 10:20:56] [INFO ] Invariant cache hit.
[2023-03-08 10:20:56] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 10:20:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-08 10:20:57] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 10:20:57] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-08 10:20:57] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 55 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 6 properties in 939 ms.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p1), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) p1)), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND (NOT p2) p1))), (F (AND p2 p1))]
Knowledge based reduction with 7 factoid took 813 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 373 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 360 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 24975 reset in 173 ms.
Product exploration explored 100000 steps with 24978 reset in 549 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 368 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 22 transition count 18
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 22 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 22 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 21 transition count 17
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 21 transition count 17
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 9 rules in 23 ms. Remains 21 /22 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2023-03-08 10:21:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 21 cols
[2023-03-08 10:21:01] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 10:21:01] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/22 places, 17/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 21/22 places, 17/18 transitions.
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 10:21:01] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 10:21:01] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 10:21:01] [INFO ] Invariant cache hit.
[2023-03-08 10:21:01] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-08 10:21:01] [INFO ] Invariant cache hit.
[2023-03-08 10:21:01] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-04 finished in 13941 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&&G(!p1))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 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 23 transition count 14
Reduce places removed 4 places and 0 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 1 with 7 rules applied. Total rules applied 12 place count 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 14 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 11 transition count 7
Applied a total of 24 rules in 15 ms. Remains 11 /24 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2023-03-08 10:21:01] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 10:21:01] [INFO ] Implicit Places using invariants in 39 ms returned [7, 10]
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 : 9/24 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
Applied a total of 2 rules in 4 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-08 10:21:01] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 10:21:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 10:21:01] [INFO ] Invariant cache hit.
[2023-03-08 10:21:01] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/24 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 145 ms. Remains : 8/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s7 s2), p1:(LEQ 2 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 192 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 31 in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-05 finished in 474 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 U (p1||G(p0))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 22 place count 12 transition count 8
Applied a total of 22 rules in 7 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-08 10:21:02] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 10:21:02] [INFO ] Implicit Places using invariants in 57 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 8/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 7
Applied a total of 2 rules in 3 ms. Remains 10 /11 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 10:21:02] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 10:21:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 10:21:02] [INFO ] Invariant cache hit.
[2023-03-08 10:21:02] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/24 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 144 ms. Remains : 10/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT s5 s8) (GT 2 s4)), p0:(GT 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9 reset in 455 ms.
Stack based approach found an accepted trace after 241 steps with 0 reset with depth 242 and stack size 240 in 3 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-06 finished in 762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(X(p0))))))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 4 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 10:21:02] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 10:21:03] [INFO ] Implicit Places using invariants in 53 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 430 reset in 211 ms.
Stack based approach found an accepted trace after 69724 steps with 279 reset with depth 165 and stack size 165 in 165 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-07 finished in 727 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((F(p0)||(p1&&G(p2))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 3 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 10:21:03] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 10:21:03] [INFO ] Implicit Places using invariants in 51 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(LEQ 2 s2), p1:(GT s11 s17), p2:(GT s10 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 664 reset in 181 ms.
Stack based approach found an accepted trace after 16606 steps with 113 reset with depth 60 and stack size 60 in 34 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-11 finished in 652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 12 transition count 8
Applied a total of 22 rules in 5 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-08 10:21:04] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 10:21:04] [INFO ] Implicit Places using invariants in 46 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 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 11 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 9 transition count 6
Applied a total of 4 rules in 15 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-08 10:21:04] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 10:21:04] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 10:21:04] [INFO ] Invariant cache hit.
[2023-03-08 10:21:04] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/24 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 9/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s6 s7)], 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 19 reset in 142 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-12 finished in 425 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) U G(p1))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 10:21:04] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 10:21:04] [INFO ] Implicit Places using invariants in 56 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (NOT (AND (LEQ 2 s7) (LEQ 3 s2))) (LEQ 2 s18)), p0:(GT 2 s18)], 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 25024 reset in 216 ms.
Product exploration explored 100000 steps with 25007 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 p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 758 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3001 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 10:21:06] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 10:21:06] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 12 factoid took 279 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-13 finished in 2156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 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 8 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 10 place count 18 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 18 transition count 13
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 12 place count 17 transition count 13
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 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 17 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 19 place count 13 transition count 10
Applied a total of 19 rules in 15 ms. Remains 13 /24 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-08 10:21:06] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 10:21:06] [INFO ] Implicit Places using invariants in 39 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/24 places, 10/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 12/24 places, 10/18 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s11 s8), p1:(GT s1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 180 ms.
Stack based approach found an accepted trace after 8956 steps with 0 reset with depth 8957 and stack size 8957 in 23 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-14 finished in 430 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(G(p0))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 10:21:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 10:21:07] [INFO ] Implicit Places using invariants in 49 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LEQ 1 s10) (LEQ 2 s15))], 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 1 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-15 finished in 281 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((X(p0)||(p1 U G(p2))))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0500P0-LTLCardinality-04
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 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 8 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 10 place count 18 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 18 transition count 13
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 12 place count 17 transition count 13
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 11
Applied a total of 16 rules in 8 ms. Remains 15 /24 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-08 10:21:08] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 10:21:08] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 10:21:08] [INFO ] Invariant cache hit.
[2023-03-08 10:21:08] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-08 10:21:08] [INFO ] Invariant cache hit.
[2023-03-08 10:21:08] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 15/24 places, 11/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 134 ms. Remains : 15/24 places, 11/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(AND (LEQ 2 s13) (LEQ s8 s11)), p1:(LEQ s1 s5), p0:(OR (LEQ s8 s5) (LEQ 2 s13))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25064 reset in 174 ms.
Product exploration explored 100000 steps with 25050 reset in 201 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) p1 p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1054 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 402 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 10:21:11] [INFO ] Invariant cache hit.
[2023-03-08 10:21:11] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:7
[2023-03-08 10:21:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 10:21:11] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-08 10:21:11] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-08 10:21:11] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Finished Parikh walk after 24701 steps, including 2 resets, run visited all 4 properties in 346 ms. (steps per millisecond=71 )
Parikh walk visited 7 properties in 1290 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (G (NOT (AND p2 (NOT p0)))), (G (NOT (AND p2 (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F p2), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p2 (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p2) p1))), (F (AND p2 p1))]
Knowledge based reduction with 16 factoid took 1460 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 425 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 416 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-08 10:21:14] [INFO ] Invariant cache hit.
[2023-03-08 10:21:14] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 10:21:14] [INFO ] Invariant cache hit.
[2023-03-08 10:21:14] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-08 10:21:14] [INFO ] Invariant cache hit.
[2023-03-08 10:21:15] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 15/15 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p1), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 488 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-08 10:21:16] [INFO ] Invariant cache hit.
[2023-03-08 10:21:16] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 10:21:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 10:21:16] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 10:21:16] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-08 10:21:16] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 9843 steps, including 0 resets, run visited all 2 properties in 24 ms. (steps per millisecond=410 )
Parikh walk visited 6 properties in 560 ms.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p1), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) p1)), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND (NOT p2) p1))), (F (AND p2 p1))]
Knowledge based reduction with 7 factoid took 791 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 460 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 348 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Entered a terminal (fully accepting) state of product in 8485 steps with 2115 reset in 21 ms.
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-04 finished in 11602 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-08 10:21:19] [INFO ] Flatten gal took : 11 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 35848 ms.
ITS solved all properties within timeout

BK_STOP 1678270880577

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0500P0"
export BK_EXAMINATION="LTLCardinality"
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-N0500P0, examination is LTLCardinality"
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-167814397900331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0500P0.tgz
mv ClientsAndServers-PT-N0500P0 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;