Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422000107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PermAdmissibility-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422000107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 11K Apr 12 09:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 09:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 09:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 296K Apr 12 09:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 09:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 09:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 12 09:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 590K Apr 12 09:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 336K May 18 16:43 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-05-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716858993235

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-05
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 01:16:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 01:16:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:16:36] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-28 01:16:36] [INFO ] Transformed 168 places.
[2024-05-28 01:16:36] [INFO ] Transformed 592 transitions.
[2024-05-28 01:16:36] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA PermAdmissibility-PT-05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 132 transition count 592
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 126 transition count 496
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 126 transition count 496
Applied a total of 48 rules in 43 ms. Remains 126 /168 variables (removed 42) and now considering 496/592 (removed 96) transitions.
// Phase 1: matrix 496 rows 126 cols
[2024-05-28 01:16:36] [INFO ] Computed 19 invariants in 44 ms
[2024-05-28 01:16:36] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-28 01:16:36] [INFO ] Invariant cache hit.
[2024-05-28 01:16:37] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
[2024-05-28 01:16:37] [INFO ] Invariant cache hit.
[2024-05-28 01:16:37] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/168 places, 496/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1512 ms. Remains : 126/168 places, 496/592 transitions.
Support contains 88 out of 126 places after structural reductions.
[2024-05-28 01:16:38] [INFO ] Flatten gal took : 123 ms
[2024-05-28 01:16:38] [INFO ] Flatten gal took : 72 ms
[2024-05-28 01:16:38] [INFO ] Input system was already deterministic with 496 transitions.
Support contains 74 out of 126 places (down from 88) after GAL structural reductions.
Finished random walk after 4520 steps, including 46 resets, run visited all 26 properties in 112 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 1 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 126 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 126 transition count 496
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X((p1||X(F((p1&&F((p2&&F(p3))))))))))))'
Support contains 11 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 98 transition count 496
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 48 place count 78 transition count 344
Iterating global reduction 1 with 20 rules applied. Total rules applied 68 place count 78 transition count 344
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 85 place count 61 transition count 122
Iterating global reduction 1 with 17 rules applied. Total rules applied 102 place count 61 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 59 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 59 transition count 106
Applied a total of 106 rules in 23 ms. Remains 59 /126 variables (removed 67) and now considering 106/496 (removed 390) transitions.
// Phase 1: matrix 106 rows 59 cols
[2024-05-28 01:16:39] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 01:16:39] [INFO ] Implicit Places using invariants in 106 ms returned [0, 5, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 109 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/126 places, 106/496 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 56/126 places, 106/496 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 482 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}], [{ cond=true, acceptance={} source=6 dest: 1}]], initial=5, aps=[p0:(LEQ 1 s43), p1:(LEQ 2 (ADD s17 s18 s19 s20 s21 s22 s23 s28)), p3:(LEQ 2 s3), p2:(LEQ 3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 4 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-00 finished in 696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 98 transition count 496
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 48 place count 78 transition count 344
Iterating global reduction 1 with 20 rules applied. Total rules applied 68 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 92 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 116 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 51 transition count 84
Applied a total of 122 rules in 28 ms. Remains 51 /126 variables (removed 75) and now considering 84/496 (removed 412) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-05-28 01:16:39] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 01:16:39] [INFO ] Implicit Places using invariants in 84 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 85 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/126 places, 84/496 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 115 ms. Remains : 47/126 places, 84/496 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s32 s33))], 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]]
Product exploration explored 100000 steps with 50000 reset in 349 ms.
Product exploration explored 100000 steps with 50000 reset in 258 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 84
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-05-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-05-LTLCardinality-01 finished in 917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 98 transition count 496
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 48 place count 78 transition count 344
Iterating global reduction 1 with 20 rules applied. Total rules applied 68 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 92 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 116 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 51 transition count 84
Applied a total of 122 rules in 11 ms. Remains 51 /126 variables (removed 75) and now considering 84/496 (removed 412) transitions.
[2024-05-28 01:16:40] [INFO ] Invariant cache hit.
[2024-05-28 01:16:40] [INFO ] Implicit Places using invariants in 73 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 : 47/126 places, 84/496 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 88 ms. Remains : 47/126 places, 84/496 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-02 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:(LEQ s22 s38)], 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 10 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-02 finished in 226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Graph (complete) has 1129 edges and 126 vertex of which 22 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.5 ms
Discarding 104 places :
Also discarding 448 output transitions
Drop transitions removed 448 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 20 transition count 32
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 20 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 18 transition count 26
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 17 transition count 26
Applied a total of 10 rules in 13 ms. Remains 17 /126 variables (removed 109) and now considering 26/496 (removed 470) transitions.
// Phase 1: matrix 26 rows 17 cols
[2024-05-28 01:16:40] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 01:16:40] [INFO ] Implicit Places using invariants in 37 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/126 places, 26/496 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 16 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 14 transition count 24
Applied a total of 4 rules in 10 ms. Remains 14 /16 variables (removed 2) and now considering 24/26 (removed 2) transitions.
// Phase 1: matrix 24 rows 14 cols
[2024-05-28 01:16:40] [INFO ] Computed 4 invariants in 6 ms
[2024-05-28 01:16:40] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-28 01:16:40] [INFO ] Invariant cache hit.
[2024-05-28 01:16:40] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/126 places, 24/496 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 14/126 places, 24/496 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s2 s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 304 ms.
Computed a total of 14 stabilizing places and 24 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 24
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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-05-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-05-LTLCardinality-03 finished in 672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(((G(p0) U p1) U p2) U (p1 U p3)))))'
Support contains 36 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Graph (complete) has 1129 edges and 126 vertex of which 106 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Discarding 20 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 480
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 480
Applied a total of 3 rules in 41 ms. Remains 105 /126 variables (removed 21) and now considering 480/496 (removed 16) transitions.
// Phase 1: matrix 480 rows 105 cols
[2024-05-28 01:16:41] [INFO ] Computed 17 invariants in 8 ms
[2024-05-28 01:16:41] [INFO ] Implicit Places using invariants in 169 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 178 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/126 places, 480/496 transitions.
Applied a total of 0 rules in 26 ms. Remains 104 /104 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 253 ms. Remains : 104/126 places, 480/496 transitions.
Stuttering acceptance computed with spot in 576 ms :[p3, p3, (AND p2 p3), p3, (AND p2 p3 p1 p0), (AND p0 p1 p3), (AND p0 p2 p3), (AND p0 p3), (AND p0 p3)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p2 p3), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=p3, acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p3)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p3), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p3), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p3, acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={2} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={1} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={1, 2} source=4 dest: 5}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 6}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={0, 2} source=4 dest: 6}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={0, 1} source=4 dest: 7}, { cond=(AND p0 p1 p2 p3), acceptance={0, 1, 2} source=4 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={1} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p3), acceptance={1, 2} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 6}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={0, 1} source=5 dest: 7}, { cond=(AND p0 p1 p3), acceptance={0, 1, 2} source=5 dest: 7}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={2} source=6 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={0, 2} source=6 dest: 6}, { cond=(AND p0 p2 (NOT p3)), acceptance={0, 1} source=6 dest: 7}, { cond=(AND p0 p2 p3), acceptance={0, 1, 2} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 p2 (NOT p3)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p0 p3), acceptance={0, 1, 2} source=7 dest: 7}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=7 dest: 8}], [{ cond=(AND p0 p3), acceptance={0, 1, 2} source=8 dest: 7}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1} source=8 dest: 8}]], initial=0, aps=[p2:(AND (LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7) (ADD s61 s62 s75 s76)) (LEQ 3 (ADD s17 s18 s19 s20 s21 s22 s23 s24))), p3:(LEQ (ADD s26 s27 s28 s29 s31 s32 s33...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 505 steps with 12 reset in 8 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-04 finished in 869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Graph (complete) has 1129 edges and 126 vertex of which 32 are kept as prefixes of interest. Removing 94 places using SCC suffix rule.2 ms
Discarding 94 places :
Also discarding 416 output transitions
Drop transitions removed 416 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 26 transition count 44
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 26 transition count 44
Applied a total of 13 rules in 6 ms. Remains 26 /126 variables (removed 100) and now considering 44/496 (removed 452) transitions.
// Phase 1: matrix 44 rows 26 cols
[2024-05-28 01:16:42] [INFO ] Computed 8 invariants in 1 ms
[2024-05-28 01:16:42] [INFO ] Implicit Places using invariants in 40 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/126 places, 44/496 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58 ms. Remains : 25/126 places, 44/496 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-06 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 (LEQ 3 s2) (LEQ 3 (ADD s0 s4 s6 s7)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-06 finished in 148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F((G(p1)||(p1&&F(p2))))))))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 100 transition count 496
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 45 place count 81 transition count 346
Iterating global reduction 1 with 19 rules applied. Total rules applied 64 place count 81 transition count 346
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 86 place count 59 transition count 124
Iterating global reduction 1 with 22 rules applied. Total rules applied 108 place count 59 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 57 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 57 transition count 108
Applied a total of 112 rules in 10 ms. Remains 57 /126 variables (removed 69) and now considering 108/496 (removed 388) transitions.
// Phase 1: matrix 108 rows 57 cols
[2024-05-28 01:16:42] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 01:16:42] [INFO ] Implicit Places using invariants in 81 ms returned [0, 5, 21, 29]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 84 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/126 places, 108/496 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 53/126 places, 108/496 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s47 s4), p1:(GT 3 s10), p2:(GT 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 15875 steps with 195 reset in 65 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-08 finished in 399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))))))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 98 transition count 496
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 48 place count 78 transition count 344
Iterating global reduction 1 with 20 rules applied. Total rules applied 68 place count 78 transition count 344
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 91 place count 55 transition count 114
Iterating global reduction 1 with 23 rules applied. Total rules applied 114 place count 55 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 54 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 54 transition count 106
Applied a total of 116 rules in 10 ms. Remains 54 /126 variables (removed 72) and now considering 106/496 (removed 390) transitions.
// Phase 1: matrix 106 rows 54 cols
[2024-05-28 01:16:42] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 01:16:42] [INFO ] Implicit Places using invariants in 80 ms returned [0, 5, 19, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 84 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/126 places, 106/496 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 95 ms. Remains : 50/126 places, 106/496 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s31 s7), p0:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6620 steps with 240 reset in 26 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-09 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Graph (complete) has 1129 edges and 126 vertex of which 81 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.2 ms
Discarding 45 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 63 transition count 224
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 63 transition count 224
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 49 place count 51 transition count 104
Iterating global reduction 0 with 12 rules applied. Total rules applied 61 place count 51 transition count 104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 63 place count 49 transition count 88
Iterating global reduction 0 with 2 rules applied. Total rules applied 65 place count 49 transition count 88
Applied a total of 65 rules in 21 ms. Remains 49 /126 variables (removed 77) and now considering 88/496 (removed 408) transitions.
// Phase 1: matrix 88 rows 49 cols
[2024-05-28 01:16:43] [INFO ] Computed 14 invariants in 1 ms
[2024-05-28 01:16:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 01:16:43] [INFO ] Invariant cache hit.
[2024-05-28 01:16:43] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-28 01:16:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 01:16:43] [INFO ] Invariant cache hit.
[2024-05-28 01:16:43] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/126 places, 88/496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 308 ms. Remains : 49/126 places, 88/496 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-10 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}]], initial=0, aps=[p1:(GT 2 s5), p0:(LEQ 1 s44)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 16055 reset in 280 ms.
Product exploration explored 100000 steps with 16027 reset in 353 ms.
Computed a total of 49 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 88
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 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 339 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=169 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-28 01:16:44] [INFO ] Invariant cache hit.
[2024-05-28 01:16:44] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-28 01:16:44] [INFO ] Invariant cache hit.
[2024-05-28 01:16:45] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-28 01:16:45] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 01:16:45] [INFO ] Invariant cache hit.
[2024-05-28 01:16:45] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 346 ms. Remains : 49/49 places, 88/88 transitions.
Computed a total of 49 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 88
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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 184 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1365 steps, including 15 resets, run visited all 2 properties in 4 ms. (steps per millisecond=341 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 355 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 15986 reset in 248 ms.
Product exploration explored 100000 steps with 16041 reset in 271 ms.
Built C files in :
/tmp/ltsmin10391549954658086673
[2024-05-28 01:16:46] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-28 01:16:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:16:46] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-28 01:16:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:16:46] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-28 01:16:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:16:46] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10391549954658086673
Running compilation step : cd /tmp/ltsmin10391549954658086673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 768 ms.
Running link step : cd /tmp/ltsmin10391549954658086673;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin10391549954658086673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5440303003031230794.hoa' '--buchi-type=spotba'
LTSmin run took 399 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-05-LTLCardinality-10 finished in 4595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(G(p1)))))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 99 transition count 496
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 46 place count 80 transition count 348
Iterating global reduction 1 with 19 rules applied. Total rules applied 65 place count 80 transition count 348
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 86 place count 59 transition count 122
Iterating global reduction 1 with 21 rules applied. Total rules applied 107 place count 59 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 57 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 57 transition count 106
Applied a total of 111 rules in 9 ms. Remains 57 /126 variables (removed 69) and now considering 106/496 (removed 390) transitions.
// Phase 1: matrix 106 rows 57 cols
[2024-05-28 01:16:47] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 01:16:47] [INFO ] Implicit Places using invariants in 98 ms returned [7]
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 : 56/126 places, 106/496 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 56/126 places, 106/496 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-11 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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s6 s29), p1:(LEQ 1 s3)], 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-05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-11 finished in 266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 496/496 transitions.
Graph (complete) has 1129 edges and 126 vertex of which 99 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.4 ms
Discarding 27 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 80 transition count 348
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 80 transition count 348
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 60 place count 59 transition count 124
Iterating global reduction 0 with 21 rules applied. Total rules applied 81 place count 59 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 82 place count 58 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 83 place count 58 transition count 116
Applied a total of 83 rules in 23 ms. Remains 58 /126 variables (removed 68) and now considering 116/496 (removed 380) transitions.
// Phase 1: matrix 116 rows 58 cols
[2024-05-28 01:16:48] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 01:16:48] [INFO ] Implicit Places using invariants in 94 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/126 places, 116/496 transitions.
Applied a total of 0 rules in 5 ms. Remains 57 /57 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 57/126 places, 116/496 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s44), p0:(GT 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-14 finished in 240 ms.
All properties solved by simple procedures.
Total runtime 12452 ms.

BK_STOP 1716859009638

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is PermAdmissibility-PT-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r285-smll-171654422000107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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