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.r265-smll-167863540200540.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 ltsminxred
Input is PermAdmissibility-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540200540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 45K Feb 26 01:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 230K Feb 26 01:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 76K Feb 26 01:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 374K Feb 26 01:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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
-rw-r--r-- 1 mcc users 336K 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 PermAdmissibility-PT-20-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679080659377

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 19:17:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 19:17:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 19:17:42] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-17 19:17:42] [INFO ] Transformed 168 places.
[2023-03-17 19:17:42] [INFO ] Transformed 592 transitions.
[2023-03-17 19:17:42] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Support contains 77 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 592
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 74 place count 94 transition count 482
Iterating global reduction 1 with 10 rules applied. Total rules applied 84 place count 94 transition count 482
Applied a total of 84 rules in 44 ms. Remains 94 /168 variables (removed 74) and now considering 482/592 (removed 110) transitions.
// Phase 1: matrix 482 rows 94 cols
[2023-03-17 19:17:42] [INFO ] Computed 16 place invariants in 32 ms
[2023-03-17 19:17:43] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-17 19:17:43] [INFO ] Invariant cache hit.
[2023-03-17 19:17:43] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2023-03-17 19:17:43] [INFO ] Invariant cache hit.
[2023-03-17 19:17:44] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/168 places, 482/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1274 ms. Remains : 94/168 places, 482/592 transitions.
Support contains 77 out of 94 places after structural reductions.
[2023-03-17 19:17:44] [INFO ] Flatten gal took : 141 ms
[2023-03-17 19:17:44] [INFO ] Flatten gal took : 116 ms
[2023-03-17 19:17:44] [INFO ] Input system was already deterministic with 482 transitions.
Finished random walk after 6557 steps, including 19 resets, run visited all 28 properties in 106 ms. (steps per millisecond=61 )
Computed a total of 94 stabilizing places and 482 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 482
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Graph (complete) has 785 edges and 94 vertex of which 6 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.4 ms
Discarding 88 places :
Also discarding 474 output transitions
Drop transitions removed 474 transitions
Applied a total of 1 rules in 12 ms. Remains 6 /94 variables (removed 88) and now considering 8/482 (removed 474) transitions.
// Phase 1: matrix 8 rows 6 cols
[2023-03-17 19:17:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 19:17:45] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-17 19:17:45] [INFO ] Invariant cache hit.
[2023-03-17 19:17:45] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-17 19:17:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 19:17:45] [INFO ] Invariant cache hit.
[2023-03-17 19:17:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/94 places, 8/482 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 6/94 places, 8/482 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-00 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 (OR (LT s1 1) (LT s3 1) (LT s5 1)) (OR (LT s1 1) (LT s3 1) (LT s4 1)) (OR (LT s0 1) (LT s3 1) (LT s4 1)) (OR (LT s0 1) (LT s3 1) (LT s5 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 6829 reset in 393 ms.
Product exploration explored 100000 steps with 6864 reset in 248 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLFireability-00 finished in 1253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 17 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Graph (complete) has 785 edges and 94 vertex of which 68 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.4 ms
Discarding 26 places :
Also discarding 146 output transitions
Drop transitions removed 146 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 54 transition count 210
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 54 transition count 210
Applied a total of 29 rules in 38 ms. Remains 54 /94 variables (removed 40) and now considering 210/482 (removed 272) transitions.
// Phase 1: matrix 210 rows 54 cols
[2023-03-17 19:17:46] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-17 19:17:46] [INFO ] Implicit Places using invariants in 91 ms returned [17, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 96 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/94 places, 210/482 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 51 transition count 208
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 50 transition count 208
Applied a total of 4 rules in 22 ms. Remains 50 /52 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 50 cols
[2023-03-17 19:17:46] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-17 19:17:47] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-17 19:17:47] [INFO ] Invariant cache hit.
[2023-03-17 19:17:47] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/94 places, 208/482 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 370 ms. Remains : 50/94 places, 208/482 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s9 1) (LT s38 1) (LT s41 1)) (OR (LT s18 1) (LT s21 1) (LT s41 1)) (OR (LT s12 1) (LT s39 1) (LT s41 1)) (OR (LT s12 1) (LT s26 1) (LT s41...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 497 reset in 1312 ms.
Product exploration explored 100000 steps with 497 reset in 1231 ms.
Computed a total of 50 stabilizing places and 208 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 208
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLFireability-01 finished in 3176 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)||F(p1))))'
Support contains 10 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 78 transition count 344
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 56 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 80 place count 54 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 53 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 53 transition count 100
Applied a total of 82 rules in 18 ms. Remains 53 /94 variables (removed 41) and now considering 100/482 (removed 382) transitions.
// Phase 1: matrix 100 rows 53 cols
[2023-03-17 19:17:49] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-17 19:17:50] [INFO ] Implicit Places using invariants in 83 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 90 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/94 places, 100/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 49/94 places, 100/482 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s22 1) (GEQ s25 1) (GEQ s28 1)) (AND (GEQ s22 1) (GEQ s25 1) (GEQ s29 1)) (AND (GEQ s20 1) (GEQ s22 1) (GEQ s27 1)) (AND (GEQ s20 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8298 reset in 490 ms.
Product exploration explored 100000 steps with 8380 reset in 496 ms.
Computed a total of 49 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 100
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 347 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 8 factoid took 338 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
// Phase 1: matrix 100 rows 49 cols
[2023-03-17 19:17:52] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-17 19:17:52] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 9 ms returned sat
[2023-03-17 19:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 19:17:52] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-17 19:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 19:17:52] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 8 ms returned sat
[2023-03-17 19:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 19:17:52] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-17 19:17:52] [INFO ] Computed and/alt/rep : 35/222/35 causal constraints (skipped 61 transitions) in 14 ms.
[2023-03-17 19:17:52] [INFO ] Added : 24 causal constraints over 6 iterations in 117 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 9 out of 49 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 : 49/49 places, 100/100 transitions.
Graph (complete) has 214 edges and 49 vertex of which 22 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 52 output transitions
Drop transitions removed 52 transitions
Applied a total of 1 rules in 4 ms. Remains 22 /49 variables (removed 27) and now considering 48/100 (removed 52) transitions.
// Phase 1: matrix 48 rows 22 cols
[2023-03-17 19:17:52] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 19:17:52] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-17 19:17:52] [INFO ] Invariant cache hit.
[2023-03-17 19:17:52] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-17 19:17:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 19:17:52] [INFO ] Invariant cache hit.
[2023-03-17 19:17:52] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/49 places, 48/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 22/49 places, 48/100 transitions.
Computed a total of 22 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 48
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
[2023-03-17 19:17:53] [INFO ] Invariant cache hit.
[2023-03-17 19:17:53] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-17 19:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 19:17:53] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-17 19:17:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 19:17:53] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-17 19:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 19:17:53] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-17 19:17:53] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 16 transitions) in 6 ms.
[2023-03-17 19:17:53] [INFO ] Added : 17 causal constraints over 5 iterations in 48 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Product exploration explored 100000 steps with 8383 reset in 388 ms.
Product exploration explored 100000 steps with 8303 reset in 416 ms.
Support contains 9 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 22 /22 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-17 19:17:54] [INFO ] Invariant cache hit.
[2023-03-17 19:17:54] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-17 19:17:54] [INFO ] Invariant cache hit.
[2023-03-17 19:17:54] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-17 19:17:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 19:17:54] [INFO ] Invariant cache hit.
[2023-03-17 19:17:54] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 22/22 places, 48/48 transitions.
Treatment of property PermAdmissibility-PT-20-LTLFireability-02 finished in 4808 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)&&X(X(G(p1))))))'
Support contains 22 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 78 transition count 344
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 78 transition count 344
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 68 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 68 transition count 234
Applied a total of 52 rules in 11 ms. Remains 68 /94 variables (removed 26) and now considering 234/482 (removed 248) transitions.
// Phase 1: matrix 234 rows 68 cols
[2023-03-17 19:17:54] [INFO ] Computed 16 place invariants in 6 ms
[2023-03-17 19:17:54] [INFO ] Implicit Places using invariants in 109 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 111 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/94 places, 234/482 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 66/94 places, 234/482 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s17 1) (LT s51 1) (LT s55 1)) (OR (LT s28 1) (LT s31 1) (LT s55 1)) (OR (LT s20 1) (LT s52 1) (LT s55 1)) (OR (LT s20 1) (LT s36 1) (LT s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-03 finished in 375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 18 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Graph (complete) has 785 edges and 94 vertex of which 68 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 146 output transitions
Drop transitions removed 146 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 54 transition count 210
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 54 transition count 210
Applied a total of 29 rules in 16 ms. Remains 54 /94 variables (removed 40) and now considering 210/482 (removed 272) transitions.
// Phase 1: matrix 210 rows 54 cols
[2023-03-17 19:17:55] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-17 19:17:55] [INFO ] Implicit Places using invariants in 77 ms returned [17, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/94 places, 210/482 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 52 transition count 209
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 2 place count 51 transition count 209
Applied a total of 2 rules in 11 ms. Remains 51 /52 variables (removed 1) and now considering 209/210 (removed 1) transitions.
// Phase 1: matrix 209 rows 51 cols
[2023-03-17 19:17:55] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-17 19:17:55] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-17 19:17:55] [INFO ] Invariant cache hit.
[2023-03-17 19:17:55] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/94 places, 209/482 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 299 ms. Remains : 51/94 places, 209/482 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s9 1) (LT s38 1) (LT s41 1)) (OR (LT s18 1) (LT s21 1) (LT s41 1)) (OR (LT s12 1) (LT s39 1) (LT s41 1)) (OR (LT s12 1) (LT s26 1) (LT s41...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 313 steps with 1 reset in 7 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-04 finished in 448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 9 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 78 transition count 344
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 56 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 80 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 52 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 52 transition count 92
Applied a total of 84 rules in 8 ms. Remains 52 /94 variables (removed 42) and now considering 92/482 (removed 390) transitions.
// Phase 1: matrix 92 rows 52 cols
[2023-03-17 19:17:55] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-17 19:17:55] [INFO ] Implicit Places using invariants in 71 ms returned [0, 5, 19, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 72 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/94 places, 92/482 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 48/94 places, 92/482 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s14 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s11 1) (GEQ s16 1) (GEQ s20 1)) (AND (GEQ s12 1) (GEQ s13 1) (GEQ s20 1)) (AND (GEQ s12 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-05 finished in 224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&(G(!p2)||p1)) U p3)))'
Support contains 44 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 91 transition count 468
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 468
Applied a total of 6 rules in 5 ms. Remains 91 /94 variables (removed 3) and now considering 468/482 (removed 14) transitions.
// Phase 1: matrix 468 rows 91 cols
[2023-03-17 19:17:55] [INFO ] Computed 16 place invariants in 5 ms
[2023-03-17 19:17:55] [INFO ] Implicit Places using invariants in 99 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/94 places, 468/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 90/94 places, 468/482 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p3), (NOT p3), true, p2]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p0 p1) (AND (NOT p3) p0 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1) p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(OR (AND (GEQ s3 1) (GEQ s12 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s17 1)) (AND (GEQ s6 1) (GEQ s13 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s11 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-06 finished in 298 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 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 78 transition count 344
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 56 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 80 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 51 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 51 transition count 84
Applied a total of 86 rules in 8 ms. Remains 51 /94 variables (removed 43) and now considering 84/482 (removed 398) transitions.
// Phase 1: matrix 84 rows 51 cols
[2023-03-17 19:17:56] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-17 19:17:56] [INFO ] Implicit Places using invariants in 71 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 74 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/94 places, 84/482 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 47/94 places, 84/482 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-07 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 (OR (LT s30 1) (LT s32 1) (LT s42 1)) (OR (LT s31 1) (LT s33 1) (LT s42 1)) (OR (LT s31 1) (LT s32 1) (LT s42 1)) (OR (LT s30 1) (LT s33 1) (LT s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-07 finished in 185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(X((X(!p0) U X(p1)))||X(p2)) U p3))'
Support contains 11 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 78 transition count 344
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 56 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 80 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 52 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 52 transition count 92
Applied a total of 84 rules in 8 ms. Remains 52 /94 variables (removed 42) and now considering 92/482 (removed 390) transitions.
// Phase 1: matrix 92 rows 52 cols
[2023-03-17 19:17:56] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-17 19:17:56] [INFO ] Implicit Places using invariants in 72 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 76 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/94 places, 92/482 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 48/94 places, 92/482 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p3), (OR (NOT p3) p1 p2), true, p1]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s31 1) (GEQ s34 1) (GEQ s43 1)), p2:(AND (GEQ s21 1) (GEQ s22 1) (GEQ s26 1)), p1:(AND (GEQ s26 1) (GEQ s27 1) (GEQ s35 1)), p0:(AND (GEQ s9 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 1 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-08 finished in 269 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)&&F(!(G(p1) U !p2))))'
Support contains 8 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Graph (complete) has 785 edges and 94 vertex of which 12 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.2 ms
Discarding 82 places :
Also discarding 466 output transitions
Drop transitions removed 466 transitions
Applied a total of 1 rules in 4 ms. Remains 12 /94 variables (removed 82) and now considering 16/482 (removed 466) transitions.
// Phase 1: matrix 16 rows 12 cols
[2023-03-17 19:17:56] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-17 19:17:56] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 19:17:56] [INFO ] Invariant cache hit.
[2023-03-17 19:17:56] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-17 19:17:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 19:17:56] [INFO ] Invariant cache hit.
[2023-03-17 19:17:56] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/94 places, 16/482 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 12/94 places, 16/482 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s6 1)), p2:(AND (GEQ s4 1) (GEQ s9 1) (GEQ s11 1)), p1:(AND (GEQ s0 1) (GEQ s3 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 33284 reset in 135 ms.
Product exploration explored 100000 steps with 33335 reset in 158 ms.
Computed a total of 12 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 487 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 9 factoid took 486 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-17 19:17:58] [INFO ] Invariant cache hit.
[2023-03-17 19:17:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-17 19:17:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 19:17:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-17 19:17:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 19:17:58] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 19:17:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 19:17:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-17 19:17:58] [INFO ] Computed and/alt/rep : 12/48/12 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 19:17:58] [INFO ] Added : 10 causal constraints over 3 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 12 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 : 12/12 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-17 19:17:58] [INFO ] Invariant cache hit.
[2023-03-17 19:17:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 19:17:58] [INFO ] Invariant cache hit.
[2023-03-17 19:17:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-17 19:17:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 19:17:58] [INFO ] Invariant cache hit.
[2023-03-17 19:17:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 12/12 places, 16/16 transitions.
Computed a total of 12 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-17 19:17:59] [INFO ] Invariant cache hit.
[2023-03-17 19:17:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-17 19:17:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 19:17:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-17 19:17:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 19:17:59] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-17 19:17:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 19:17:59] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-17 19:17:59] [INFO ] Computed and/alt/rep : 12/48/12 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 19:17:59] [INFO ] Added : 10 causal constraints over 3 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25015 reset in 132 ms.
Product exploration explored 100000 steps with 25108 reset in 172 ms.
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 16/16 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 10 transition count 10
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 9 transition count 10
Applied a total of 5 rules in 2 ms. Remains 9 /12 variables (removed 3) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 9 cols
[2023-03-17 19:17:59] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 19:17:59] [INFO ] Implicit Places using invariants in 31 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/12 places, 10/16 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 9/10 (removed 1) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44 ms. Remains : 7/12 places, 9/16 transitions.
Treatment of property PermAdmissibility-PT-20-LTLFireability-09 finished in 2974 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((X(p0)||(p1&&X(p1))))))'
Support contains 9 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 82 transition count 360
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 82 transition count 360
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 40 place count 66 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 66 transition count 172
Applied a total of 56 rules in 7 ms. Remains 66 /94 variables (removed 28) and now considering 172/482 (removed 310) transitions.
// Phase 1: matrix 172 rows 66 cols
[2023-03-17 19:17:59] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-17 19:17:59] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-17 19:17:59] [INFO ] Invariant cache hit.
[2023-03-17 19:17:59] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-17 19:17:59] [INFO ] Invariant cache hit.
[2023-03-17 19:17:59] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/94 places, 172/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 66/94 places, 172/482 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 1}]], initial=2, aps=[p1:(OR (LT s0 1) (LT s3 1) (LT s6 1)), p0:(OR (LT s15 1) (LT s16 1) (LT s19 1) (AND (GEQ s8 1) (GEQ s9 1) (GEQ s13 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 198 ms.
Product exploration explored 100000 steps with 33333 reset in 215 ms.
Computed a total of 66 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 172
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 6 factoid took 123 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLFireability-10 finished in 1266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p0)))))'
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 78 transition count 344
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 78 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 54 place count 56 transition count 122
Iterating global reduction 0 with 22 rules applied. Total rules applied 76 place count 56 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 54 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 54 transition count 106
Applied a total of 80 rules in 8 ms. Remains 54 /94 variables (removed 40) and now considering 106/482 (removed 376) transitions.
// Phase 1: matrix 106 rows 54 cols
[2023-03-17 19:18:00] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-17 19:18:00] [INFO ] Implicit Places using invariants in 92 ms returned [0, 5, 18, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 94 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/94 places, 106/482 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 50/94 places, 106/482 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s18 1) (GEQ s31 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][false, false]]
Stuttering criterion allowed to conclude after 1068 steps with 10 reset in 6 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-11 finished in 194 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 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Graph (complete) has 785 edges and 94 vertex of which 76 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 55 transition count 128
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 55 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 46 place count 52 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 49 place count 52 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 50 place count 51 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 51 transition count 102
Applied a total of 51 rules in 23 ms. Remains 51 /94 variables (removed 43) and now considering 102/482 (removed 380) transitions.
// Phase 1: matrix 102 rows 51 cols
[2023-03-17 19:18:01] [INFO ] Computed 14 place invariants in 15 ms
[2023-03-17 19:18:01] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-17 19:18:01] [INFO ] Invariant cache hit.
[2023-03-17 19:18:01] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-17 19:18:01] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 19:18:01] [INFO ] Invariant cache hit.
[2023-03-17 19:18:01] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/94 places, 102/482 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 51/94 places, 102/482 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s4 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]]
Stuttering criterion allowed to conclude after 389 steps with 1 reset in 2 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-12 finished in 381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F((p1 U (p2||G(p1))))))))'
Support contains 9 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 78 transition count 344
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 78 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 54 place count 56 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 76 place count 56 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 54 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 54 transition count 98
Applied a total of 80 rules in 6 ms. Remains 54 /94 variables (removed 40) and now considering 98/482 (removed 384) transitions.
// Phase 1: matrix 98 rows 54 cols
[2023-03-17 19:18:01] [INFO ] Computed 16 place invariants in 4 ms
[2023-03-17 19:18:01] [INFO ] Implicit Places using invariants in 87 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/94 places, 98/482 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 52/94 places, 98/482 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s35 1) (GEQ s36 1) (GEQ s46 1)), p2:(AND (NOT (AND (GEQ s23 1) (GEQ s25 1) (GEQ s28 1))) (GEQ s17 1) (GEQ s38 1) (GEQ s42 1)), p1:(AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3196 steps with 28 reset in 21 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-13 finished in 290 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(p1)||p0))))'
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 78 transition count 344
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 78 transition count 344
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 55 place count 55 transition count 114
Iterating global reduction 0 with 23 rules applied. Total rules applied 78 place count 55 transition count 114
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 52 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 52 transition count 90
Applied a total of 84 rules in 5 ms. Remains 52 /94 variables (removed 42) and now considering 90/482 (removed 392) transitions.
// Phase 1: matrix 90 rows 52 cols
[2023-03-17 19:18:01] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-17 19:18:01] [INFO ] Implicit Places using invariants in 87 ms returned [0, 5, 18, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 89 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/94 places, 90/482 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 48/94 places, 90/482 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s16 1) (GEQ s19 1) (GEQ s30 1) (GEQ s16 1) (GEQ s19 1) (GEQ s30 1)), p0:(OR (LT s31 1) (LT s33 1) (LT s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Computed a total of 48 stabilizing places and 90 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 90
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLFireability-14 finished in 753 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)||G(F(p1))))'
Support contains 9 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 482/482 transitions.
Graph (complete) has 785 edges and 94 vertex of which 68 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 146 output transitions
Drop transitions removed 146 transitions
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 44 transition count 100
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 44 transition count 100
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 52 place count 41 transition count 80
Iterating global reduction 0 with 3 rules applied. Total rules applied 55 place count 41 transition count 80
Applied a total of 55 rules in 21 ms. Remains 41 /94 variables (removed 53) and now considering 80/482 (removed 402) transitions.
// Phase 1: matrix 80 rows 41 cols
[2023-03-17 19:18:02] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-17 19:18:02] [INFO ] Implicit Places using invariants in 60 ms returned [13, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/94 places, 80/482 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 39 transition count 79
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 2 place count 38 transition count 79
Applied a total of 2 rules in 10 ms. Remains 38 /39 variables (removed 1) and now considering 79/80 (removed 1) transitions.
// Phase 1: matrix 79 rows 38 cols
[2023-03-17 19:18:02] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-17 19:18:02] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-17 19:18:02] [INFO ] Invariant cache hit.
[2023-03-17 19:18:02] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/94 places, 79/482 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 38/94 places, 79/482 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s3 1) (GEQ s13 1)), p1:(OR (AND (GEQ s10 1) (GEQ s16 1) (GEQ s29 1)) (AND (GEQ s11 1) (GEQ s26 1) (GEQ s28 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 875 steps with 8 reset in 4 ms.
FORMULA PermAdmissibility-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLFireability-15 finished in 366 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)||F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(!(G(p1) U !p2))))'
[2023-03-17 19:18:03] [INFO ] Flatten gal took : 58 ms
[2023-03-17 19:18:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-17 19:18:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 94 places, 482 transitions and 2456 arcs took 6 ms.
Total runtime 20986 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1236/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1236/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PermAdmissibility-PT-20-LTLFireability-02
Could not compute solution for formula : PermAdmissibility-PT-20-LTLFireability-09

BK_STOP 1679080685153

--------------------
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
mcc2023
ltl formula name PermAdmissibility-PT-20-LTLFireability-02
ltl formula formula --ltl=/tmp/1236/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 94 places, 482 transitions and 2456 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1236/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1236/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1236/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1236/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x563d715753f4]
1: pnml2lts-mc(+0xa2496) [0x563d71575496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f2ced7ea140]
3: pnml2lts-mc(+0x405be5) [0x563d718d8be5]
4: pnml2lts-mc(+0x16b3f9) [0x563d7163e3f9]
5: pnml2lts-mc(+0x164ac4) [0x563d71637ac4]
6: pnml2lts-mc(+0x272e0a) [0x563d71745e0a]
7: pnml2lts-mc(+0xb61f0) [0x563d715891f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f2ced63d4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f2ced63d67a]
10: pnml2lts-mc(+0xa1581) [0x563d71574581]
11: pnml2lts-mc(+0xa1910) [0x563d71574910]
12: pnml2lts-mc(+0xa32a2) [0x563d715762a2]
13: pnml2lts-mc(+0xa50f4) [0x563d715780f4]
14: pnml2lts-mc(+0xa516b) [0x563d7157816b]
15: pnml2lts-mc(+0x3f34b3) [0x563d718c64b3]
16: pnml2lts-mc(+0x7c63d) [0x563d7154f63d]
17: pnml2lts-mc(+0x67d86) [0x563d7153ad86]
18: pnml2lts-mc(+0x60a8a) [0x563d71533a8a]
19: pnml2lts-mc(+0x5eb15) [0x563d71531b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f2ced625d0a]
21: pnml2lts-mc(+0x6075e) [0x563d7153375e]
ltl formula name PermAdmissibility-PT-20-LTLFireability-09
ltl formula formula --ltl=/tmp/1236/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 94 places, 482 transitions and 2456 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1236/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1236/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1236/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1236/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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="PermAdmissibility-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PermAdmissibility-PT-20, 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 r265-smll-167863540200540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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