Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 8.1K Feb 26 02:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 02:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 02:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 02:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 02:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 136K Mar 5 18:22 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-10-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678539518085

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 12:58:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 12:58:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 12:58:42] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2023-03-11 12:58:42] [INFO ] Transformed 260 places.
[2023-03-11 12:58:42] [INFO ] Transformed 236 transitions.
[2023-03-11 12:58:42] [INFO ] Parsed PT model containing 260 places and 236 transitions and 721 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HirschbergSinclair-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 236/236 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 250 transition count 236
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 18 place count 242 transition count 228
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 242 transition count 228
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 235 transition count 221
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 235 transition count 221
Applied a total of 40 rules in 131 ms. Remains 235 /260 variables (removed 25) and now considering 221/236 (removed 15) transitions.
// Phase 1: matrix 221 rows 235 cols
[2023-03-11 12:58:42] [INFO ] Computed 14 place invariants in 35 ms
[2023-03-11 12:58:43] [INFO ] Implicit Places using invariants in 594 ms returned []
[2023-03-11 12:58:43] [INFO ] Invariant cache hit.
[2023-03-11 12:58:44] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
[2023-03-11 12:58:44] [INFO ] Invariant cache hit.
[2023-03-11 12:58:44] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/260 places, 221/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1914 ms. Remains : 235/260 places, 221/236 transitions.
Support contains 31 out of 235 places after structural reductions.
[2023-03-11 12:58:44] [INFO ] Flatten gal took : 102 ms
[2023-03-11 12:58:44] [INFO ] Flatten gal took : 45 ms
[2023-03-11 12:58:45] [INFO ] Input system was already deterministic with 221 transitions.
Support contains 30 out of 235 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 12:58:45] [INFO ] Invariant cache hit.
[2023-03-11 12:58:45] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 62 ms returned sat
[2023-03-11 12:58:46] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 12:58:46] [INFO ] After 213ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-11 12:58:46] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 221/221 transitions.
Graph (complete) has 446 edges and 235 vertex of which 225 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 106 rules applied. Total rules applied 107 place count 225 transition count 115
Reduce places removed 96 places and 0 transitions.
Graph (complete) has 224 edges and 129 vertex of which 110 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 97 rules applied. Total rules applied 204 place count 110 transition count 115
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 223 place count 110 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 224 place count 109 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 225 place count 109 transition count 95
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 226 place count 109 transition count 94
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 186 edges and 108 vertex of which 92 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 228 place count 92 transition count 94
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 244 place count 92 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 244 place count 92 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 246 place count 91 transition count 77
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 6 with 9 rules applied. Total rules applied 255 place count 82 transition count 68
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 6 with 37 rules applied. Total rules applied 292 place count 74 transition count 39
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 321 place count 45 transition count 39
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 21 Pre rules applied. Total rules applied 321 place count 45 transition count 18
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 365 place count 22 transition count 18
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 366 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 367 place count 21 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 368 place count 20 transition count 16
Applied a total of 368 rules in 66 ms. Remains 20 /235 variables (removed 215) and now considering 16/221 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 20/235 places, 16/221 transitions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 306 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Probably explored full state space saw : 39 states, properties seen :0
Probabilistic random walk after 99 steps, saw 39 distinct states, run finished after 17 ms. (steps per millisecond=5 ) properties seen :0
Explored full state space saw : 39 states, properties seen :0
Exhaustive walk after 99 steps, saw 39 distinct states, run finished after 2 ms. (steps per millisecond=49 ) properties seen :0
FORMULA HirschbergSinclair-PT-10-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 235 stabilizing places and 221 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 235 transition count 221
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 221/221 transitions.
Reduce places removed 10 places and 10 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 225 transition count 115
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 129 transition count 115
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 194 place count 127 transition count 113
Iterating global reduction 2 with 2 rules applied. Total rules applied 196 place count 127 transition count 113
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 197 place count 127 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 126 transition count 112
Applied a total of 198 rules in 32 ms. Remains 126 /235 variables (removed 109) and now considering 112/221 (removed 109) transitions.
// Phase 1: matrix 112 rows 126 cols
[2023-03-11 12:58:46] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-11 12:58:47] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-11 12:58:47] [INFO ] Invariant cache hit.
[2023-03-11 12:58:47] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2023-03-11 12:58:47] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-11 12:58:47] [INFO ] Invariant cache hit.
[2023-03-11 12:58:47] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/235 places, 112/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 795 ms. Remains : 126/235 places, 112/221 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 131 steps with 1 reset in 6 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-00 finished in 1218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 221/221 transitions.
Reduce places removed 7 places and 7 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 228 transition count 147
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 161 transition count 147
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 137 place count 158 transition count 144
Iterating global reduction 2 with 3 rules applied. Total rules applied 140 place count 158 transition count 144
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 141 place count 158 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 157 transition count 143
Applied a total of 142 rules in 43 ms. Remains 157 /235 variables (removed 78) and now considering 143/221 (removed 78) transitions.
// Phase 1: matrix 143 rows 157 cols
[2023-03-11 12:58:48] [INFO ] Computed 14 place invariants in 7 ms
[2023-03-11 12:58:48] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-11 12:58:48] [INFO ] Invariant cache hit.
[2023-03-11 12:58:48] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2023-03-11 12:58:48] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-11 12:58:48] [INFO ] Invariant cache hit.
[2023-03-11 12:58:48] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/235 places, 143/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 876 ms. Remains : 157/235 places, 143/221 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s72 1) (AND (GEQ s5 1) (GEQ s23 1) (GEQ s11 1) (GEQ s78 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 646 reset in 541 ms.
Product exploration explored 100000 steps with 646 reset in 415 ms.
Computed a total of 157 stabilizing places and 143 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 157 transition count 143
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 135 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-10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-02 finished in 2156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 221/221 transitions.
Reduce places removed 9 places and 9 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 226 transition count 126
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 140 transition count 126
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 175 place count 137 transition count 123
Iterating global reduction 2 with 3 rules applied. Total rules applied 178 place count 137 transition count 123
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 179 place count 137 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 136 transition count 122
Applied a total of 180 rules in 29 ms. Remains 136 /235 variables (removed 99) and now considering 122/221 (removed 99) transitions.
// Phase 1: matrix 122 rows 136 cols
[2023-03-11 12:58:50] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-11 12:58:50] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-11 12:58:50] [INFO ] Invariant cache hit.
[2023-03-11 12:58:50] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2023-03-11 12:58:50] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-11 12:58:50] [INFO ] Invariant cache hit.
[2023-03-11 12:58:50] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/235 places, 122/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 756 ms. Remains : 136/235 places, 122/221 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1112 reset in 521 ms.
Product exploration explored 100000 steps with 1113 reset in 443 ms.
Computed a total of 136 stabilizing places and 122 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 136 transition count 122
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-03 finished in 2118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 221/221 transitions.
Reduce places removed 9 places and 9 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 226 transition count 116
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 130 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 194 place count 128 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 196 place count 128 transition count 114
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 197 place count 128 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 127 transition count 113
Applied a total of 198 rules in 29 ms. Remains 127 /235 variables (removed 108) and now considering 113/221 (removed 108) transitions.
// Phase 1: matrix 113 rows 127 cols
[2023-03-11 12:58:52] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-11 12:58:52] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-11 12:58:52] [INFO ] Invariant cache hit.
[2023-03-11 12:58:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 12:58:52] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-11 12:58:52] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-11 12:58:52] [INFO ] Invariant cache hit.
[2023-03-11 12:58:52] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/235 places, 113/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 629 ms. Remains : 127/235 places, 113/221 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s5 1)), p1:(GEQ s19 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-04 finished in 716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((X(!p0) U p1)))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 221/221 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 232 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 232 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 230 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 230 transition count 216
Applied a total of 10 rules in 21 ms. Remains 230 /235 variables (removed 5) and now considering 216/221 (removed 5) transitions.
// Phase 1: matrix 216 rows 230 cols
[2023-03-11 12:58:53] [INFO ] Computed 14 place invariants in 9 ms
[2023-03-11 12:58:53] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-11 12:58:53] [INFO ] Invariant cache hit.
[2023-03-11 12:58:53] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2023-03-11 12:58:53] [INFO ] Invariant cache hit.
[2023-03-11 12:58:54] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/235 places, 216/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1270 ms. Remains : 230/235 places, 216/221 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (GEQ s176 1) (GEQ s147 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 577 reset in 283 ms.
Product exploration explored 100000 steps with 576 reset in 300 ms.
Computed a total of 230 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 230 transition count 216
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 (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 170 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=56 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-11 12:58:56] [INFO ] Invariant cache hit.
[2023-03-11 12:58:56] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 31 ms returned sat
[2023-03-11 12:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:58:57] [INFO ] [Real]Absence check using state equation in 1437 ms returned sat
[2023-03-11 12:58:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:58:58] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 29 ms returned sat
[2023-03-11 12:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:58:58] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2023-03-11 12:58:58] [INFO ] Computed and/alt/rep : 100/104/100 causal constraints (skipped 106 transitions) in 34 ms.
[2023-03-11 12:58:59] [INFO ] Added : 76 causal constraints over 16 iterations in 745 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 230 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 230 /230 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-11 12:58:59] [INFO ] Invariant cache hit.
[2023-03-11 12:58:59] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-11 12:58:59] [INFO ] Invariant cache hit.
[2023-03-11 12:59:00] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
[2023-03-11 12:59:00] [INFO ] Invariant cache hit.
[2023-03-11 12:59:00] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1197 ms. Remains : 230/230 places, 216/216 transitions.
Computed a total of 230 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 230 transition count 216
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 (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 178 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-11 12:59:01] [INFO ] Invariant cache hit.
[2023-03-11 12:59:02] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 30 ms returned sat
[2023-03-11 12:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:59:03] [INFO ] [Real]Absence check using state equation in 1223 ms returned sat
[2023-03-11 12:59:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:59:03] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 31 ms returned sat
[2023-03-11 12:59:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:59:04] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2023-03-11 12:59:04] [INFO ] Computed and/alt/rep : 100/104/100 causal constraints (skipped 106 transitions) in 27 ms.
[2023-03-11 12:59:05] [INFO ] Added : 76 causal constraints over 16 iterations in 704 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 578 reset in 282 ms.
Product exploration explored 100000 steps with 577 reset in 291 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 216/216 transitions.
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 230 transition count 216
Deduced a syphon composed of 94 places in 1 ms
Applied a total of 94 rules in 75 ms. Remains 230 /230 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-11 12:59:06] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2023-03-11 12:59:06] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-11 12:59:06] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/230 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 442 ms. Remains : 230/230 places, 216/216 transitions.
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 216/216 transitions.
Applied a total of 0 rules in 12 ms. Remains 230 /230 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 230 cols
[2023-03-11 12:59:06] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-11 12:59:06] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-11 12:59:06] [INFO ] Invariant cache hit.
[2023-03-11 12:59:07] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
[2023-03-11 12:59:07] [INFO ] Invariant cache hit.
[2023-03-11 12:59:07] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1249 ms. Remains : 230/230 places, 216/216 transitions.
Treatment of property HirschbergSinclair-PT-10-LTLFireability-06 finished in 14997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 221/221 transitions.
Reduce places removed 10 places and 10 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 225 transition count 115
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 129 transition count 115
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 195 place count 126 transition count 112
Iterating global reduction 2 with 3 rules applied. Total rules applied 198 place count 126 transition count 112
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 199 place count 126 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 200 place count 125 transition count 111
Applied a total of 200 rules in 30 ms. Remains 125 /235 variables (removed 110) and now considering 111/221 (removed 110) transitions.
// Phase 1: matrix 111 rows 125 cols
[2023-03-11 12:59:08] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-11 12:59:08] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-11 12:59:08] [INFO ] Invariant cache hit.
[2023-03-11 12:59:08] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2023-03-11 12:59:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 12:59:08] [INFO ] Invariant cache hit.
[2023-03-11 12:59:08] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/235 places, 111/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 718 ms. Remains : 125/235 places, 111/221 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s107 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 1053 reset in 217 ms.
Product exploration explored 100000 steps with 1053 reset in 212 ms.
Computed a total of 125 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 125 transition count 111
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 192 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 49 ms :[(NOT p0)]
Finished random walk after 98 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=32 )
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 253 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-11 12:59:09] [INFO ] Invariant cache hit.
[2023-03-11 12:59:10] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 18 ms returned sat
[2023-03-11 12:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:59:10] [INFO ] [Real]Absence check using state equation in 71 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-10-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-07 finished in 2291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 221/221 transitions.
Reduce places removed 7 places and 7 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 228 transition count 148
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 162 transition count 148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 135 place count 159 transition count 145
Iterating global reduction 2 with 3 rules applied. Total rules applied 138 place count 159 transition count 145
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 139 place count 159 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 158 transition count 144
Applied a total of 140 rules in 33 ms. Remains 158 /235 variables (removed 77) and now considering 144/221 (removed 77) transitions.
// Phase 1: matrix 144 rows 158 cols
[2023-03-11 12:59:10] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-11 12:59:10] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-11 12:59:10] [INFO ] Invariant cache hit.
[2023-03-11 12:59:10] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2023-03-11 12:59:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 12:59:10] [INFO ] Invariant cache hit.
[2023-03-11 12:59:11] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/235 places, 144/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 895 ms. Remains : 158/235 places, 144/221 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s71 1)), p0:(OR (LT s11 1) (LT s65 1) (AND (GEQ s1 1) (GEQ s53 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 953 reset in 509 ms.
Product exploration explored 100000 steps with 962 reset in 409 ms.
Computed a total of 158 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 158 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 181 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-10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-08 finished in 2186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1||F(p2))&&p0))))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 221/221 transitions.
Reduce places removed 8 places and 8 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 227 transition count 138
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 152 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 152 place count 150 transition count 136
Iterating global reduction 2 with 2 rules applied. Total rules applied 154 place count 150 transition count 136
Applied a total of 154 rules in 16 ms. Remains 150 /235 variables (removed 85) and now considering 136/221 (removed 85) transitions.
// Phase 1: matrix 136 rows 150 cols
[2023-03-11 12:59:12] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-11 12:59:12] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-11 12:59:12] [INFO ] Invariant cache hit.
[2023-03-11 12:59:13] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2023-03-11 12:59:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 12:59:13] [INFO ] Invariant cache hit.
[2023-03-11 12:59:13] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/235 places, 136/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 833 ms. Remains : 150/235 places, 136/221 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s139 1)), p1:(AND (GEQ s8 1) (GEQ s135 1)), p2:(AND (GEQ s11 1) (GEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 142 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-12 finished in 1008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||F(G(!p0)))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 221/221 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 232 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 232 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 230 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 230 transition count 216
Applied a total of 10 rules in 26 ms. Remains 230 /235 variables (removed 5) and now considering 216/221 (removed 5) transitions.
// Phase 1: matrix 216 rows 230 cols
[2023-03-11 12:59:13] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-11 12:59:13] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-11 12:59:13] [INFO ] Invariant cache hit.
[2023-03-11 12:59:14] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
[2023-03-11 12:59:14] [INFO ] Invariant cache hit.
[2023-03-11 12:59:14] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/235 places, 216/221 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1253 ms. Remains : 230/235 places, 216/221 transitions.
Stuttering acceptance computed with spot in 204 ms :[false, p0, (AND p0 (NOT p1)), false]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(LT s143 1), p1:(LT s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 473 ms.
Product exploration explored 100000 steps with 50000 reset in 491 ms.
Computed a total of 230 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 230 transition count 216
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 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 121 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-14 finished in 2663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((X(!p0) U p1)))))'
Found a Shortening insensitive property : HirschbergSinclair-PT-10-LTLFireability-06
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 235/235 places, 221/221 transitions.
Reduce places removed 9 places and 9 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 226 transition count 127
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 141 transition count 127
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 173 place count 138 transition count 124
Iterating global reduction 2 with 3 rules applied. Total rules applied 176 place count 138 transition count 124
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 177 place count 138 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 178 place count 137 transition count 123
Applied a total of 178 rules in 16 ms. Remains 137 /235 variables (removed 98) and now considering 123/221 (removed 98) transitions.
// Phase 1: matrix 123 rows 137 cols
[2023-03-11 12:59:16] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-11 12:59:16] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-11 12:59:16] [INFO ] Invariant cache hit.
[2023-03-11 12:59:16] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2023-03-11 12:59:16] [INFO ] Invariant cache hit.
[2023-03-11 12:59:17] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 137/235 places, 123/221 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 724 ms. Remains : 137/235 places, 123/221 transitions.
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (GEQ s101 1) (GEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1082 reset in 239 ms.
Product exploration explored 100000 steps with 1083 reset in 273 ms.
Computed a total of 137 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 137 transition count 123
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 (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 94 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=94 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-11 12:59:18] [INFO ] Invariant cache hit.
[2023-03-11 12:59:18] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 20 ms returned sat
[2023-03-11 12:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:59:19] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2023-03-11 12:59:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:59:19] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 23 ms returned sat
[2023-03-11 12:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:59:19] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2023-03-11 12:59:19] [INFO ] Computed and/alt/rep : 96/102/96 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-11 12:59:19] [INFO ] Added : 64 causal constraints over 13 iterations in 317 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 137 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 123/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2023-03-11 12:59:19] [INFO ] Invariant cache hit.
[2023-03-11 12:59:19] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-11 12:59:19] [INFO ] Invariant cache hit.
[2023-03-11 12:59:20] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2023-03-11 12:59:20] [INFO ] Invariant cache hit.
[2023-03-11 12:59:20] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 727 ms. Remains : 137/137 places, 123/123 transitions.
Computed a total of 137 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 137 transition count 123
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 (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 97 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-11 12:59:21] [INFO ] Invariant cache hit.
[2023-03-11 12:59:21] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 21 ms returned sat
[2023-03-11 12:59:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:59:21] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2023-03-11 12:59:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:59:22] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 24 ms returned sat
[2023-03-11 12:59:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:59:22] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-03-11 12:59:22] [INFO ] Computed and/alt/rep : 96/102/96 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-11 12:59:22] [INFO ] Added : 64 causal constraints over 13 iterations in 327 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1082 reset in 238 ms.
Product exploration explored 100000 steps with 1082 reset in 275 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 123/123 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 137 transition count 123
Deduced a syphon composed of 10 places in 1 ms
Applied a total of 10 rules in 11 ms. Remains 137 /137 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2023-03-11 12:59:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 123 rows 137 cols
[2023-03-11 12:59:23] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-11 12:59:23] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/137 places, 123/123 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 137/137 places, 123/123 transitions.
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 137 cols
[2023-03-11 12:59:23] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-11 12:59:24] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-11 12:59:24] [INFO ] Invariant cache hit.
[2023-03-11 12:59:24] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2023-03-11 12:59:24] [INFO ] Invariant cache hit.
[2023-03-11 12:59:24] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 792 ms. Remains : 137/137 places, 123/123 transitions.
Treatment of property HirschbergSinclair-PT-10-LTLFireability-06 finished in 8481 ms.
[2023-03-11 12:59:24] [INFO ] Flatten gal took : 30 ms
[2023-03-11 12:59:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-11 12:59:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 235 places, 221 transitions and 665 arcs took 5 ms.
Total runtime 42708 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HirschbergSinclair-PT-10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1678539611273

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 HirschbergSinclair-PT-10-LTLFireability-06
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 5/32 HirschbergSinclair-PT-10-LTLFireability-06 583599 m, 116719 m/sec, 1907386 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 9/32 HirschbergSinclair-PT-10-LTLFireability-06 1145889 m, 112458 m/sec, 3794272 t fired, .

Time elapsed: 10 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 13/32 HirschbergSinclair-PT-10-LTLFireability-06 1713056 m, 113433 m/sec, 5865642 t fired, .

Time elapsed: 15 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 17/32 HirschbergSinclair-PT-10-LTLFireability-06 2246305 m, 106649 m/sec, 7923108 t fired, .

Time elapsed: 20 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 21/32 HirschbergSinclair-PT-10-LTLFireability-06 2748253 m, 100389 m/sec, 9885894 t fired, .

Time elapsed: 25 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 24/32 HirschbergSinclair-PT-10-LTLFireability-06 3245202 m, 99389 m/sec, 11766498 t fired, .

Time elapsed: 30 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 28/32 HirschbergSinclair-PT-10-LTLFireability-06 3739044 m, 98768 m/sec, 13659173 t fired, .

Time elapsed: 35 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-10-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 31/32 HirschbergSinclair-PT-10-LTLFireability-06 4198925 m, 91976 m/sec, 15489035 t fired, .

Time elapsed: 40 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for HirschbergSinclair-PT-10-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-10-LTLFireability-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HirschbergSinclair-PT-10-LTLFireability-06: LTL unknown AGGR


Time elapsed: 45 secs. Pages in use: 32

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-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is HirschbergSinclair-PT-10, 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 r199-smll-167840346000436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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