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.r219-smll-171649597800037.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 HirschbergSinclair-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649597800037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 03:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 03:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 03:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 03:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 157K May 18 16:42 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 HirschbergSinclair-PT-05-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716638323136

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=HirschbergSinclair-PT-05
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 11:58:46] [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-25 11:58:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:58:46] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2024-05-25 11:58:46] [INFO ] Transformed 124 places.
[2024-05-25 11:58:46] [INFO ] Transformed 111 transitions.
[2024-05-25 11:58:46] [INFO ] Parsed PT model containing 124 places and 111 transitions and 340 arcs in 458 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 118 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 118 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 117 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 117 transition count 108
Applied a total of 10 rules in 74 ms. Remains 117 /124 variables (removed 7) and now considering 108/111 (removed 3) transitions.
// Phase 1: matrix 108 rows 117 cols
[2024-05-25 11:58:47] [INFO ] Computed 9 invariants in 23 ms
[2024-05-25 11:58:47] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-25 11:58:47] [INFO ] Invariant cache hit.
[2024-05-25 11:58:47] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2024-05-25 11:58:47] [INFO ] Invariant cache hit.
[2024-05-25 11:58:48] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 108/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1035 ms. Remains : 117/124 places, 108/111 transitions.
Support contains 38 out of 117 places after structural reductions.
[2024-05-25 11:58:48] [INFO ] Flatten gal took : 71 ms
[2024-05-25 11:58:48] [INFO ] Flatten gal took : 30 ms
[2024-05-25 11:58:48] [INFO ] Input system was already deterministic with 108 transitions.
Support contains 36 out of 117 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 770 ms. (steps per millisecond=12 ) properties (out of 28) seen :21
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-25 11:58:50] [INFO ] Invariant cache hit.
[2024-05-25 11:58:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:58:50] [INFO ] [Real]Absence check using 1 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-25 11:58:50] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 3 ms.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 117 stabilizing places and 108 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 117 transition count 108
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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) U (X(p1) U (!((p2 U p3)&&p2) U G(p0)))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 112 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 110 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 110 transition count 102
Applied a total of 13 rules in 31 ms. Remains 110 /117 variables (removed 7) and now considering 102/108 (removed 6) transitions.
// Phase 1: matrix 102 rows 110 cols
[2024-05-25 11:58:50] [INFO ] Computed 8 invariants in 3 ms
[2024-05-25 11:58:50] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-25 11:58:50] [INFO ] Invariant cache hit.
[2024-05-25 11:58:51] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-25 11:58:51] [INFO ] Invariant cache hit.
[2024-05-25 11:58:51] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/117 places, 102/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 498 ms. Remains : 110/117 places, 102/108 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 1296 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p3 (NOT p1)), (AND (NOT p0) (NOT p1)), true, (OR (AND p1 (NOT p2) p3) (AND p0 p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) p3 p1), (AND p0 (NOT p1)), false, (NOT p0), (AND p0 (NOT p1) p3), false, false]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p3), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1))), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) p2 p3), acceptance={} source=2 dest: 10}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=2 dest: 11}, { cond=(NOT p0), acceptance={} source=2 dest: 12}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 13}], [{ cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND p0 p3) (AND (NOT p2) p3 p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2 p3), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=7 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={0} source=7 dest: 7}, { cond=(AND p0 p2 p3), acceptance={} source=7 dest: 8}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) p3 p1), acceptance={} source=9 dest: 5}, { cond=(AND p0 (NOT p2) p3 p1), acceptance={} source=9 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 5}], [{ cond=(OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p3) (NOT p1))), acceptance={} source=11 dest: 7}, { cond=(AND p0 p2 p3 (NOT p1)), acceptance={} source=11 dest: 8}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={} source=11 dest: 9}], [{ cond=(AND (NOT p0) p2 p3), acceptance={} source=12 dest: 10}, { cond=(OR (NOT p2) (NOT p3)), acceptance={} source=12 dest: 11}, { cond=p0, acceptance={} source=12 dest: 12}, { cond=(NOT p0), acceptance={0} source=12 dest: 12}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=12 dest: 13}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=12 dest: 14}, { cond=(AND p0 p2 p3), acceptance={} source=12 dest: 15}], [{ cond=(AND p0 p3 (NOT p1)), acceptance={} source=13 dest: 5}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={} source=13 dest: 6}], [{ cond=(AND p0 (NOT p2) p3 (NOT p1)), acceptance={} source=14 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=15 dest: 8}]], initial=0, aps=[p0:(LEQ 1 s52), p2:(LEQ 1 s104), p3:(LEQ s52 s88), p1:(LEQ s39 s101)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28510 reset in 721 ms.
Product exploration explored 100000 steps with 28536 reset in 358 ms.
Computed a total of 110 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110 transition count 102
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) p3 p1), (X (NOT (AND (NOT p0) p2 p3 (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1))))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (OR (AND p0 p3) (AND (NOT p2) p3 p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p3) (NOT p1)))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 p2 p3)))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p2 p3 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p3 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 39 factoid took 14580 ms. Reduced automaton from 16 states, 43 edges and 4 AP (stutter sensitive) to 13 states, 39 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 544 ms :[(NOT p0), (AND (NOT p0) (NOT p2) p3 (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), true, (OR (AND p1 (NOT p2) p3) (AND p0 p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) p3 p1), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1) p3), false, false]
Incomplete random walk after 10000 steps, including 90 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 27) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-25 11:59:09] [INFO ] Invariant cache hit.
[2024-05-25 11:59:09] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 13 ms returned sat
[2024-05-25 11:59:09] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2024-05-25 11:59:09] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 13 ms returned sat
[2024-05-25 11:59:10] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :0
Fused 15 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 15 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT (AND (NOT p0) p2 p3 (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1))))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND p2 p3))), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (OR (AND p0 p3) (AND (NOT p2) p3 p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p3) (NOT p1)))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 p2 p3)))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p2 p3 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p3 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (G p1)), (G (NOT (AND p0 (NOT p2) p3 (NOT p1)))), (G (NOT (AND (NOT p0) p2 p3 (NOT p1)))), (G (NOT (AND p0 p3 (NOT p1)))), (G (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (G (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (G (NOT (AND p2 (NOT p3)))), (G (NOT (AND p0 p2 p3 (NOT p1)))), (G (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p3) (NOT p1))))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) p2 (NOT p3) p1))), (G (NOT (AND (NOT p0) p2 (NOT p3)))), (G (NOT (AND p0 (NOT p2) p3 p1))), (G (NOT (AND p0 p2 (NOT p3) p1))), (G (NOT (AND p0 p2 p3 p1))), (G (NOT (AND p0 p2 (NOT p3))))]
False Knowledge obtained : [(F (OR (AND p0 p2 p3) (AND p2 p3 p1))), (F (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1)))), (F (OR (AND p0 (NOT p2)) (AND p0 (NOT p3)) (AND p0 p1))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) p1)))), (F (AND (NOT p0) p2 p3 p1)), (F (AND (NOT p0) (NOT p2) p3 (NOT p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (F (OR (AND p0 (NOT p2) p1) (AND p0 (NOT p3) p1))), (F (AND (NOT p0) p2 p3)), (F (NOT (AND (NOT p0) (NOT p2) p3 p1))), (F (NOT (OR (AND p0 p3) (AND (NOT p2) p3 p1))))]
Knowledge based reduction with 54 factoid took 46400 ms. Reduced automaton from 13 states, 39 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1) p2 p3)]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1) p2 p3)]
[2024-05-25 11:59:56] [INFO ] Invariant cache hit.
[2024-05-25 11:59:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-25 11:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:59:57] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-25 11:59:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:59:57] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-25 11:59:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:59:57] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-25 11:59:57] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 33 ms.
[2024-05-25 11:59:57] [INFO ] Added : 20 causal constraints over 4 iterations in 156 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 102/102 transitions.
Reduce places removed 5 places and 5 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 105 transition count 60
Reduce places removed 37 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 76 place count 68 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 66 transition count 58
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 3 with 2 rules applied. Total rules applied 80 place count 65 transition count 57
Applied a total of 80 rules in 51 ms. Remains 65 /110 variables (removed 45) and now considering 57/102 (removed 45) transitions.
// Phase 1: matrix 57 rows 65 cols
[2024-05-25 11:59:57] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 11:59:57] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-25 11:59:57] [INFO ] Invariant cache hit.
[2024-05-25 11:59:57] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-25 11:59:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 11:59:57] [INFO ] Invariant cache hit.
[2024-05-25 11:59:57] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/110 places, 57/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 433 ms. Remains : 65/110 places, 57/102 transitions.
Computed a total of 65 stabilizing places and 57 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 65 transition count 57
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 (NOT p2) p3), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 4932 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1) p2 p3)]
Incomplete random walk after 10000 steps, including 157 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:00:03] [INFO ] Invariant cache hit.
[2024-05-25 12:00:03] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:00:03] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-25 12:00:03] [INFO ] After 119ms 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 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) p1 (NOT p3))), (F p2), (F (AND p0 p1)), (F (AND p2 p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)) (AND (NOT p2) p3))))]
Knowledge based reduction with 23 factoid took 10813 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) p2 p3)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) p2 p3)]
[2024-05-25 12:00:14] [INFO ] Invariant cache hit.
[2024-05-25 12:00:14] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 10 ms returned sat
[2024-05-25 12:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:14] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-25 12:00:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:00:14] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-25 12:00:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:14] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-25 12:00:14] [INFO ] Computed and/alt/rep : 48/52/48 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 12:00:14] [INFO ] Added : 12 causal constraints over 3 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) p2 p3)]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-00 finished in 84223 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(p1))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 113 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 113 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 111 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 111 transition count 103
Applied a total of 11 rules in 18 ms. Remains 111 /117 variables (removed 6) and now considering 103/108 (removed 5) transitions.
// Phase 1: matrix 103 rows 111 cols
[2024-05-25 12:00:14] [INFO ] Computed 8 invariants in 5 ms
[2024-05-25 12:00:15] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-25 12:00:15] [INFO ] Invariant cache hit.
[2024-05-25 12:00:15] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-25 12:00:15] [INFO ] Invariant cache hit.
[2024-05-25 12:00:15] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 103/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 111/117 places, 103/108 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT 1 s64), p0:(LEQ s20 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 83 steps with 2 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-01 finished in 845 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 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 111 transition count 59
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 67 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 66 transition count 58
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 63 transition count 55
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 63 transition count 55
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 63 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 62 transition count 54
Applied a total of 99 rules in 31 ms. Remains 62 /117 variables (removed 55) and now considering 54/108 (removed 54) transitions.
// Phase 1: matrix 54 rows 62 cols
[2024-05-25 12:00:15] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 12:00:15] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-25 12:00:15] [INFO ] Invariant cache hit.
[2024-05-25 12:00:16] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-05-25 12:00:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:00:16] [INFO ] Invariant cache hit.
[2024-05-25 12:00:16] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/117 places, 54/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 405 ms. Remains : 62/117 places, 54/108 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-04 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:(LEQ 1 s13)], 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 1059 steps with 90 reset in 3 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-04 finished in 537 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 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 111 transition count 61
Reduce places removed 42 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 69 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 67 transition count 59
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 64 transition count 56
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 64 transition count 56
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 64 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 63 transition count 55
Applied a total of 97 rules in 25 ms. Remains 63 /117 variables (removed 54) and now considering 55/108 (removed 53) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-25 12:00:16] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 12:00:16] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-25 12:00:16] [INFO ] Invariant cache hit.
[2024-05-25 12:00:16] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-25 12:00:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:00:16] [INFO ] Invariant cache hit.
[2024-05-25 12:00:16] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/117 places, 55/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 ms. Remains : 63/117 places, 55/108 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-07 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:(LEQ s44 s52)], 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 2106 reset in 439 ms.
Product exploration explored 100000 steps with 2093 reset in 363 ms.
Computed a total of 63 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 55
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 : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 55/55 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-05-25 12:00:18] [INFO ] Invariant cache hit.
[2024-05-25 12:00:18] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-25 12:00:18] [INFO ] Invariant cache hit.
[2024-05-25 12:00:18] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-25 12:00:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:00:18] [INFO ] Invariant cache hit.
[2024-05-25 12:00:18] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 356 ms. Remains : 63/63 places, 55/55 transitions.
Computed a total of 63 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 55
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 : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2099 reset in 165 ms.
Product exploration explored 100000 steps with 2092 reset in 190 ms.
Built C files in :
/tmp/ltsmin9325101479199292772
[2024-05-25 12:00:19] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2024-05-25 12:00:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:00:19] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2024-05-25 12:00:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:00:19] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2024-05-25 12:00:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:00:19] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9325101479199292772
Running compilation step : cd /tmp/ltsmin9325101479199292772;'/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 510 ms.
Running link step : cd /tmp/ltsmin9325101479199292772;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin9325101479199292772;'/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/stateBased10088168237489407893.hoa' '--buchi-type=spotba'
LTSmin run took 709 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-07 finished in 4700 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||G(p1)))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 111 transition count 62
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 70 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 69 transition count 61
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 66 transition count 58
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 66 transition count 58
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 66 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 65 transition count 57
Applied a total of 93 rules in 14 ms. Remains 65 /117 variables (removed 52) and now considering 57/108 (removed 51) transitions.
// Phase 1: matrix 57 rows 65 cols
[2024-05-25 12:00:20] [INFO ] Computed 8 invariants in 3 ms
[2024-05-25 12:00:21] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-25 12:00:21] [INFO ] Invariant cache hit.
[2024-05-25 12:00:21] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-25 12:00:21] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:00:21] [INFO ] Invariant cache hit.
[2024-05-25 12:00:21] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/117 places, 57/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 370 ms. Remains : 65/117 places, 57/108 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s20 s30), p0:(GT s24 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11091 steps with 449 reset in 24 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-09 finished in 525 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 U X(G(p1)))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 109 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 109 transition count 101
Applied a total of 15 rules in 13 ms. Remains 109 /117 variables (removed 8) and now considering 101/108 (removed 7) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-25 12:00:21] [INFO ] Computed 8 invariants in 3 ms
[2024-05-25 12:00:21] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-25 12:00:21] [INFO ] Invariant cache hit.
[2024-05-25 12:00:21] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-25 12:00:21] [INFO ] Invariant cache hit.
[2024-05-25 12:00:21] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 109/117 places, 101/108 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s104 s8), p0:(GT 1 s88)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 90 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-10 finished in 623 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(G(p0)))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 112 transition count 63
Reduce places removed 41 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 44 rules applied. Total rules applied 86 place count 71 transition count 60
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 68 transition count 60
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 64 transition count 56
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 64 transition count 56
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 64 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 63 transition count 55
Applied a total of 99 rules in 24 ms. Remains 63 /117 variables (removed 54) and now considering 55/108 (removed 53) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-25 12:00:22] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 12:00:22] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-25 12:00:22] [INFO ] Invariant cache hit.
[2024-05-25 12:00:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 12:00:22] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-25 12:00:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 12:00:22] [INFO ] Invariant cache hit.
[2024-05-25 12:00:22] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/117 places, 55/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 63/117 places, 55/108 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ s44 s13) (LEQ 3 s22))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1667 reset in 104 ms.
Product exploration explored 100000 steps with 1664 reset in 105 ms.
Computed a total of 63 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 55
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 : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 55/55 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-05-25 12:00:23] [INFO ] Invariant cache hit.
[2024-05-25 12:00:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-25 12:00:23] [INFO ] Invariant cache hit.
[2024-05-25 12:00:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 12:00:23] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-25 12:00:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 12:00:23] [INFO ] Invariant cache hit.
[2024-05-25 12:00:23] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 63/63 places, 55/55 transitions.
Computed a total of 63 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 55
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 : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1664 reset in 163 ms.
Product exploration explored 100000 steps with 1664 reset in 189 ms.
Built C files in :
/tmp/ltsmin1885418677503534267
[2024-05-25 12:00:24] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2024-05-25 12:00:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:00:24] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2024-05-25 12:00:24] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:00:24] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2024-05-25 12:00:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:00:24] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1885418677503534267
Running compilation step : cd /tmp/ltsmin1885418677503534267;'/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 316 ms.
Running link step : cd /tmp/ltsmin1885418677503534267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1885418677503534267;'/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/stateBased13273821206138192768.hoa' '--buchi-type=spotba'
LTSmin run took 852 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-11 finished in 3392 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(p1)||(p1&&F(p2))))||p0)))'
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 114 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 114 transition count 105
Applied a total of 6 rules in 4 ms. Remains 114 /117 variables (removed 3) and now considering 105/108 (removed 3) transitions.
// Phase 1: matrix 105 rows 114 cols
[2024-05-25 12:00:25] [INFO ] Computed 9 invariants in 1 ms
[2024-05-25 12:00:25] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-25 12:00:25] [INFO ] Invariant cache hit.
[2024-05-25 12:00:25] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-25 12:00:25] [INFO ] Invariant cache hit.
[2024-05-25 12:00:25] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/117 places, 105/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 114/117 places, 105/108 transitions.
Stuttering acceptance computed with spot in 389 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(GT s98 s9), p0:(OR (GT s42 s65) (AND (GT 2 s96) (GT s98 s9))), p1:(LEQ s50 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28493 steps with 272 reset in 37 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-13 finished in 874 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(G((p0 U p1))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 112 transition count 70
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 78 transition count 70
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 74 transition count 66
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 74 transition count 66
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 74 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 73 transition count 65
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 72 transition count 64
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 72 transition count 64
Applied a total of 81 rules in 16 ms. Remains 72 /117 variables (removed 45) and now considering 64/108 (removed 44) transitions.
// Phase 1: matrix 64 rows 72 cols
[2024-05-25 12:00:26] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 12:00:26] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-25 12:00:26] [INFO ] Invariant cache hit.
[2024-05-25 12:00:26] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-25 12:00:26] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 12:00:26] [INFO ] Invariant cache hit.
[2024-05-25 12:00:26] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/117 places, 64/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 301 ms. Remains : 72/117 places, 64/108 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ 1 s65) (LEQ s3 s53)), p0:(LEQ s66 s70)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-15 finished in 425 ms.
All properties solved by simple procedures.
Total runtime 100542 ms.

BK_STOP 1716638428320

--------------------
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="HirschbergSinclair-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 HirschbergSinclair-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 r219-smll-171649597800037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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