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

About the Execution of LoLa+red for ClientsAndServers-PT-N0010P2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
407.424 30907.00 47248.00 811.60 TFFFFTFFFFFFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r071-smll-167814397800259.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-N0010P2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397800259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.8K Feb 26 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 26 13:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678263760139

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-N0010P2
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 08:22:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 08:22:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:22:43] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-08 08:22:43] [INFO ] Transformed 25 places.
[2023-03-08 08:22:43] [INFO ] Transformed 18 transitions.
[2023-03-08 08:22:43] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 13 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-08 08:22:43] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-08 08:22:43] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-08 08:22:44] [INFO ] Invariant cache hit.
[2023-03-08 08:22:44] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-08 08:22:44] [INFO ] Invariant cache hit.
[2023-03-08 08:22:44] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 420 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 24 out of 25 places after structural reductions.
[2023-03-08 08:22:44] [INFO ] Flatten gal took : 46 ms
[2023-03-08 08:22:44] [INFO ] Flatten gal took : 11 ms
[2023-03-08 08:22:44] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 30) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 08:22:45] [INFO ] Invariant cache hit.
[2023-03-08 08:22:45] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 08:22:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 08:22:45] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 08:22:45] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(((G(p1)||p0) U X(p2)))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 3 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 08:22:46] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 08:22:46] [INFO ] Implicit Places using invariants in 82 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 753 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LEQ s14 s17) (LEQ s10 s18)), p1:(GT s7 s11), p2:(LEQ s14 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 98 steps with 0 reset in 7 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P2-LTLCardinality-01 finished in 1109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(G(p1))))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2023-03-08 08:22:46] [INFO ] Invariant cache hit.
[2023-03-08 08:22:47] [INFO ] Implicit Places using invariants in 47 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 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/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLCardinality-03 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: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LEQ 1 s18), p1:(LEQ 1 s0)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P2-LTLCardinality-03 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1 U (G(p1)||(p1&&G(p0)))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 3 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 08:22:47] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 08:22:47] [INFO ] Implicit Places using invariants in 56 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 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 63 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 283 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(GT s19 s16), p0:(GT 2 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 413 ms.
Product exploration explored 100000 steps with 50000 reset in 420 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 (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 365 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P2-LTLCardinality-05 finished in 1574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 11 transition count 8
Applied a total of 24 rules in 20 ms. Remains 11 /25 variables (removed 14) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 08:22:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:22:48] [INFO ] Implicit Places using invariants in 54 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/25 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 9 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 7 transition count 6
Applied a total of 4 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-08 08:22:48] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:22:48] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 08:22:48] [INFO ] Invariant cache hit.
[2023-03-08 08:22:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 160 ms. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s6)], 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 10238 reset in 183 ms.
Product exploration explored 100000 steps with 10200 reset in 538 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-08 08:22:50] [INFO ] Invariant cache hit.
[2023-03-08 08:22:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 08:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:22:50] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-08 08:22:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:22:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 08:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:22:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-08 08:22:50] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 08:22:50] [INFO ] Added : 2 causal constraints over 1 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 08:22:50] [INFO ] Invariant cache hit.
[2023-03-08 08:22:50] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 08:22:50] [INFO ] Invariant cache hit.
[2023-03-08 08:22:50] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-08 08:22:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:22:50] [INFO ] Invariant cache hit.
[2023-03-08 08:22:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Finished random walk after 106 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=106 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-08 08:22:51] [INFO ] Invariant cache hit.
[2023-03-08 08:22:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 08:22:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:22:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 08:22:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:22:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 08:22:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:22:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-08 08:22:51] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 08:22:51] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10201 reset in 120 ms.
Product exploration explored 100000 steps with 10205 reset in 276 ms.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 08:22:51] [INFO ] Invariant cache hit.
[2023-03-08 08:22:51] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 08:22:51] [INFO ] Invariant cache hit.
[2023-03-08 08:22:51] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-08 08:22:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:22:51] [INFO ] Invariant cache hit.
[2023-03-08 08:22:51] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 7/7 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0010P2-LTLCardinality-06 finished in 3085 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 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 13 transition count 9
Applied a total of 21 rules in 8 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-08 08:22:51] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-08 08:22:52] [INFO ] Implicit Places using invariants in 64 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/25 places, 9/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 7
Applied a total of 4 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 08:22:52] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:22:52] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 08:22:52] [INFO ] Invariant cache hit.
[2023-03-08 08:22:52] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 10/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLCardinality-07 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:(LEQ s2 s8), p1:(OR (GT 2 s2) (GT s2 s8))], 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 2 reset in 266 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 1 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P2-LTLCardinality-07 finished in 628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 08:22:52] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 08:22:52] [INFO ] Implicit Places using invariants in 53 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ s4 s3) (LEQ 3 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3963 reset in 166 ms.
Stack based approach found an accepted trace after 22490 steps with 902 reset with depth 28 and stack size 28 in 46 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P2-LTLCardinality-08 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U (p2&&X(!p2))) U p3))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 08:22:52] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 08:22:53] [INFO ] Implicit Places using invariants in 44 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 407 ms :[(NOT p3), true, p2, (NOT p1), true, (AND (NOT p1) p2), p2]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=0 dest: 5}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(LEQ 2 s5), p2:(GT 2 s19), p1:(LEQ s11 s8), p0:(AND (LEQ s10 s16) (LEQ 2 s19))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 56009 steps with 5 reset in 236 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P2-LTLCardinality-09 finished in 731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p0)&&F(G(p1)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 14 transition count 10
Applied a total of 19 rules in 9 ms. Remains 14 /25 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-08 08:22:53] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 08:22:53] [INFO ] Implicit Places using invariants in 45 ms returned [10]
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 : 13/25 places, 10/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 11 transition count 8
Applied a total of 4 rules in 3 ms. Remains 11 /13 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 08:22:53] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:22:53] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 08:22:53] [INFO ] Invariant cache hit.
[2023-03-08 08:22:53] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/25 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 139 ms. Remains : 11/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), p0, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLCardinality-10 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 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s5), p1:(LEQ s9 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 5709 reset in 130 ms.
Product exploration explored 100000 steps with 5722 reset in 155 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 289 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), p0, (NOT p1)]
Finished random walk after 208 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=104 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 354 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), p0, (NOT p1)]
[2023-03-08 08:22:55] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), true]
Knowledge based reduction with 5 factoid took 394 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), p0, (NOT p1)]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 08:22:56] [INFO ] Invariant cache hit.
[2023-03-08 08:22:56] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 08:22:56] [INFO ] Invariant cache hit.
[2023-03-08 08:22:56] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-08 08:22:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:22:56] [INFO ] Invariant cache hit.
[2023-03-08 08:22:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 11/11 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 282 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), p0, (NOT p1)]
Finished random walk after 229 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 413 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), p0, (NOT p1)]
[2023-03-08 08:22:57] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), true]
Knowledge based reduction with 5 factoid took 372 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 5759 reset in 140 ms.
Product exploration explored 100000 steps with 5681 reset in 154 ms.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 6 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 08:22:58] [INFO ] Invariant cache hit.
[2023-03-08 08:22:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 08:22:59] [INFO ] Invariant cache hit.
[2023-03-08 08:22:59] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-08 08:22:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:22:59] [INFO ] Invariant cache hit.
[2023-03-08 08:22:59] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 11/11 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N0010P2-LTLCardinality-10 finished in 5493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 08:22:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 08:22:59] [INFO ] Implicit Places using invariants in 51 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s17), p1:(OR (GT 2 s4) (GT s10 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1045 reset in 205 ms.
Product exploration explored 100000 steps with 1087 reset in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 753 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=150 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 335 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 08:23:00] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:23:01] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 08:23:01] [INFO ] Invariant cache hit.
[2023-03-08 08:23:01] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-08 08:23:01] [INFO ] Invariant cache hit.
[2023-03-08 08:23:01] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 748 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=249 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 345 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1061 reset in 188 ms.
Product exploration explored 100000 steps with 1077 reset in 214 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 3 place count 21 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 19 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 19 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 12 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2023-03-08 08:23:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2023-03-08 08:23:03] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 08:23:03] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/21 places, 16/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 19/21 places, 16/18 transitions.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 08:23:03] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:23:03] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 08:23:03] [INFO ] Invariant cache hit.
[2023-03-08 08:23:03] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-08 08:23:03] [INFO ] Invariant cache hit.
[2023-03-08 08:23:03] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0010P2-LTLCardinality-11 finished in 4291 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 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 13 place count 17 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 14 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 13 transition count 9
Applied a total of 21 rules in 6 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-08 08:23:03] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 08:23:03] [INFO ] Implicit Places using invariants in 38 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/25 places, 9/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 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 10 transition count 7
Applied a total of 4 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 08:23:03] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:23:03] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 08:23:03] [INFO ] Invariant cache hit.
[2023-03-08 08:23:03] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 121 ms. Remains : 10/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ s3 s8), p0:(LEQ 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6833 reset in 157 ms.
Stack based approach found an accepted trace after 66 steps with 3 reset with depth 20 and stack size 20 in 0 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P2-LTLCardinality-12 finished in 349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 08:23:03] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 08:23:03] [INFO ] Implicit Places using invariants in 41 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LEQ s9 s2) (LEQ s5 s13)), p1:(LEQ s12 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P2-LTLCardinality-13 finished in 673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 17 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 15 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 12 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 11 transition count 8
Applied a total of 24 rules in 7 ms. Remains 11 /25 variables (removed 14) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 08:23:04] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 08:23:04] [INFO ] Implicit Places using invariants in 40 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/25 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 9 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 7 transition count 6
Applied a total of 4 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-08 08:23:04] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:23:04] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 08:23:04] [INFO ] Invariant cache hit.
[2023-03-08 08:23:04] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 115 ms. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s1), p0:(LEQ 3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 23042 steps with 0 reset in 32 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P2-LTLCardinality-15 finished in 264 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0010P2-LTLCardinality-11
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 9 place count 19 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 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 2 with 4 rules applied. Total rules applied 17 place count 15 transition count 11
Applied a total of 17 rules in 7 ms. Remains 15 /25 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-08 08:23:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 08:23:05] [INFO ] Implicit Places using invariants in 48 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/25 places, 11/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 59 ms. Remains : 14/25 places, 11/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s11), p1:(OR (GT 2 s4) (GT s7 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2745 reset in 173 ms.
Product exploration explored 100000 steps with 2735 reset in 193 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 210 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=105 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 336 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-08 08:23:06] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:23:06] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 08:23:06] [INFO ] Invariant cache hit.
[2023-03-08 08:23:07] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-08 08:23:07] [INFO ] Invariant cache hit.
[2023-03-08 08:23:07] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 14/14 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 (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 294 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=147 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 329 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2788 reset in 162 ms.
Product exploration explored 100000 steps with 2765 reset in 187 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-08 08:23:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:23:09] [INFO ] Invariant cache hit.
[2023-03-08 08:23:09] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 14/14 places, 11/11 transitions.
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-08 08:23:09] [INFO ] Invariant cache hit.
[2023-03-08 08:23:09] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 08:23:09] [INFO ] Invariant cache hit.
[2023-03-08 08:23:09] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-08 08:23:09] [INFO ] Invariant cache hit.
[2023-03-08 08:23:09] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 14/14 places, 11/11 transitions.
Treatment of property ClientsAndServers-PT-N0010P2-LTLCardinality-11 finished in 4163 ms.
[2023-03-08 08:23:09] [INFO ] Flatten gal took : 7 ms
[2023-03-08 08:23:09] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 08:23:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 1 ms.
Total runtime 25840 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N0010P2
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/367
LTLCardinality

FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678263791046

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/367/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/367/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/367/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 17 (type EXCL) for 0 ClientsAndServers-PT-N0010P2-LTLCardinality-06
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 17 (type EXCL) for ClientsAndServers-PT-N0010P2-LTLCardinality-06
lola: result : true
lola: markings : 107329
lola: fired transitions : 148365
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 15 (type EXCL) for 14 ClientsAndServers-PT-N0010P2-LTLCardinality-11
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 15 (type EXCL) for ClientsAndServers-PT-N0010P2-LTLCardinality-11
lola: result : false
lola: markings : 997
lola: fired transitions : 1205
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 3 ClientsAndServers-PT-N0010P2-LTLCardinality-10
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for ClientsAndServers-PT-N0010P2-LTLCardinality-10
lola: result : false
lola: markings : 91321
lola: fired transitions : 127951
lola: time used : 1.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0010P2-LTLCardinality-06: F false state space / EG
ClientsAndServers-PT-N0010P2-LTLCardinality-10: CONJ false LTL model checker
ClientsAndServers-PT-N0010P2-LTLCardinality-11: LTL false LTL model checker


Time elapsed: 1 secs. Pages in use: 1

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

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