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.r487-tall-167912703200556.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 TCPcondis-PT-40, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912703200556
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.1K Feb 26 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 16:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 16:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 26 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 5 18:23 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 TCPcondis-PT-40-LTLFireability-00
FORMULA_NAME TCPcondis-PT-40-LTLFireability-01
FORMULA_NAME TCPcondis-PT-40-LTLFireability-02
FORMULA_NAME TCPcondis-PT-40-LTLFireability-03
FORMULA_NAME TCPcondis-PT-40-LTLFireability-04
FORMULA_NAME TCPcondis-PT-40-LTLFireability-05
FORMULA_NAME TCPcondis-PT-40-LTLFireability-06
FORMULA_NAME TCPcondis-PT-40-LTLFireability-07
FORMULA_NAME TCPcondis-PT-40-LTLFireability-08
FORMULA_NAME TCPcondis-PT-40-LTLFireability-09
FORMULA_NAME TCPcondis-PT-40-LTLFireability-10
FORMULA_NAME TCPcondis-PT-40-LTLFireability-11
FORMULA_NAME TCPcondis-PT-40-LTLFireability-12
FORMULA_NAME TCPcondis-PT-40-LTLFireability-13
FORMULA_NAME TCPcondis-PT-40-LTLFireability-14
FORMULA_NAME TCPcondis-PT-40-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679202818907

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=TCPcondis-PT-40
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 05:13:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 05:13:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 05:13:40] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-19 05:13:40] [WARNING] Unknown XML tag in source file: size
[2023-03-19 05:13:40] [WARNING] Unknown XML tag in source file: color
[2023-03-19 05:13:40] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-19 05:13:40] [INFO ] Transformed 30 places.
[2023-03-19 05:13:40] [INFO ] Transformed 32 transitions.
[2023-03-19 05:13:40] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA TCPcondis-PT-40-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-40-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:13:40] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-19 05:13:40] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-19 05:13:40] [INFO ] Invariant cache hit.
[2023-03-19 05:13:40] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-19 05:13:40] [INFO ] Invariant cache hit.
[2023-03-19 05:13:40] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 22 out of 30 places after structural reductions.
[2023-03-19 05:13:41] [INFO ] Flatten gal took : 18 ms
[2023-03-19 05:13:41] [INFO ] Flatten gal took : 6 ms
[2023-03-19 05:13:41] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 4107 steps, including 1 resets, run visited all 23 properties in 32 ms. (steps per millisecond=128 )
FORMULA TCPcondis-PT-40-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F((p1||G(p2)))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:13:41] [INFO ] Invariant cache hit.
[2023-03-19 05:13:41] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 05:13:41] [INFO ] Invariant cache hit.
[2023-03-19 05:13:41] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-19 05:13:41] [INFO ] Invariant cache hit.
[2023-03-19 05:13:41] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (GEQ s5 1) (GEQ s17 1) (GEQ s11 1) (GEQ s27 1)), p2:(AND (GEQ s11 1) (GEQ s27 1)), p1:(LT s16 1)], 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 130 reset in 329 ms.
Product exploration explored 100000 steps with 133 reset in 300 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 p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 242 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 5340 steps, including 1 resets, run visited all 2 properties in 15 ms. (steps per millisecond=356 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 6 factoid took 241 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 30 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 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 24 transition count 24
Applied a total of 14 rules in 15 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-19 05:13:43] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:13:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 05:13:43] [INFO ] Invariant cache hit.
[2023-03-19 05:13:43] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-19 05:13:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:13:43] [INFO ] Invariant cache hit.
[2023-03-19 05:13:43] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 24/30 places, 24/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 2108 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=234 )
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 71 reset in 205 ms.
Stack based approach found an accepted trace after 64633 steps with 40 reset with depth 93 and stack size 93 in 195 ms.
FORMULA TCPcondis-PT-40-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-00 finished in 3339 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((p1||X(F((F(p3)&&p2)))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:13:44] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-19 05:13:45] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-19 05:13:45] [INFO ] Invariant cache hit.
[2023-03-19 05:13:45] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-19 05:13:45] [INFO ] Invariant cache hit.
[2023-03-19 05:13:45] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s13 1) (GEQ s25 1)), p2:(AND (GEQ s13 1) (GEQ s25 1)), p3:(AND (GEQ s5 1) (GEQ s17 1)), p0:(LT s24 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 15412 reset in 113 ms.
Product exploration explored 100000 steps with 15550 reset in 120 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 p2) (NOT p3) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
Knowledge based reduction with 8 factoid took 613 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0))]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 05:13:46] [INFO ] Invariant cache hit.
[2023-03-19 05:13:46] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (G (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (G (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (G (NOT (AND (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p1) p0 (NOT p3)))), (F (AND (NOT p1) (NOT p0) (NOT p3)))]
Knowledge based reduction with 11 factoid took 793 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:13:47] [INFO ] Invariant cache hit.
[2023-03-19 05:13:47] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 05:13:47] [INFO ] Invariant cache hit.
[2023-03-19 05:13:47] [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-19 05:13:47] [INFO ] Invariant cache hit.
[2023-03-19 05:13:47] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 318 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 657 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=328 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 280 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 15447 reset in 82 ms.
Product exploration explored 100000 steps with 15586 reset in 99 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 28 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 9 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 10 rules in 9 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2023-03-19 05:13:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-19 05:13:49] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:13:49] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 28/30 places, 30/32 transitions.
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:13:49] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 05:13:49] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 05:13:49] [INFO ] Invariant cache hit.
[2023-03-19 05:13:49] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-19 05:13:49] [INFO ] Invariant cache hit.
[2023-03-19 05:13:49] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-40-LTLFireability-02 finished in 4433 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&&F(p1)) U p2)||X((G(p1) U (p0&&G(p1))))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:13:49] [INFO ] Invariant cache hit.
[2023-03-19 05:13:49] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 05:13:49] [INFO ] Invariant cache hit.
[2023-03-19 05:13:49] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 05:13:49] [INFO ] Invariant cache hit.
[2023-03-19 05:13:49] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s19 1)), p0:(GEQ s29 1), p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 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, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-40-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-03 finished in 403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&(!p1 U (p2||G(!p1)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:13:49] [INFO ] Invariant cache hit.
[2023-03-19 05:13:49] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 05:13:49] [INFO ] Invariant cache hit.
[2023-03-19 05:13:49] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-19 05:13:49] [INFO ] Invariant cache hit.
[2023-03-19 05:13:49] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s5 1) (GEQ s21 1))) (NOT (AND (GEQ s9 1) (GEQ s25 1)))), p1:(AND (GEQ s9 1) (GEQ s25 1)), p0:(AND (GEQ s4 1) (GEQ s21 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 2693 reset in 167 ms.
Product exploration explored 100000 steps with 2613 reset in 182 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 p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (NOT p0)]
Finished random walk after 289 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=144 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p2)), (F p0)]
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(AND p2 (NOT p0)), (AND p2 (NOT p0)), (NOT p0)]
[2023-03-19 05:13:51] [INFO ] Invariant cache hit.
[2023-03-19 05:13:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 05:13:51] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 05:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:13:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-19 05:13:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 05:13:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 05:13:51] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 05:13:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 05:13:51] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-19 05:13:51] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 05:13:51] [INFO ] Added : 20 causal constraints over 6 iterations in 39 ms. Result :sat
Could not prove EG (AND p2 (NOT p0))
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:13:51] [INFO ] Invariant cache hit.
[2023-03-19 05:13:51] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 05:13:51] [INFO ] Invariant cache hit.
[2023-03-19 05:13:51] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-19 05:13:51] [INFO ] Invariant cache hit.
[2023-03-19 05:13:51] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 30/30 places, 32/32 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 p2 (NOT p0)), (X p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 329 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=329 )
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 05:13:52] [INFO ] Invariant cache hit.
[2023-03-19 05:13:52] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 05:13:52] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-40-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-40-LTLFireability-04 finished in 2407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 26 transition count 28
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 24 transition count 24
Applied a total of 14 rules in 13 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-19 05:13:52] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:13:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 05:13:52] [INFO ] Invariant cache hit.
[2023-03-19 05:13:52] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-19 05:13:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 05:13:52] [INFO ] Invariant cache hit.
[2023-03-19 05:13:52] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s13 1) (AND (GEQ s4 1) (GEQ s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4740 reset in 138 ms.
Stack based approach found an accepted trace after 57185 steps with 2740 reset with depth 33 and stack size 33 in 85 ms.
FORMULA TCPcondis-PT-40-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-07 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 26 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Applied a total of 12 rules in 11 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-19 05:13:52] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:13:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 05:13:52] [INFO ] Invariant cache hit.
[2023-03-19 05:13:52] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 05:13:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:13:52] [INFO ] Invariant cache hit.
[2023-03-19 05:13:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s15 1) (LT s11 1)), p0:(LT s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Stack based approach found an accepted trace after 15452 steps with 0 reset with depth 15453 and stack size 10305 in 47 ms.
FORMULA TCPcondis-PT-40-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-08 finished in 567 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(X(p0)) U p1)))'
Support contains 2 out of 30 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 : 30/30 places, 32/32 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 8 place count 27 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Applied a total of 10 rules in 10 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2023-03-19 05:13:53] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 05:13:53] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 05:13:53] [INFO ] Invariant cache hit.
[2023-03-19 05:13:53] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-19 05:13:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:13:53] [INFO ] Invariant cache hit.
[2023-03-19 05:13:53] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 26/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3486 reset in 124 ms.
Stack based approach found an accepted trace after 4615 steps with 156 reset with depth 19 and stack size 19 in 6 ms.
FORMULA TCPcondis-PT-40-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-09 finished in 320 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(!(F(p0) U !p1)))||X(!p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:13:53] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 05:13:53] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 05:13:53] [INFO ] Invariant cache hit.
[2023-03-19 05:13:53] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-19 05:13:53] [INFO ] Invariant cache hit.
[2023-03-19 05:13:53] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, false, (NOT p1), p0, (AND (NOT p1) p0), false, false]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 1}]], initial=5, aps=[p1:(AND (GEQ s4 1) (GEQ s22 1)), p0:(AND (GEQ s2 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 58 ms.
Product exploration explored 100000 steps with 33333 reset in 62 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 (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-40-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-40-LTLFireability-10 finished in 554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 9 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-19 05:13:54] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:13:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 05:13:54] [INFO ] Invariant cache hit.
[2023-03-19 05:13:54] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-19 05:13:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:13:54] [INFO ] Invariant cache hit.
[2023-03-19 05:13:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1870 reset in 153 ms.
Stack based approach found an accepted trace after 7741 steps with 142 reset with depth 16 and stack size 16 in 12 ms.
FORMULA TCPcondis-PT-40-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-11 finished in 328 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 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 24 transition count 24
Applied a total of 14 rules in 9 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2023-03-19 05:13:54] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 05:13:54] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 05:13:54] [INFO ] Invariant cache hit.
[2023-03-19 05:13:54] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 05:13:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:13:54] [INFO ] Invariant cache hit.
[2023-03-19 05:13:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1867 reset in 156 ms.
Stack based approach found an accepted trace after 917 steps with 20 reset with depth 36 and stack size 36 in 1 ms.
FORMULA TCPcondis-PT-40-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-12 finished in 354 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 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:13:54] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:13:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 05:13:54] [INFO ] Invariant cache hit.
[2023-03-19 05:13:54] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 05:13:54] [INFO ] Invariant cache hit.
[2023-03-19 05:13:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-13 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:(AND (GEQ s2 1) (GEQ s20 1) (OR (LT s9 1) (LT s25 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 TCPcondis-PT-40-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-13 finished in 197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p0)||(G(p2)&&p1)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:13:54] [INFO ] Invariant cache hit.
[2023-03-19 05:13:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 05:13:54] [INFO ] Invariant cache hit.
[2023-03-19 05:13:54] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-19 05:13:54] [INFO ] Invariant cache hit.
[2023-03-19 05:13:55] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)), p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)), p2:(AND (GEQ s7 1) (GEQ s19 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 268 ms.
Product exploration explored 100000 steps with 0 reset in 344 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 456 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-19 05:13:56] [INFO ] Invariant cache hit.
[2023-03-19 05:13:56] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (G (NOT (AND p1 (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 p0 p2)), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (F (OR (AND (NOT p1) p0) (AND p0 (NOT p2)))), (F (AND p0 p2))]
Knowledge based reduction with 14 factoid took 563 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 137 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-19 05:13:57] [INFO ] Invariant cache hit.
[2023-03-19 05:13:57] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 05:13:57] [INFO ] Invariant cache hit.
[2023-03-19 05:13:57] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-19 05:13:57] [INFO ] Invariant cache hit.
[2023-03-19 05:13:57] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 539 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Incomplete random walk after 10015 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 7) seen :5
Finished Best-First random walk after 799 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=399 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) p2)), (F p0), (F (AND p1 p2)), (F (OR (AND (NOT p1) p0) (AND p0 (NOT p2))))]
Knowledge based reduction with 11 factoid took 583 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 120 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 130 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 250 ms.
Product exploration explored 100000 steps with 0 reset in 284 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 9 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 12 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2023-03-19 05:13:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2023-03-19 05:13:59] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-19 05:13:59] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 30/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51 ms. Remains : 28/30 places, 30/32 transitions.
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 05:13:59] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:13:59] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 05:13:59] [INFO ] Invariant cache hit.
[2023-03-19 05:13:59] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 05:13:59] [INFO ] Invariant cache hit.
[2023-03-19 05:13:59] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 30/30 places, 32/32 transitions.
Treatment of property TCPcondis-PT-40-LTLFireability-14 finished in 4955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(!p1)||G((p2 U p3)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 25 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 25 transition count 27
Applied a total of 10 rules in 2 ms. Remains 25 /30 variables (removed 5) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 25 cols
[2023-03-19 05:13:59] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:13:59] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 05:13:59] [INFO ] Invariant cache hit.
[2023-03-19 05:13:59] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 05:13:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:13:59] [INFO ] Invariant cache hit.
[2023-03-19 05:13:59] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 27/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 25/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (AND p1 (NOT p3))), true, (NOT p0), p1, (NOT p3), (NOT p3), (AND p1 (NOT p3))]
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=0 dest: 4}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=0 dest: 5}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(OR p3 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=6 dest: 4}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s13 1)), p3:(AND (GEQ s7 1) (GEQ s21 1)), p2:(LT s20 1), p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 60 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-40-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-LTLFireability-15 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1||X(F((F(p3)&&p2)))))))'
Found a Shortening insensitive property : TCPcondis-PT-40-LTLFireability-02
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 25 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 25 transition count 27
Applied a total of 10 rules in 9 ms. Remains 25 /30 variables (removed 5) and now considering 27/32 (removed 5) transitions.
[2023-03-19 05:14:00] [INFO ] Invariant cache hit.
[2023-03-19 05:14:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 05:14:00] [INFO ] Invariant cache hit.
[2023-03-19 05:14:00] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-19 05:14:00] [INFO ] Invariant cache hit.
[2023-03-19 05:14:00] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 25/30 places, 27/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 98 ms. Remains : 25/30 places, 27/32 transitions.
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s11 1) (GEQ s21 1)), p2:(AND (GEQ s11 1) (GEQ s21 1)), p3:(AND (GEQ s4 1) (GEQ s13 1)), p0:(LT s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 15509 reset in 99 ms.
Product exploration explored 100000 steps with 15441 reset in 112 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 p2) (NOT p3) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
Knowledge based reduction with 8 factoid took 596 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 05:14:01] [INFO ] Invariant cache hit.
[2023-03-19 05:14:01] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (G (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (G (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (G (NOT (AND (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p1) p0 (NOT p3)))), (F (AND (NOT p1) (NOT p0) (NOT p3)))]
Knowledge based reduction with 11 factoid took 778 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-19 05:14:02] [INFO ] Invariant cache hit.
[2023-03-19 05:14:02] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 05:14:02] [INFO ] Invariant cache hit.
[2023-03-19 05:14:02] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-19 05:14:02] [INFO ] Invariant cache hit.
[2023-03-19 05:14:02] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 25/25 places, 27/27 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 200 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Finished random walk after 83 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 296 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 15557 reset in 91 ms.
Product exploration explored 100000 steps with 15565 reset in 103 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 27/27 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 24 transition count 26
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 24 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 3 place count 24 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 24 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 9 ms. Remains 24 /25 variables (removed 1) and now considering 26/27 (removed 1) transitions.
[2023-03-19 05:14:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 24 cols
[2023-03-19 05:14:04] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 05:14:04] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/25 places, 26/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 24/25 places, 26/27 transitions.
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 27/27 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 24 transition count 26
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 26
Applied a total of 2 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 26/27 (removed 1) transitions.
// Phase 1: matrix 26 rows 24 cols
[2023-03-19 05:14:04] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-19 05:14:04] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 05:14:04] [INFO ] Invariant cache hit.
[2023-03-19 05:14:04] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-19 05:14:04] [INFO ] Invariant cache hit.
[2023-03-19 05:14:04] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 26/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 24/25 places, 26/27 transitions.
Treatment of property TCPcondis-PT-40-LTLFireability-02 finished in 4225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p0)||(G(p2)&&p1)))))'
Found a Shortening insensitive property : TCPcondis-PT-40-LTLFireability-14
Stuttering acceptance computed with spot in 135 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Applied a total of 10 rules in 2 ms. Remains 25 /30 variables (removed 5) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 25 cols
[2023-03-19 05:14:04] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 05:14:04] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 05:14:04] [INFO ] Invariant cache hit.
[2023-03-19 05:14:04] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-19 05:14:04] [INFO ] Invariant cache hit.
[2023-03-19 05:14:04] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 25/30 places, 27/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 89 ms. Remains : 25/30 places, 27/32 transitions.
Running random walk in product with property : TCPcondis-PT-40-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s24 1)), p1:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s24 1)), p2:(AND (GEQ s6 1) (GEQ s16 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 251 ms.
Stack based approach found an accepted trace after 69094 steps with 0 reset with depth 69095 and stack size 69095 in 192 ms.
Treatment of property TCPcondis-PT-40-LTLFireability-14 finished in 755 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-19 05:14:05] [INFO ] Flatten gal took : 4 ms
[2023-03-19 05:14:05] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 05:14:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 32 transitions and 108 arcs took 1 ms.
Total runtime 24906 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT TCPcondis-PT-40
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/366
LTLFireability

FORMULA TCPcondis-PT-40-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679202861282

--------------------
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/366/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/366/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/366/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 TCPcondis-PT-40-LTLFireability-02
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
TCPcondis-PT-40-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TCPcondis-PT-40-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 15/32 TCPcondis-PT-40-LTLFireability-02 2234831 m, 446966 m/sec, 7312286 t fired, .

Time elapsed: 5 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
TCPcondis-PT-40-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
TCPcondis-PT-40-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 28/32 TCPcondis-PT-40-LTLFireability-02 4243826 m, 401799 m/sec, 13296226 t fired, .

Time elapsed: 10 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for TCPcondis-PT-40-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
TCPcondis-PT-40-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
TCPcondis-PT-40-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 TCPcondis-PT-40-LTLFireability-14
lola: time limit : 3585 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for TCPcondis-PT-40-LTLFireability-14
lola: result : false
lola: markings : 927
lola: fired transitions : 1006
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
TCPcondis-PT-40-LTLFireability-02: LTL unknown AGGR
TCPcondis-PT-40-LTLFireability-14: LTL false LTL model checker


Time elapsed: 15 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-40"
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 TCPcondis-PT-40, 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 r487-tall-167912703200556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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