Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998800396.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PermAdmissibility-PT-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998800396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.4K Apr 29 12:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 29 12:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 29 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 291K Apr 29 12:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 484K May 10 09:34 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-01-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653087694166

Running Version 202205111006
[2022-05-20 23:01:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 23:01:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 23:01:36] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2022-05-20 23:01:36] [INFO ] Transformed 168 places.
[2022-05-20 23:01:36] [INFO ] Transformed 592 transitions.
[2022-05-20 23:01:36] [INFO ] Parsed PT model containing 168 places and 592 transitions in 438 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA PermAdmissibility-PT-01-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 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
Applied a total of 64 rules in 140 ms. Remains 104 /168 variables (removed 64) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 104 cols
[2022-05-20 23:01:37] [INFO ] Computed 16 place invariants in 36 ms
[2022-05-20 23:01:37] [INFO ] Implicit Places using invariants in 421 ms returned []
// Phase 1: matrix 592 rows 104 cols
[2022-05-20 23:01:37] [INFO ] Computed 16 place invariants in 18 ms
[2022-05-20 23:01:38] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
// Phase 1: matrix 592 rows 104 cols
[2022-05-20 23:01:38] [INFO ] Computed 16 place invariants in 9 ms
[2022-05-20 23:01:41] [INFO ] Dead Transitions using invariants and state equation in 3151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/168 places, 592/592 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/168 places, 592/592 transitions.
Support contains 84 out of 104 places after structural reductions.
[2022-05-20 23:01:41] [INFO ] Flatten gal took : 133 ms
[2022-05-20 23:01:42] [INFO ] Flatten gal took : 94 ms
[2022-05-20 23:01:42] [INFO ] Input system was already deterministic with 592 transitions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 592 rows 104 cols
[2022-05-20 23:01:43] [INFO ] Computed 16 place invariants in 13 ms
[2022-05-20 23:01:43] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 17 ms returned sat
[2022-05-20 23:01:43] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 23:01:43] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 14 ms returned sat
[2022-05-20 23:01:45] [INFO ] After 1292ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA PermAdmissibility-PT-01-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA PermAdmissibility-PT-01-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 592
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))||X(G((!G(p1) U p0)))||G(p1))))'
Support contains 14 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 32 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.9 ms
Discarding 72 places :
Also discarding 512 output transitions
Drop transitions removed 512 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 27 transition count 52
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 27 transition count 52
Applied a total of 11 rules in 20 ms. Remains 27 /104 variables (removed 77) and now considering 52/592 (removed 540) transitions.
// Phase 1: matrix 52 rows 27 cols
[2022-05-20 23:01:45] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 23:01:45] [INFO ] Implicit Places using invariants in 42 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/104 places, 52/592 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 26/104 places, 52/592 transitions.
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s13 1) (GEQ s15 1) (GEQ s21 1)) (AND (GEQ s14 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s14 1) (GEQ s15 1) (GEQ s21 1)) (AND (GEQ s13 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1341 steps with 200 reset in 49 ms.
FORMULA PermAdmissibility-PT-01-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLFireability-02 finished in 590 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 10 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 32 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.3 ms
Discarding 72 places :
Also discarding 512 output transitions
Drop transitions removed 512 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 27 transition count 52
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 27 transition count 52
Applied a total of 11 rules in 10 ms. Remains 27 /104 variables (removed 77) and now considering 52/592 (removed 540) transitions.
// Phase 1: matrix 52 rows 27 cols
[2022-05-20 23:01:45] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 23:01:46] [INFO ] Implicit Places using invariants in 45 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/104 places, 52/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 26/104 places, 52/592 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s6 1)) (AND (GEQ s2 1) (GEQ s3 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s3 1) (GEQ s7 1)) (AND (GEQ s2 1) (GEQ s3 1) (GE...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLFireability-03 finished in 126 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(X(F(p0)))))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 6 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.2 ms
Discarding 98 places :
Also discarding 584 output transitions
Drop transitions removed 584 transitions
Applied a total of 1 rules in 6 ms. Remains 6 /104 variables (removed 98) and now considering 8/592 (removed 584) transitions.
// Phase 1: matrix 8 rows 6 cols
[2022-05-20 23:01:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 23:01:46] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2022-05-20 23:01:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 23:01:46] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-20 23:01:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2022-05-20 23:01:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 23:01:46] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/104 places, 8/592 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/104 places, 8/592 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-05 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 33333 reset in 382 ms.
Product exploration explored 100000 steps with 33333 reset in 373 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)), (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 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-PT-01-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-01-LTLFireability-05 finished in 1101 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(G(p1)&&p2))))'
Support contains 31 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 22 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2022-05-20 23:01:47] [INFO ] Computed 16 place invariants in 9 ms
[2022-05-20 23:01:47] [INFO ] Implicit Places using invariants in 191 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 199 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 9 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s13 1) (GEQ s16 1)) (AND (GEQ s14 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7142 reset in 1022 ms.
Product exploration explored 100000 steps with 7142 reset in 747 ms.
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
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 (NOT p0) p2 p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 411 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 427 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 468 rows 90 cols
[2022-05-20 23:01:50] [INFO ] Computed 15 place invariants in 5 ms
[2022-05-20 23:01:51] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 26 ms returned sat
[2022-05-20 23:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:01:51] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2022-05-20 23:01:51] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 436 transitions) in 120 ms.
[2022-05-20 23:01:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:01:52] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 25 ms returned sat
[2022-05-20 23:01:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:01:52] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2022-05-20 23:01:53] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 436 transitions) in 63 ms.
[2022-05-20 23:01:53] [INFO ] Added : 4 causal constraints over 1 iterations in 152 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 17 out of 90 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 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 39 ms. Remains 86 /90 variables (removed 4) and now considering 464/468 (removed 4) transitions.
// Phase 1: matrix 464 rows 86 cols
[2022-05-20 23:01:53] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-20 23:01:53] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 464 rows 86 cols
[2022-05-20 23:01:53] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-20 23:01:54] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
[2022-05-20 23:01:54] [INFO ] Redundant transitions in 53 ms returned []
// Phase 1: matrix 464 rows 86 cols
[2022-05-20 23:01:54] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-20 23:01:54] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/90 places, 464/468 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/90 places, 464/468 transitions.
Computed a total of 86 stabilizing places and 464 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 464
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)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
// Phase 1: matrix 464 rows 86 cols
[2022-05-20 23:01:55] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-20 23:01:56] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 30 ms returned sat
[2022-05-20 23:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:01:56] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2022-05-20 23:01:56] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 432 transitions) in 86 ms.
[2022-05-20 23:01:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:01:57] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 15 ms returned sat
[2022-05-20 23:01:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:01:57] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-05-20 23:01:57] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 432 transitions) in 46 ms.
[2022-05-20 23:01:57] [INFO ] Added : 8 causal constraints over 2 iterations in 145 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7142 reset in 635 ms.
Product exploration explored 100000 steps with 7142 reset in 624 ms.
Built C files in :
/tmp/ltsmin16941301700115355369
[2022-05-20 23:01:59] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2022-05-20 23:01:59] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:01:59] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2022-05-20 23:01:59] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:01:59] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2022-05-20 23:01:59] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:01:59] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16941301700115355369
Running compilation step : cd /tmp/ltsmin16941301700115355369;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2211 ms.
Running link step : cd /tmp/ltsmin16941301700115355369;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin16941301700115355369;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4158817299323072801.hoa' '--buchi-type=spotba'
LTSmin run took 913 ms.
FORMULA PermAdmissibility-PT-01-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-01-LTLFireability-07 finished in 15247 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&G(p1))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 66 place count 62 transition count 146
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 62 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 61 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 61 transition count 138
Applied a total of 86 rules in 19 ms. Remains 61 /104 variables (removed 43) and now considering 138/592 (removed 454) transitions.
// Phase 1: matrix 138 rows 61 cols
[2022-05-20 23:02:02] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 23:02:02] [INFO ] Implicit Places using invariants in 99 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/104 places, 138/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/104 places, 138/592 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s21 1) (GEQ s31 1) (GEQ s50 1)), p0:(OR (LT s5 1) (LT s6 1) (LT s8 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, 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-01-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLFireability-10 finished in 290 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(!(X(p0) U p1))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 68 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 88 place count 60 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 59 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 59 transition count 128
Applied a total of 90 rules in 9 ms. Remains 59 /104 variables (removed 45) and now considering 128/592 (removed 464) transitions.
// Phase 1: matrix 128 rows 59 cols
[2022-05-20 23:02:02] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 23:02:02] [INFO ] Implicit Places using invariants in 102 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/104 places, 128/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 58/104 places, 128/592 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, p1, p1]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s50 1) (GEQ s55 1) (GEQ s56 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 137 steps with 8 reset in 1 ms.
FORMULA PermAdmissibility-PT-01-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLFireability-12 finished in 231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&F(p1)) U !X(p2)))'
Support contains 8 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 68 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 88 place count 60 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 58 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 58 transition count 120
Applied a total of 92 rules in 8 ms. Remains 58 /104 variables (removed 46) and now considering 120/592 (removed 472) transitions.
// Phase 1: matrix 120 rows 58 cols
[2022-05-20 23:02:02] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-20 23:02:03] [INFO ] Implicit Places using invariants in 117 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/104 places, 120/592 transitions.
Applied a total of 0 rules in 9 ms. Remains 57 /57 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 57/104 places, 120/592 transitions.
Stuttering acceptance computed with spot in 256 ms :[p2, (AND (NOT p0) p2), (AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s38 1) (GEQ s41 1) (GEQ s51 1)) (NOT (AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 1)))), p1:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 1)), p2:(AND (GEQ s3...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 460 ms.
Product exploration explored 100000 steps with 50000 reset in 334 ms.
Computed a total of 57 stabilizing places and 120 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 57 transition count 120
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 p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X p0)), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 12 factoid took 336 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-PT-01-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-01-LTLFireability-13 finished in 1611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F(G(p0))))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 6 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.4 ms
Discarding 98 places :
Also discarding 584 output transitions
Drop transitions removed 584 transitions
Applied a total of 1 rules in 5 ms. Remains 6 /104 variables (removed 98) and now considering 8/592 (removed 584) transitions.
// Phase 1: matrix 8 rows 6 cols
[2022-05-20 23:02:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 23:02:04] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2022-05-20 23:02:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 23:02:04] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2022-05-20 23:02:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2022-05-20 23:02:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 23:02:04] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/104 places, 8/592 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/104 places, 8/592 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-14 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 (GEQ s0 1) (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-01-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLFireability-14 finished in 256 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(G((F(!(F(p1) U G(p2)))||p0)))))))'
Support contains 5 out of 104 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 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 68 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Discarding 36 places :
Also discarding 256 output transitions
Drop transitions removed 256 transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 42 transition count 90
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 42 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 56 place count 39 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 59 place count 39 transition count 68
Applied a total of 59 rules in 12 ms. Remains 39 /104 variables (removed 65) and now considering 68/592 (removed 524) transitions.
// Phase 1: matrix 68 rows 39 cols
[2022-05-20 23:02:04] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 23:02:04] [INFO ] Implicit Places using invariants in 114 ms returned [11, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 116 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/104 places, 68/592 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 37 transition count 67
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 36 transition count 67
Applied a total of 2 rules in 10 ms. Remains 36 /37 variables (removed 1) and now considering 67/68 (removed 1) transitions.
// Phase 1: matrix 67 rows 36 cols
[2022-05-20 23:02:04] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-20 23:02:05] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 67 rows 36 cols
[2022-05-20 23:02:05] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 23:02:05] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/104 places, 67/592 transitions.
Finished structural reductions, in 2 iterations. Remains : 36/104 places, 67/592 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s13 1) (LT s15 1) (LT s18 1)), p2:(AND (GEQ s12 1) (GEQ s15 1) (GEQ s17 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 8333 reset in 247 ms.
Product exploration explored 100000 steps with 8333 reset in 249 ms.
Computed a total of 36 stabilizing places and 67 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 36 transition count 67
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 p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 247 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-PT-01-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-01-LTLFireability-15 finished in 1413 ms.
All properties solved by simple procedures.
Total runtime 29960 ms.

BK_STOP 1653087726688

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-01"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-PT-01, 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 r150-smll-165276998800396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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