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-171649597800038.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649597800038
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716638438783

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 12:00:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 12:00:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 12:00:41] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-25 12:00:41] [INFO ] Transformed 124 places.
[2024-05-25 12:00:41] [INFO ] Transformed 111 transitions.
[2024-05-25 12:00:41] [INFO ] Parsed PT model containing 124 places and 111 transitions and 340 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Support contains 40 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 119 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 117 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 117 transition count 109
Applied a total of 9 rules in 49 ms. Remains 117 /124 variables (removed 7) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 117 cols
[2024-05-25 12:00:42] [INFO ] Computed 8 invariants in 10 ms
[2024-05-25 12:00:42] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-25 12:00:42] [INFO ] Invariant cache hit.
[2024-05-25 12:00:42] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2024-05-25 12:00:42] [INFO ] Invariant cache hit.
[2024-05-25 12:00:43] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 109/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 829 ms. Remains : 117/124 places, 109/111 transitions.
Support contains 40 out of 117 places after structural reductions.
[2024-05-25 12:00:43] [INFO ] Flatten gal took : 67 ms
[2024-05-25 12:00:43] [INFO ] Flatten gal took : 25 ms
[2024-05-25 12:00:43] [INFO ] Input system was already deterministic with 109 transitions.
Finished random walk after 209 steps, including 1 resets, run visited all 34 properties in 65 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 117 stabilizing places and 109 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 117 transition count 109
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' '!((F(p0)||X(G(p1))))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 109 transition count 101
Applied a total of 16 rules in 29 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-25 12:00:44] [INFO ] Computed 8 invariants in 3 ms
[2024-05-25 12:00:44] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-25 12:00:44] [INFO ] Invariant cache hit.
[2024-05-25 12:00:44] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-05-25 12:00:44] [INFO ] Invariant cache hit.
[2024-05-25 12:00:44] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 109/117 places, 101/109 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 307 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s72 1), p1:(GEQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1662 reset in 408 ms.
Product exploration explored 100000 steps with 1661 reset in 238 ms.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
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 p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 154 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Finished random walk after 59 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 199 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-25 12:00:46] [INFO ] Invariant cache hit.
[2024-05-25 12:00:46] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-25 12:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:46] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-25 12:00:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:00:46] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-25 12:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:46] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-25 12:00:46] [INFO ] Computed and/alt/rep : 47/50/47 causal constraints (skipped 49 transitions) in 22 ms.
[2024-05-25 12:00:46] [INFO ] Added : 30 causal constraints over 6 iterations in 155 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 109 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 101/101 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 42 place count 104 transition count 54
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 62 transition count 54
Applied a total of 84 rules in 21 ms. Remains 62 /109 variables (removed 47) and now considering 54/101 (removed 47) transitions.
// Phase 1: matrix 54 rows 62 cols
[2024-05-25 12:00:46] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 12:00:46] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-25 12:00:46] [INFO ] Invariant cache hit.
[2024-05-25 12:00:47] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-25 12:00:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:00:47] [INFO ] Invariant cache hit.
[2024-05-25 12:00:47] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/109 places, 54/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 62/109 places, 54/101 transitions.
Computed a total of 62 stabilizing places and 54 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 54
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-25 12:00:47] [INFO ] Invariant cache hit.
[2024-05-25 12:00:47] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-25 12:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:47] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-25 12:00:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:00:47] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-25 12:00:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:47] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-25 12:00:47] [INFO ] Computed and/alt/rep : 45/49/45 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 12:00:47] [INFO ] Added : 22 causal constraints over 5 iterations in 54 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3325 reset in 219 ms.
Product exploration explored 100000 steps with 3324 reset in 353 ms.
Built C files in :
/tmp/ltsmin8661041811789691336
[2024-05-25 12:00:48] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2024-05-25 12:00:48] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:00:48] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2024-05-25 12:00:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:00:48] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2024-05-25 12:00:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:00:48] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8661041811789691336
Running compilation step : cd /tmp/ltsmin8661041811789691336;'/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 339 ms.
Running link step : cd /tmp/ltsmin8661041811789691336;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8661041811789691336;'/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/stateBased11139774178870441819.hoa' '--buchi-type=spotba'
LTSmin run took 108 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLFireability-00 finished in 4906 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 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 109/109 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 34 place count 113 transition count 71
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 79 transition count 71
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 74 transition count 66
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 74 transition count 66
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 74 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 72 transition count 64
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 84 place count 70 transition count 62
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 70 transition count 62
Applied a total of 86 rules in 24 ms. Remains 70 /117 variables (removed 47) and now considering 62/109 (removed 47) transitions.
// Phase 1: matrix 62 rows 70 cols
[2024-05-25 12:00:49] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 12:00:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-25 12:00:49] [INFO ] Invariant cache hit.
[2024-05-25 12:00:49] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-25 12:00:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:00:49] [INFO ] Invariant cache hit.
[2024-05-25 12:00:49] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/117 places, 62/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 269 ms. Remains : 70/117 places, 62/109 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-01 finished in 322 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)||F(p1)))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 105
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 110 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 110 transition count 102
Applied a total of 14 rules in 10 ms. Remains 110 /117 variables (removed 7) and now considering 102/109 (removed 7) transitions.
// Phase 1: matrix 102 rows 110 cols
[2024-05-25 12:00:49] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 12:00:49] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-25 12:00:49] [INFO ] Invariant cache hit.
[2024-05-25 12:00:49] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-25 12:00:49] [INFO ] Invariant cache hit.
[2024-05-25 12:00:49] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/117 places, 102/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 110/117 places, 102/109 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s5 1) (GEQ s20 1)), p0:(AND (GEQ s1 1) (GEQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4720 reset in 203 ms.
Product exploration explored 100000 steps with 4628 reset in 251 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 p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
[2024-05-25 12:00:50] [INFO ] Invariant cache hit.
[2024-05-25 12:00:50] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-25 12:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:51] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2024-05-25 12:00:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:00:51] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 18 ms returned sat
[2024-05-25 12:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:51] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-25 12:00:51] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 9 ms.
[2024-05-25 12:00:51] [INFO ] Added : 27 causal constraints over 6 iterations in 142 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 110 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 102/102 transitions.
Reduce places removed 3 places and 3 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 107 transition count 75
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 83 transition count 75
Applied a total of 48 rules in 9 ms. Remains 83 /110 variables (removed 27) and now considering 75/102 (removed 27) transitions.
// Phase 1: matrix 75 rows 83 cols
[2024-05-25 12:00:51] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 12:00:51] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-25 12:00:51] [INFO ] Invariant cache hit.
[2024-05-25 12:00:51] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-25 12:00:51] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:00:51] [INFO ] Invariant cache hit.
[2024-05-25 12:00:51] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/110 places, 75/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 291 ms. Remains : 83/110 places, 75/102 transitions.
Computed a total of 83 stabilizing places and 75 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 83 transition count 75
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
[2024-05-25 12:00:52] [INFO ] Invariant cache hit.
[2024-05-25 12:00:52] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-25 12:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:52] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-25 12:00:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:00:52] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-25 12:00:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:52] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-25 12:00:52] [INFO ] Computed and/alt/rep : 50/57/50 causal constraints (skipped 21 transitions) in 6 ms.
[2024-05-25 12:00:52] [INFO ] Added : 21 causal constraints over 5 iterations in 63 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Product exploration explored 100000 steps with 6257 reset in 130 ms.
Product exploration explored 100000 steps with 6240 reset in 162 ms.
Built C files in :
/tmp/ltsmin11248335230445989528
[2024-05-25 12:00:52] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2024-05-25 12:00:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:00:52] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2024-05-25 12:00:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:00:52] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2024-05-25 12:00:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:00:52] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11248335230445989528
Running compilation step : cd /tmp/ltsmin11248335230445989528;'/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 229 ms.
Running link step : cd /tmp/ltsmin11248335230445989528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11248335230445989528;'/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/stateBased9030711688934228663.hoa' '--buchi-type=spotba'
LTSmin run took 123 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLFireability-02 finished in 3947 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||X(!p0))) U (!p0||X(p1))) U p1))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 109 transition count 101
Applied a total of 16 rules in 7 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-25 12:00:53] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 12:00:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-25 12:00:53] [INFO ] Invariant cache hit.
[2024-05-25 12:00:53] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-25 12:00:53] [INFO ] Invariant cache hit.
[2024-05-25 12:00:53] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LT s76 1), p1:(GEQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2670 reset in 147 ms.
Product exploration explored 100000 steps with 2664 reset in 160 ms.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 182 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Finished random walk after 62 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 345 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
[2024-05-25 12:00:55] [INFO ] Invariant cache hit.
[2024-05-25 12:00:55] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-25 12:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:55] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-25 12:00:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:00:55] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-25 12:00:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:55] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-25 12:00:55] [INFO ] Computed and/alt/rep : 47/50/47 causal constraints (skipped 49 transitions) in 9 ms.
[2024-05-25 12:00:55] [INFO ] Added : 16 causal constraints over 4 iterations in 54 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-25 12:00:55] [INFO ] Invariant cache hit.
[2024-05-25 12:00:55] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-25 12:00:55] [INFO ] Invariant cache hit.
[2024-05-25 12:00:55] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-05-25 12:00:55] [INFO ] Invariant cache hit.
[2024-05-25 12:00:55] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 109/109 places, 101/101 transitions.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 168 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Finished random walk after 68 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 375 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
[2024-05-25 12:00:57] [INFO ] Invariant cache hit.
[2024-05-25 12:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-25 12:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:57] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-25 12:00:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:00:57] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-25 12:00:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:00:57] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-25 12:00:57] [INFO ] Computed and/alt/rep : 47/50/47 causal constraints (skipped 49 transitions) in 8 ms.
[2024-05-25 12:00:57] [INFO ] Added : 16 causal constraints over 4 iterations in 51 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 140 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2664 reset in 140 ms.
Product exploration explored 100000 steps with 2668 reset in 155 ms.
Built C files in :
/tmp/ltsmin17054601709051556515
[2024-05-25 12:00:58] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17054601709051556515
Running compilation step : cd /tmp/ltsmin17054601709051556515;'/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 264 ms.
Running link step : cd /tmp/ltsmin17054601709051556515;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17054601709051556515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3681920875032724738.hoa' '--buchi-type=spotba'
LTSmin run took 2287 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLFireability-03 finished in 7302 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 U (p1 U p2))||G(!p1)))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Reduce places removed 3 places and 3 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 34 place count 114 transition count 72
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 80 transition count 72
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 75 transition count 67
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 75 transition count 67
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 75 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 73 transition count 65
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 72 transition count 64
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 72 transition count 64
Applied a total of 84 rules in 14 ms. Remains 72 /117 variables (removed 45) and now considering 64/109 (removed 45) transitions.
// Phase 1: matrix 64 rows 72 cols
[2024-05-25 12:01:00] [INFO ] Computed 8 invariants in 3 ms
[2024-05-25 12:01:00] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-25 12:01:00] [INFO ] Invariant cache hit.
[2024-05-25 12:01:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 12:01:00] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-25 12:01:00] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:01:00] [INFO ] Invariant cache hit.
[2024-05-25 12:01:00] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/117 places, 64/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 72/117 places, 64/109 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s5 1), p2:(AND (GEQ s2 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2344 reset in 252 ms.
Product exploration explored 100000 steps with 2312 reset in 352 ms.
Computed a total of 72 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 72 transition count 64
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 p2)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-04 finished in 1050 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)||G(!p0))))'
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 109/109 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 44 place count 112 transition count 60
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 68 transition count 60
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 63 transition count 55
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 63 transition count 55
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 63 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 61 transition count 53
Applied a total of 102 rules in 10 ms. Remains 61 /117 variables (removed 56) and now considering 53/109 (removed 56) transitions.
// Phase 1: matrix 53 rows 61 cols
[2024-05-25 12:01:01] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 12:01:01] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-25 12:01:01] [INFO ] Invariant cache hit.
[2024-05-25 12:01:01] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-25 12:01:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:01:01] [INFO ] Invariant cache hit.
[2024-05-25 12:01:01] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/117 places, 53/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 61/117 places, 53/109 transitions.
Stuttering acceptance computed with spot in 35 ms :[false]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s13 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1722 reset in 86 ms.
Product exploration explored 100000 steps with 1720 reset in 98 ms.
Computed a total of 61 stabilizing places and 53 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 53
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), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-05 finished in 503 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 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 114 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 114 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 112 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 112 transition count 104
Applied a total of 10 rules in 4 ms. Remains 112 /117 variables (removed 5) and now considering 104/109 (removed 5) transitions.
// Phase 1: matrix 104 rows 112 cols
[2024-05-25 12:01:02] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 12:01:02] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-25 12:01:02] [INFO ] Invariant cache hit.
[2024-05-25 12:01:02] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-25 12:01:02] [INFO ] Invariant cache hit.
[2024-05-25 12:01:02] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/117 places, 104/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 112/117 places, 104/109 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s11 1) (AND (GEQ s5 1) (GEQ s20 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-06 finished in 466 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 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Reduce places removed 3 places and 3 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 114 transition count 70
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 78 transition count 70
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 74 transition count 66
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 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 81 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 82 place count 73 transition count 65
Applied a total of 82 rules in 10 ms. Remains 73 /117 variables (removed 44) and now considering 65/109 (removed 44) transitions.
// Phase 1: matrix 65 rows 73 cols
[2024-05-25 12:01:02] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 12:01:02] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-25 12:01:02] [INFO ] Invariant cache hit.
[2024-05-25 12:01:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 12:01:02] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-25 12:01:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:01:02] [INFO ] Invariant cache hit.
[2024-05-25 12:01:02] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/117 places, 65/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 73/117 places, 65/109 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s15 1) (AND (GEQ s5 1) (GEQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 12612 reset in 131 ms.
Product exploration explored 100000 steps with 12664 reset in 148 ms.
Computed a total of 73 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 65
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-25 12:01:03] [INFO ] Invariant cache hit.
[2024-05-25 12:01:03] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-25 12:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:01:03] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-25 12:01:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:01:03] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-25 12:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:01:04] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-25 12:01:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 12:01:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-25 12:01:04] [INFO ] Computed and/alt/rep : 48/72/48 causal constraints (skipped 11 transitions) in 6 ms.
[2024-05-25 12:01:04] [INFO ] Added : 35 causal constraints over 7 iterations in 111 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-25 12:01:04] [INFO ] Invariant cache hit.
[2024-05-25 12:01:04] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-25 12:01:04] [INFO ] Invariant cache hit.
[2024-05-25 12:01:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 12:01:04] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-25 12:01:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:01:04] [INFO ] Invariant cache hit.
[2024-05-25 12:01:04] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 73/73 places, 65/65 transitions.
Computed a total of 73 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 65
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-25 12:01:04] [INFO ] Invariant cache hit.
[2024-05-25 12:01:05] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-25 12:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:01:05] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-25 12:01:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:01:05] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-25 12:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:01:05] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-25 12:01:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 12:01:05] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-25 12:01:05] [INFO ] Computed and/alt/rep : 48/72/48 causal constraints (skipped 11 transitions) in 8 ms.
[2024-05-25 12:01:05] [INFO ] Added : 35 causal constraints over 7 iterations in 95 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12663 reset in 231 ms.
Product exploration explored 100000 steps with 12613 reset in 268 ms.
Built C files in :
/tmp/ltsmin6511499522623695821
[2024-05-25 12:01:05] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2024-05-25 12:01:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:01:05] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2024-05-25 12:01:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:01:05] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2024-05-25 12:01:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:01:05] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6511499522623695821
Running compilation step : cd /tmp/ltsmin6511499522623695821;'/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 210 ms.
Running link step : cd /tmp/ltsmin6511499522623695821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6511499522623695821;'/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/stateBased3695393699996843257.hoa' '--buchi-type=spotba'
LTSmin run took 109 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLFireability-07 finished in 3581 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(X(X((G(p0)||(!(p0 U p1)&&X(p2))))))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 109 transition count 101
Applied a total of 16 rules in 5 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-25 12:01:06] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 12:01:06] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-25 12:01:06] [INFO ] Invariant cache hit.
[2024-05-25 12:01:06] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-25 12:01:06] [INFO ] Invariant cache hit.
[2024-05-25 12:01:06] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 341 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 7}], [{ cond=(OR (AND (NOT p0) p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 7}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(OR (AND p0 p1) (AND p0 (NOT p2))), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=6, aps=[p0:(GEQ s84 1), p1:(AND (GEQ s3 1) (GEQ s90 1)), p2:(LT s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 90 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-08 finished in 719 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&&X(F((p1||X(!p0))))))))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 111 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 111 transition count 103
Applied a total of 12 rules in 5 ms. Remains 111 /117 variables (removed 6) and now considering 103/109 (removed 6) transitions.
// Phase 1: matrix 103 rows 111 cols
[2024-05-25 12:01:07] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 12:01:07] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-25 12:01:07] [INFO ] Invariant cache hit.
[2024-05-25 12:01:07] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-25 12:01:07] [INFO ] Invariant cache hit.
[2024-05-25 12:01:07] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 103/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 381 ms. Remains : 111/117 places, 103/109 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LT s95 1), p0:(LT s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 143 ms.
Product exploration explored 100000 steps with 33333 reset in 245 ms.
Computed a total of 111 stabilizing places and 103 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 111 transition count 103
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-09 finished in 1014 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(X(F(p0))) U p1)&&G(X(G(p2)))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 109 transition count 101
Applied a total of 16 rules in 5 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-25 12:01:08] [INFO ] Computed 8 invariants in 0 ms
[2024-05-25 12:01:08] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-25 12:01:08] [INFO ] Invariant cache hit.
[2024-05-25 12:01:08] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-25 12:01:08] [INFO ] Invariant cache hit.
[2024-05-25 12:01:08] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2 p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p2), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(OR (GEQ s35 1) (GEQ s93 1)), p1:(AND (GEQ s1 1) (GEQ s43 1)), p0:(GEQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-10 finished in 493 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(X((X(p0)&&F(!((p0 U p1) U G(p2))))))))'
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 109 transition count 101
Applied a total of 16 rules in 4 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
[2024-05-25 12:01:08] [INFO ] Invariant cache hit.
[2024-05-25 12:01:08] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-25 12:01:08] [INFO ] Invariant cache hit.
[2024-05-25 12:01:08] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-25 12:01:08] [INFO ] Invariant cache hit.
[2024-05-25 12:01:08] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), p2, p2, (NOT p0), (AND p1 p2), true]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}, { cond=true, acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s7 1) (GEQ s52 1)), p1:(AND (GEQ s9 1) (GEQ s83 1)), p0:(AND (GEQ s68 1) (GEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-11 finished in 631 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((X(p0)||(p1&&(p2 U G((p0 U p3)))))))'
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 110 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 110 transition count 102
Applied a total of 14 rules in 4 ms. Remains 110 /117 variables (removed 7) and now considering 102/109 (removed 7) transitions.
// Phase 1: matrix 102 rows 110 cols
[2024-05-25 12:01:09] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 12:01:09] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-25 12:01:09] [INFO ] Invariant cache hit.
[2024-05-25 12:01:09] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-25 12:01:09] [INFO ] Invariant cache hit.
[2024-05-25 12:01:09] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/117 places, 102/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 110/117 places, 102/109 transitions.
Stuttering acceptance computed with spot in 351 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 p3 (NOT p2)) (AND p1 p0 (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(OR p3 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(OR (AND p3 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=6 dest: 5}, { cond=(OR (AND p3 p2) (AND p0 p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) p0 p2), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p3) p0 p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(OR (LT s9 1) (LT s94 1)), p3:(AND (GEQ s7 1) (GEQ s38 1)), p0:(GEQ s25 1), p2:(AND (GEQ s5 1) (GEQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-12 finished in 655 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(X(G(p0)))))'
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 109 transition count 101
Applied a total of 16 rules in 4 ms. Remains 109 /117 variables (removed 8) and now considering 101/109 (removed 8) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-25 12:01:09] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 12:01:09] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-25 12:01:09] [INFO ] Invariant cache hit.
[2024-05-25 12:01:10] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-25 12:01:10] [INFO ] Invariant cache hit.
[2024-05-25 12:01:10] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 109/117 places, 101/109 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-13 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GEQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-13 finished in 512 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 p1)||X(G(p2))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 111 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 111 transition count 103
Applied a total of 12 rules in 4 ms. Remains 111 /117 variables (removed 6) and now considering 103/109 (removed 6) transitions.
// Phase 1: matrix 103 rows 111 cols
[2024-05-25 12:01:10] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 12:01:10] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-25 12:01:10] [INFO ] Invariant cache hit.
[2024-05-25 12:01:10] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-25 12:01:10] [INFO ] Invariant cache hit.
[2024-05-25 12:01:10] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 103/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 111/117 places, 103/109 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s61 1), p0:(GEQ s25 1), p2:(OR (LT s1 1) (LT s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 86 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-14 finished in 503 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((((p1||G(p2)) U (!p3&&(p1||G(p2))))||p0))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 109/109 transitions.
Reduce places removed 4 places and 4 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 72
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 80 transition count 72
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 76 transition count 68
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 76 transition count 68
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 76 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 74 transition count 66
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 73 transition count 65
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 73 transition count 65
Applied a total of 80 rules in 12 ms. Remains 73 /117 variables (removed 44) and now considering 65/109 (removed 44) transitions.
// Phase 1: matrix 65 rows 73 cols
[2024-05-25 12:01:10] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 12:01:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-25 12:01:10] [INFO ] Invariant cache hit.
[2024-05-25 12:01:10] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-25 12:01:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:01:11] [INFO ] Invariant cache hit.
[2024-05-25 12:01:11] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/117 places, 65/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 73/117 places, 65/109 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p3 (NOT p0) p2) (AND (NOT p1) (NOT p0) p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(AND (GEQ s2 1) (GEQ s70 1)), p0:(OR (LT s2 1) (LT s70 1)), p1:(GEQ s67 1), p2:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1458 reset in 123 ms.
Product exploration explored 100000 steps with 1458 reset in 141 ms.
Computed a total of 73 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 65
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 p3) p0 (NOT p1) (NOT p2)), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) p2))), (X (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) p2)))), (X (X (NOT (OR (AND p3 (NOT p0) p2) (AND (NOT p1) (NOT p0) p2))))), (F (G (NOT p3))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 18 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-15 finished in 735 ms.
All properties solved by simple procedures.
Total runtime 29975 ms.

BK_STOP 1716638473031

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r219-smll-171649597800038"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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