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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 13:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 26 13:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678269456787

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0020P4
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 09:57:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 09:57:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 09:57:40] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-08 09:57:40] [INFO ] Transformed 25 places.
[2023-03-08 09:57:40] [INFO ] Transformed 18 transitions.
[2023-03-08 09:57:40] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 09:57:41] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-08 09:57:41] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-08 09:57:41] [INFO ] Invariant cache hit.
[2023-03-08 09:57:41] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-08 09:57:41] [INFO ] Invariant cache hit.
[2023-03-08 09:57:41] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 20 out of 24 places after structural reductions.
[2023-03-08 09:57:41] [INFO ] Flatten gal took : 33 ms
[2023-03-08 09:57:41] [INFO ] Flatten gal took : 11 ms
[2023-03-08 09:57:41] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 4171 steps, including 1 resets, run visited all 19 properties in 130 ms. (steps per millisecond=32 )
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-07 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(X(X(G((F(p1)&&p0))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 4 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 09:57:42] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-08 09:57:42] [INFO ] Implicit Places using invariants in 73 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 572 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s15 1)), p1:(OR (LT s16 1) (LT s4 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-00 finished in 761 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 U (p1||G(p0))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 3 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 09:57:43] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 09:57:43] [INFO ] Implicit Places using invariants in 52 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s14 1) (GEQ s17 1)), p0:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1264 reset in 535 ms.
Product exploration explored 100000 steps with 1304 reset in 321 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 367 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=122 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 440 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 09:57:45] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 09:57:45] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-08 09:57:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:57:45] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 09:57:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:57:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 09:57:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:57:45] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-08 09:57:45] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 09:57:45] [INFO ] Added : 9 causal constraints over 2 iterations in 43 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 09:57:45] [INFO ] Invariant cache hit.
[2023-03-08 09:57:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 09:57:45] [INFO ] Invariant cache hit.
[2023-03-08 09:57:45] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 09:57:45] [INFO ] Invariant cache hit.
[2023-03-08 09:57:45] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 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) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 367 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=122 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 326 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-08 09:57:46] [INFO ] Invariant cache hit.
[2023-03-08 09:57:46] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-08 09:57:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:57:46] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 09:57:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:57:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 09:57:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:57:47] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-08 09:57:47] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 09:57:47] [INFO ] Added : 9 causal constraints over 2 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1303 reset in 334 ms.
Stack based approach found an accepted trace after 78148 steps with 994 reset with depth 41 and stack size 41 in 202 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-02 finished in 4292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 21 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 21 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 20 transition count 14
Applied a total of 8 rules in 17 ms. Remains 20 /24 variables (removed 4) and now considering 14/18 (removed 4) transitions.
// Phase 1: matrix 14 rows 20 cols
[2023-03-08 09:57:47] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-08 09:57:47] [INFO ] Implicit Places using invariants in 51 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/24 places, 14/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 19 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18 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 2 place count 18 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 4 place count 17 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 16 transition count 11
Applied a total of 6 rules in 7 ms. Remains 16 /19 variables (removed 3) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 16 cols
[2023-03-08 09:57:47] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 09:57:47] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 09:57:47] [INFO ] Invariant cache hit.
[2023-03-08 09:57:47] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/24 places, 11/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 16/24 places, 11/18 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s12 1)), p1:(OR (AND (GEQ s1 1) (GEQ s10 1)) (AND (GEQ s5 1) (GEQ s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 86195 steps with 0 reset in 297 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-03 finished in 599 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 U p1)&&G(((p2 U F(!X(p3))) U p2)))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 21 transition count 17
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 21 transition count 13
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 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 2 with 2 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 15 transition count 11
Applied a total of 16 rules in 16 ms. Remains 15 /24 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-08 09:57:48] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 09:57:48] [INFO ] Implicit Places using invariants in 43 ms returned [7, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/24 places, 11/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64 ms. Remains : 13/24 places, 11/18 transitions.
Stuttering acceptance computed with spot in 535 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p2) (AND (NOT p1) p3)), (NOT p2), (OR (AND (NOT p1) p3) (AND (NOT p2) p3)), (AND (NOT p1) p3), (AND (NOT p2) p3)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={} source=2 dest: 5}, { cond=(OR (AND p1 p2 p3) (AND p0 p2 p3)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p2) p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={0} source=4 dest: 5}, { cond=(OR (AND p1 p2 p3) (AND p0 p2 p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=6 dest: 4}, { cond=(AND p2 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LT s5 1), p0:(AND (GEQ s4 1) (GEQ s11 1)), p2:(AND (GEQ s3 1) (GEQ s10 1)), p3:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1296 reset in 238 ms.
Stack based approach found an accepted trace after 27415 steps with 345 reset with depth 661 and stack size 660 in 91 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-05 finished in 972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (!p0&&X(X((X(F(!p1))&&G(p2)))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 09:57:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 09:57:49] [INFO ] Implicit Places using invariants in 43 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 533 ms :[(OR (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1 p0), true, true, (OR (NOT p2) p1), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p2), acceptance={} source=2 dest: 6}, { cond=p2, acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=p2, acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 6}, { cond=(AND p2 p1), acceptance={0} source=7 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=4, aps=[p0:(AND (GEQ s2 1) (GEQ s14 1)), p2:(LT s18 1), p1:(AND (GEQ s3 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-06 finished in 620 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||F(!p1))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2023-03-08 09:57:49] [INFO ] Invariant cache hit.
[2023-03-08 09:57:50] [INFO ] Implicit Places using invariants in 55 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/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(GEQ s15 1), p0:(AND (GEQ s7 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-08 finished in 740 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)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 3 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2023-03-08 09:57:50] [INFO ] Invariant cache hit.
[2023-03-08 09:57:50] [INFO ] Implicit Places using invariants in 58 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-09 finished in 204 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 (G(!p2)&&X(F((!p0||G(p3))))&&p1)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 09:57:50] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 09:57:50] [INFO ] Implicit Places using invariants in 48 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) p2 (AND p0 (NOT p3))), true, p2, (AND p0 (NOT p3)), p2]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p0) (AND p2 p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p3), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p0), acceptance={0} source=4 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s18 1)), p0:(LT s6 1), p2:(OR (LT s4 1) (LT s18 1)), p3:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 98 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-10 finished in 358 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(F(p1))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 09:57:51] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 09:57:51] [INFO ] Implicit Places using invariants in 52 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (GEQ s8 1) (GEQ s14 1)), p1:(AND (GEQ s5 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-12 finished in 617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(!p0))) U p1))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 4 rules applied. Total rules applied 4 place count 23 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 18 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 9 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-08 09:57:51] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 09:57:51] [INFO ] Implicit Places using invariants in 36 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/24 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
Applied a total of 2 rules in 3 ms. Remains 11 /12 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 09:57:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 09:57:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 09:57:51] [INFO ] Invariant cache hit.
[2023-03-08 09:57:51] [INFO ] Implicit Places using invariants and state equation in 43 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/24 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 11/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 161 ms :[p0, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1)), p1:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 25060 reset in 121 ms.
Product exploration explored 100000 steps with 25013 reset in 145 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 326 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) p0), p0, (OR (NOT p1) p0)]
Finished random walk after 870 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=290 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p0), (F p1), (F (AND p1 p0))]
Knowledge based reduction with 5 factoid took 391 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 :[(OR (NOT p1) p0), p0, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) p0), p0, (OR (NOT p1) p0)]
[2023-03-08 09:57:53] [INFO ] Invariant cache hit.
[2023-03-08 09:57:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 09:57:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:57:53] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-08 09:57:53] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 09:57:53] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 09:57:53] [INFO ] Invariant cache hit.
[2023-03-08 09:57:53] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 09:57:53] [INFO ] Invariant cache hit.
[2023-03-08 09:57:53] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-08 09:57:53] [INFO ] Invariant cache hit.
[2023-03-08 09:57:53] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 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 (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
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 158 ms :[(OR (NOT p1) p0), p0, (OR (NOT p1) p0)]
Finished random walk after 1967 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=393 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p0), (F p1), (F (AND p1 p0))]
Knowledge based reduction with 5 factoid took 436 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 159 ms :[(OR (NOT p1) p0), p0, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) p0), p0, (OR (NOT p1) p0)]
[2023-03-08 09:57:55] [INFO ] Invariant cache hit.
[2023-03-08 09:57:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 09:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:57:55] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 09:57:55] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 09:57:55] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) p0), p0, (OR (NOT p1) p0)]
Product exploration explored 100000 steps with 25018 reset in 111 ms.
Product exploration explored 100000 steps with 24990 reset in 132 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) p0), p0, (OR (NOT p1) p0)]
Support contains 4 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 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 09:57:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:57:56] [INFO ] Invariant cache hit.
[2023-03-08 09:57:56] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 11/11 places, 8/8 transitions.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 09:57:56] [INFO ] Invariant cache hit.
[2023-03-08 09:57:56] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 09:57:56] [INFO ] Invariant cache hit.
[2023-03-08 09:57:56] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-08 09:57:56] [INFO ] Invariant cache hit.
[2023-03-08 09:57:56] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 11/11 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-13 finished in 4611 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(!p2)||p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 09:57:56] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 09:57:56] [INFO ] Implicit Places using invariants in 56 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (OR p0 (AND (NOT p1) p2)), p2, (OR p0 (AND (NOT p1) p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(OR p0 (AND (NOT p1) p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(GEQ s16 1), p0:(LT s6 1), p1:(OR (LT s4 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-14 finished in 263 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(X(p0)) U p1)&&X((X(p1) U p0))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-08 09:57:56] [INFO ] Invariant cache hit.
[2023-03-08 09:57:56] [INFO ] Implicit Places using invariants in 47 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(AND (GEQ s0 1) (GEQ s13 1)), p1:(AND (GEQ s4 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, 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-N0020P4-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-15 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(!p0))) U p1))'
[2023-03-08 09:57:57] [INFO ] Flatten gal took : 7 ms
[2023-03-08 09:57:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 09:57:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 18 transitions and 52 arcs took 0 ms.
Total runtime 16770 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N0020P4
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678269479356

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:346
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-N0020P4-LTLFireability-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ClientsAndServers-PT-N0020P4-LTLFireability-13
lola: result : true
lola: markings : 451081
lola: fired transitions : 888880
lola: time used : 1.000000
lola: memory pages used : 3
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P4-LTLFireability-13: LTL true LTL model checker


Time elapsed: 1 secs. Pages in use: 3

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-N0020P4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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