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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 13:26 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.4K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 13:27 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.1K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678257270032

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-N0002P0
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 06:34:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 06:34:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:34:33] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-08 06:34:33] [INFO ] Transformed 25 places.
[2023-03-08 06:34:33] [INFO ] Transformed 18 transitions.
[2023-03-08 06:34:33] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 21 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-08 06:34:34] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-08 06:34:34] [INFO ] Implicit Places using invariants in 227 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 296 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 321 ms. Remains : 23/25 places, 18/18 transitions.
Support contains 21 out of 23 places after structural reductions.
[2023-03-08 06:34:34] [INFO ] Flatten gal took : 33 ms
[2023-03-08 06:34:34] [INFO ] Flatten gal took : 9 ms
[2023-03-08 06:34:34] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 26) seen :25
Finished Best-First random walk after 37 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 20 transition count 18
Applied a total of 3 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 06:34:35] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-08 06:34:35] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 06:34:35] [INFO ] Invariant cache hit.
[2023-03-08 06:34:35] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-08 06:34:35] [INFO ] Invariant cache hit.
[2023-03-08 06:34:35] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P0-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s3)], 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]]
Stuttering criterion allowed to conclude after 7625 steps with 208 reset in 85 ms.
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P0-LTLCardinality-01 finished in 745 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)&&(G(p1)||F((p2 U (p3||G(p2))))))))'
Support contains 7 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 20 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 7 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 3 with 4 rules applied. Total rules applied 11 place count 17 transition count 13
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 13 place count 16 transition count 12
Applied a total of 13 rules in 23 ms. Remains 16 /23 variables (removed 7) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 16 cols
[2023-03-08 06:34:36] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 06:34:36] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 06:34:36] [INFO ] Invariant cache hit.
[2023-03-08 06:34:36] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-08 06:34:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 06:34:36] [INFO ] Invariant cache hit.
[2023-03-08 06:34:36] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/23 places, 12/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 16/23 places, 12/18 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0002P0-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s9), p1:(LEQ s2 s13), p3:(AND (GT s12 s1) (GT s14 s8)), p2:(GT s14 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 4151 reset in 419 ms.
Stack based approach found an accepted trace after 70 steps with 2 reset with depth 50 and stack size 50 in 1 ms.
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P0-LTLCardinality-02 finished in 878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 20 transition count 10
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 11 transition count 8
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 23 place count 10 transition count 8
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 27 place count 8 transition count 6
Applied a total of 27 rules in 8 ms. Remains 8 /23 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-08 06:34:37] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 06:34:37] [INFO ] Implicit Places using invariants in 65 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/23 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 7/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P0-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3671 reset in 394 ms.
Stack based approach found an accepted trace after 521 steps with 17 reset with depth 42 and stack size 42 in 13 ms.
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P0-LTLCardinality-04 finished in 610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 06:34:37] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-08 06:34:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 06:34:37] [INFO ] Invariant cache hit.
[2023-03-08 06:34:37] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-08 06:34:37] [INFO ] Invariant cache hit.
[2023-03-08 06:34:37] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0002P0-LTLCardinality-06 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=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (LEQ s19 s13) (LEQ s3 s0) (LEQ 2 s0)), p0:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P0-LTLCardinality-06 finished in 415 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&&F(G(p1))))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
[2023-03-08 06:34:38] [INFO ] Invariant cache hit.
[2023-03-08 06:34:38] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 06:34:38] [INFO ] Invariant cache hit.
[2023-03-08 06:34:38] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-08 06:34:38] [INFO ] Invariant cache hit.
[2023-03-08 06:34:38] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P0-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s15), p1:(LEQ s10 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 134 reset in 279 ms.
Product exploration explored 100000 steps with 147 reset in 238 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 (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 400 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 35 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished Best-First random walk after 37 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 253 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Support contains 2 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 11
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 12 transition count 9
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 18 place count 11 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 9 transition count 7
Applied a total of 22 rules in 9 ms. Remains 9 /20 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-08 06:34:39] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 06:34:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 06:34:39] [INFO ] Invariant cache hit.
[2023-03-08 06:34:39] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-08 06:34:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 06:34:39] [INFO ] Invariant cache hit.
[2023-03-08 06:34:39] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/20 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 9/20 places, 7/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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Incomplete random walk after 10001 steps, including 62 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Finished Best-First random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1)]
Product exploration explored 100000 steps with 246 reset in 172 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 37 in 0 ms.
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P0-LTLCardinality-07 finished in 2733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 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 9 rules applied. Total rules applied 9 place count 20 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 14 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 12 transition count 10
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 19 place count 12 transition count 6
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 27 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 7 transition count 5
Applied a total of 29 rules in 5 ms. Remains 7 /23 variables (removed 16) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-08 06:34:40] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 06:34:40] [INFO ] Implicit Places using invariants in 33 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/23 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42 ms. Remains : 6/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P0-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 166 steps with 4 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P0-LTLCardinality-08 finished in 165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(p0))||(p1&&F(p0))))&&F(G(p1)))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 16 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 14 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 14 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 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
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 10 transition count 8
Applied a total of 23 rules in 14 ms. Remains 10 /23 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-08 06:34:40] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 06:34:40] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 06:34:40] [INFO ] Invariant cache hit.
[2023-03-08 06:34:41] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-08 06:34:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 06:34:41] [INFO ] Invariant cache hit.
[2023-03-08 06:34:41] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/23 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 10/23 places, 8/18 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P0-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s7 s9), p0:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 438 steps with 1 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P0-LTLCardinality-09 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G((G(p0)||X(p1))))) U (p2&&F(p3)))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 20 transition count 18
Applied a total of 3 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 06:34:41] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 06:34:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 06:34:41] [INFO ] Invariant cache hit.
[2023-03-08 06:34:41] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-08 06:34:41] [INFO ] Invariant cache hit.
[2023-03-08 06:34:41] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 510 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0002P0-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(LEQ 1 s10), p3:(LEQ s2 s17), p0:(GT s13 s0), p1:(GT 3 s1)], 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14309 reset in 147 ms.
Product exploration explored 100000 steps with 14282 reset in 151 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p3)))), true, (X (X p3)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 568 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 496 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
Incomplete random walk after 10002 steps, including 31 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :8
Finished Best-First random walk after 4813 steps, including 1 resets, run visited all 1 properties in 16 ms. (steps per millisecond=300 )
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p3)))), true, (X (X p3)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F p2), (F (NOT p3)), (F (AND p2 (NOT p3))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 1045 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 484 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 505 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
[2023-03-08 06:34:45] [INFO ] Invariant cache hit.
[2023-03-08 06:34:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-08 06:34:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:34:45] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-08 06:34:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:34:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 06:34:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:34:45] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-08 06:34:45] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 06:34:45] [INFO ] Added : 11 causal constraints over 3 iterations in 40 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 06:34:45] [INFO ] Invariant cache hit.
[2023-03-08 06:34:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 06:34:45] [INFO ] Invariant cache hit.
[2023-03-08 06:34:45] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-08 06:34:45] [INFO ] Invariant cache hit.
[2023-03-08 06:34:45] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p3)))), true, (X (X p3)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 554 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
Incomplete random walk after 10002 steps, including 32 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :8
Finished Best-First random walk after 685 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=342 )
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p3)))), true, (X (X p3)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F p2), (F (NOT p3)), (F (AND p2 (NOT p3))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 839 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 479 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 486 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
[2023-03-08 06:34:48] [INFO ] Invariant cache hit.
[2023-03-08 06:34:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 06:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:34:48] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 06:34:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:34:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 06:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:34:48] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-08 06:34:48] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 06:34:48] [INFO ] Added : 11 causal constraints over 3 iterations in 30 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 574 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 14304 reset in 129 ms.
Product exploration explored 100000 steps with 14234 reset in 144 ms.
Applying partial POR strategy [false, false, false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 493 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 20 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 20 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 19 transition count 17
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 19 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 19 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 18 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 18 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 12 rules in 19 ms. Remains 18 /20 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2023-03-08 06:34:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 18 cols
[2023-03-08 06:34:50] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 06:34:50] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/20 places, 16/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 18/20 places, 16/18 transitions.
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 06:34:50] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-08 06:34:50] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 06:34:50] [INFO ] Invariant cache hit.
[2023-03-08 06:34:50] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-08 06:34:50] [INFO ] Invariant cache hit.
[2023-03-08 06:34:50] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0002P0-LTLCardinality-10 finished in 9727 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)||G(p1))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 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 9 rules applied. Total rules applied 9 place count 20 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 14 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 10 transition count 8
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 27 place count 8 transition count 6
Applied a total of 27 rules in 7 ms. Remains 8 /23 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-08 06:34:51] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 06:34:51] [INFO ] Implicit Places using invariants in 34 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/23 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56 ms. Remains : 7/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0002P0-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s1), p1:(GT 2 s6)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 309 reset in 189 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P0-LTLCardinality-11 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1))||(p2 U p0))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 06:34:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 06:34:51] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 06:34:51] [INFO ] Invariant cache hit.
[2023-03-08 06:34:51] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-08 06:34:51] [INFO ] Invariant cache hit.
[2023-03-08 06:34:51] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0002P0-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GT s20 s17) (LEQ 2 s16)), p0:(AND (LEQ s20 s17) (LEQ 2 s16)), p2:(LEQ s20 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 55 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P0-LTLCardinality-12 finished in 482 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 ((p0||X(G(p2)))&&p1)))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 06:34:51] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 06:34:51] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 06:34:51] [INFO ] Invariant cache hit.
[2023-03-08 06:34:51] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-08 06:34:51] [INFO ] Invariant cache hit.
[2023-03-08 06:34:51] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), true, (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N0002P0-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p2:(LEQ s4 s11), p1:(AND (LEQ s17 s11) (LEQ s0 s11)), p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 234 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0002P0-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P0-LTLCardinality-15 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G((G(p0)||X(p1))))) U (p2&&F(p3)))))'
[2023-03-08 06:34:52] [INFO ] Flatten gal took : 6 ms
[2023-03-08 06:34:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 06:34:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 23 places, 18 transitions and 48 arcs took 0 ms.
Total runtime 18783 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N0002P0
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

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

BK_STOP 1678257295190

--------------------
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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ClientsAndServers-PT-N0002P0-LTLCardinality-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ClientsAndServers-PT-N0002P0-LTLCardinality-10
lola: result : false
lola: markings : 589214
lola: fired transitions : 1614223
lola: time used : 2.000000
lola: memory pages used : 4
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0002P0-LTLCardinality-10: LTL false LTL model checker


Time elapsed: 2 secs. Pages in use: 4

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

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