{"_id": "H7cDhA4kzdWrZZWfM", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in ^(Event.(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XH2b63yvFSxG9tfRF", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 23:48:15"}
{"_id": "BKi8JwncT7RyH5Fxm", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tState in Event.(State<:trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8xDTksmaGXkqpB4e8", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:13:22"}
{"_id": "ZdQKrWoruv2s4GueS", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  some s: State | s in s.^trans.State.Event = Init\n}", "derivationOf": "Ebwc9BsdRQwPnGx4r", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:59:30"}
{"_id": "bdripsgPjmbjQLGLe", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init | State in (*(x.trans)).Event\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EemnNxBe7yZ5fJgXR", "msg": "The value of this expression does not contribute to the value of the parent.\nParent's relevant type = {this/State->this/Event}\nThis expression's type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:24:32"}
{"_id": "cS3uGzAWAEXK2udxd", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init <: trans | State in n.^(trans.Event)\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "The name \"n\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:45:44"}
{"_id": "WSQNzmg5gomBLuZnh", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rg7D7JtCmF9TgTFWA", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:23:05"}
{"_id": "tfEdm7frEynmtTQ92", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | Event->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event->State in s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "oGiMTtdoLkcmX6vTR", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 00:17:39"}
{"_id": "EEX95gsswKYcziwk9", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4kj8CxN8bB9JtQYd5", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-18 22:16:07"}
{"_id": "H5Hu9xEoY4aWzkaEX", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "dGsFy6iNyzgHkjo3x", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:22:06"}
{"_id": "XLzqLahv5HjNqxi53", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e.(State.trans)\n  \n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall r : (Init.^function) | some Init & r.^function\n}", "derivationOf": "7upTcADLPeH5PHSt8", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 23:25:36"}
{"_id": "HvoET4qZxyr2rRGKT", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans in State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "MdEP9F6EP8dTb3MYT", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:17:05"}
{"_id": "eRkvw4cN7sCtBaJ63", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2vtRuXBKd6RQhAhPX", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 09:03:23"}
{"_id": "gt5BvqcXQAPxATqYM", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\nfun onlyStates : set (State->State) {\n\t{ s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \t(no trans) or\n\t(all s : State | Init in s.^onlyStates)\n}", "derivationOf": "j9CxuCze8JCaJKHTk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 01:12:38"}
{"_id": "e5K7DuACRF7SMfGr2", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet adj = { s1, s2 : State | some e : Event | s1->e->s2 in trans} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some (trans.State).e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3EhSiTsJCzYsKgEgu", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-3 11:18:10"}
{"_id": "A3wJsQahA2jqaj4ia", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some t:trans | t in s\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "o2mrzcbSMfAssgpww", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:22:33"}
{"_id": "4qtz5qqAtgJT9qsex", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tno s:State | no s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init \n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XLuRGxEaDJYf9HHAA", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 15:41:39"}
{"_id": "y5fiMo4aB9Q4iPY6G", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event |all s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8f9WknKz8uZQYSaCe", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-9 14:20:46"}
{"_id": "CcSeH4dR3weQQZ2Nt", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone trans.State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZdgQpf7pK47qFGn6Q", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-15 16:03:46"}
{"_id": "JFqrnYZBRs2Sxnm6x", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (~(s.trans) <: e)  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TXm5TaS8aJdZT5yrv", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:14:39"}
{"_id": "2KL5MpfP3bY2xAEDE", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, s1:State, e:Event | lone e->s1\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "uwTgpi6gTj5eTkM7m", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 11:59:39"}
{"_id": "3XmB8y8DtTF6hTMrg", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | Init in (^trans.State.Event)\n}", "derivationOf": "4gDpNWNbhpmDe9oFB", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 01:20:20"}
{"_id": "NXvZvAqTnqZKza3FA", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SjaSLHgnjFsaFFiEF", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": []}, "nodePositions": {"State": {"x": 400.53125, "y": 199.1999969482422}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2019-10-17 18:54:28"}
{"_id": "xsyap4w7LmghmodZk", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tall s: State - Init | s in Init.*rel\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ikkc9r8vgeRHPFSww", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-9-12 10:01:38"}
{"_id": "xP3tkMuc9EoZWaQp9", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(Init.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BP9SfQfSsuLkBhcPC", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-30 19:25:52"}
{"_id": "8uTw54mmMHWM6qj3L", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tno s:State | no s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 15:38:27"}
{"_id": "Ahz7CZtJNR5Gg5isY", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    all i : Init | i.(^{s1, s2 : State | s1->Event->s2 in trans}) = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "Q3yvKYynSC5Pa5WzF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:38:58"}
{"_id": "Lqq32z3S3XK3mevd3", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:(State-Init) | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | State.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "y58Zuaf5qna7WdP7K", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:54:50"}
{"_id": "H3Yijp3hSbsruB2zx", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event<:(trans.x) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sAtqwXxCf9LqzySH3", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {none->none}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:51:17"}
{"_id": "PqRY2iJt96Tfzudjv", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\nno Init  implies no State and  all i :Init|some e:Event |  e.(i.trans) & State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hKRu6ibzwkhMyhqPh", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 14:05:01"}
{"_id": "Aq3jPgHvYdTDFL4Nv", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: State | Init in ^{x, y: State | some (x.trans).y}.s\n}", "derivationOf": "5rJyt6LqTmXfx4Afg", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 20:17:28"}
{"_id": "quLhjGc8GGuSEj28P", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | all e: Event | Init.trans.e\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qZ8HgnXgKXoG4atsi", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:23:19"}
{"_id": "ydxqD4us37ftGxQdn", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  trans.State.Event = State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "uuYT2nMxwqYf98PnH", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:14:18"}
{"_id": "WQksmWvLGAkFHPzBz", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in ^Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cZhaTNKibfBWNGc2c", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:42:47"}
{"_id": "6oxrcRXjq3D5DcPdB", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n\tlet adj =  {x,y:State | some e:Event | x->e->y in trans}\n}\n\n/*\nAll the states have the same events available.\n*/ \npred inv5 {\n\tall disj s1,s2 :State |  no ((s1.trans).State) -((s2.trans).State) and no ((s2.trans).State) - ((s1.trans).State)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "cxa3nv7B6eDeE4bTf", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:02:14"}
{"_id": "tKncxcKa5mJM4EoHW", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone i:Init | i not in Event.(State.trans)\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ukbYddWzhNiwNjok7", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:26:33"}
{"_id": "rXLpMQR3Q7mvNG9kD", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-25 16:58:09"}
{"_id": "fZev9vpP4wfb3GfFv", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t State.(State.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WQgtkbAWuKdRoqaP9", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:33:55"}
{"_id": "WPcqFMymuRLTg5kKR", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:event, s:State | lone e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aD6ZRrh76uyKjJuYG", "msg": "The name \"event\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 18:34:40"}
{"_id": "nHYYsd5nJqmmnZJJv", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, s1:State,e:Event, t:trans | s->e in s.trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mvJpnAc9BbCRyXoQR", "msg": "Analysis cannot be performed since it requires higher-order quantification that could not be skolemized.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 12:18:30"}
{"_id": "4EBBsis4qm8vsGbyw", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tall s:State | s :>(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EfMQdhLkJnhCFxJ8z", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 19:34:41"}
{"_id": "zbZYccTwvtDnzusTo", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tone Event.(State.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "dNajspiskQyEBJELQ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:21:30"}
{"_id": "RPBz3BoQNFMWRD955", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n   all i:Init | some e:Event | some  Init implies no  (State  - (e.*(i.trans) ))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3rFkAtFig2nyKZwwc", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 17:56:27"}
{"_id": "P6Qfc8ZwYF5suq6Cp", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\ttrans.State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "33qkKpn4KiBewkGHy", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:40:46"}
{"_id": "8CG9j5ZMvmKbq4Pq9", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "piDuP2FMkhNZSNG7z", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 17:43:11"}
{"_id": "ciYK2NRjQGhrbjWfL", "cmd_c": true, "cmd_i": 7, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n trans.State.Event = State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n\n   all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n\nState in Event.(*(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  \n \n all x : State | x.trans in State.trans\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n\nEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n\nsome (Event.(State.trans))\n\n}\n\nrun {} for 3", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-6-10 10:29:14"}
{"_id": "nK3YKDeFfyywLqjHD", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 14:10:29"}
{"_id": "MdEP9F6EP8dTb3MYT", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans = State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "3e4r4zYQc8wnB2Lwn", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:16:52"}
{"_id": "BdnS2XcGfQiwcfsAh", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  lone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | some e : Event | lone (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s : State | (s.trans) = Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "evJogm97dYiRtPvrZ", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:13:44"}
{"_id": "wJFTb3Znh63WRRZza", "cmd_i": 2, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all e : Event | State in trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:10:38"}
{"_id": "W5HLrCTWgasZtCeQY", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x->Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall x : State | some State->Event->x implies some Init.~(State->Event->x)\n}", "derivationOf": "2RTi7FGEWW8PdKnum", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 14:07:13"}
{"_id": "MbSGyLXhzqMdrHKRi", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yAi8TNm8kavcKs5ct", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 09:32:16"}
{"_id": "ACWvQnbM5DZbd8eF6", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event.(trans<:x) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5sga5ZkKpLaAei8hz", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:51:36"}
{"_id": "o6rcyg5spyfx4PigY", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | some Event.(s<:trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "v7Etx632DLGyoQCQS", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:06:04"}
{"_id": "7ogDPFmFHjx62CAHa", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {all s : State | lone s.~trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GCxqEPWJ9X2Q3CJsG", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 21:13:20"}
{"_id": "WRMQMhXahWn6nZ2PY", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    State = trans.Event.State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fdc4iJzeoP23PhvPu", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 00:48:32"}
{"_id": "G2Zpfwi5xRhtpMJN5", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | i->s in ^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | e->s in State.trans \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "Cgnk6C76ndcvgypXu", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-14 00:16:48"}
{"_id": "nQFXeHG2HfbHbaCXk", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans} |\n  all u : State | one e : Init | e in u.(^t)\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "eQAwctCpwT8EX9soi", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:46:49"}
{"_id": "LHLZupnSjrmKMCBTg", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | e->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some trans.e in State.trans \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "ZChiSvSxCt6aWmsXB", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:42:28"}
{"_id": "aHezTMbRanjcknPMP", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some e:Event | s in e.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qeaP365mJcspgMi8d", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-13 00:06:51"}
{"_id": "yjaukujkj3ioyciig", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  all x : State, y : Init, z : Event | (trans in y one -> one z one -> one x) and x != y\n}", "derivationOf": "w78Y79i6KkyRBwutG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:44:06"}
{"_id": "ioWkqnmnEnZjcoDm5", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s: State | all e: Event | one Init.^trans implies s->e->s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iaLrzAf7FxqoDZeiN", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 18:42:33"}
{"_id": "HtB3PSrCuEsmSWqSC", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event.(x.trans) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DgedwD4vkxjGPXf6h", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:48:47"}
{"_id": "WzGafXbE38HpaeZFN", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | all e:Event |  e<:s.trans \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e<:State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QWZBgkue7Av5bBamC", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 20:05:32"}
{"_id": "nYcFosuXvYTF99Qah", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JvDEmKP27zQmdajvs", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-9 13:53:00"}
{"_id": "3Svci5H73u9EfKuzy", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qTpDmrtgFPN3kkssi", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-8 15:47:43"}
{"_id": "7ggaso3q5qAkijYMb", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State |one e: Event | lone s.trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BwxMtTRukco5TYakd", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 20:43:37"}
{"_id": "gaRg6QhDbRRGymsF6", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ghLGGLtJDJdEXAjH8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:27:45"}
{"_id": "pvFCnz9CaF7LvHuBa", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EiKfw3X8Dsek8RK7D", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 17:00:40"}
{"_id": "N8jXZbHMj63BXm9Tk", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some State->e in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wPjFTDZr666njJHi3", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 21:10:08"}
{"_id": "YM8hM9oY4CXb8zGEv", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet t = trans | iden in (trans.trans) <: State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xYKAQYMuEauR5LmG4", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:33:48"}
{"_id": "yR7pHegKEYaqTrdyz", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n trans.State.Event = State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n\n   all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n\nState in Event.(*(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  \n \n all x : State | x.trans in State.trans\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n\nEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n\nsome (Event.(State.trans))\n\n}\n\nrun {} for 3", "derivationOf": "kyvBTwuXEd5ni3cJW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-6-10 10:29:54"}
{"_id": "TuDYLJYNFg2sCYRWs", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pYsxTtMSRBmTrpRH2", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-19 15:40:26"}
{"_id": "SW3juxYXQ4xS8emar", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n \t\t\t\t\t\t\n   \tall s:State-Init |some e:Event |  no (e.s.trans & State )\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n  \n  \n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "gceogwm44cPrCkEpM", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 11:31:54"}
{"_id": "YkMXk74WdaBmBZsGy", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone ((s.trans) <: e) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LKSXNYorrnkqw4Cem", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:13:45"}
{"_id": "4n6aq9bn7hEbRz8TX", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tState in Init <: ^trans[Event]\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "49QD5Bwe6SGykwJwS", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-9-12 09:57:39"}
{"_id": "RAiMDqxFkyWGXwKkw", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans} |\n  all u : State | some Init in u.^t\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yrweq5Y6WAWduoH7S", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:46:04"}
{"_id": "dTn3Hggqe5B9QM4tm", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: State.trans.Event | s in s.^{y,x: State | some x.trans.y}\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 08:39:09"}
{"_id": "zwT4pTafvhxNHyzRc", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, all e:Event | lone s->e->State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "HQucKBXpJfuAzx3dA", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 21:00:22"}
{"_id": "5uh4d8psYokqvhSPF", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState.^trans in State \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\nD\u00favidas\ninv1\ninv3\n", "derivationOf": "seqtTySQNuX2zwXpT", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-19 15:46:23"}
{"_id": "78A7Zekpm2ooRJdjf", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2: State | some e: Event | s1->e->s2 in trans } \n}\n\n\npred inv4 {\n  \t\tall s: State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\nfun getEventsOfState[s1: State] : Event {\n  \t{ e: Event | some s2: State | s1->e->s2 in trans }\n}\n\npred inv5 {\n\tall s1, s2: State | getEventsOfState[s1] = getEventsOfState[s2]\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e: Event | some s: State | e in getEventsOfState[s]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\n\npred isReachableFromState[s: State, i: State] {\n  \ts in i.*onlyStates\n}\n\npred inv7 {\n\tall s : State | some i1,i2: Init | s.isReachableFromState[i1] implies i2.isReachableFromState[s]\n}", "derivationOf": "iETmfwHrrquQccsxL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 16:25:46"}
{"_id": "ZXRwzwi7J4peuiPz8", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some State.~trans.e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "DAbaXwpJYtYK2WtJT", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:47:28"}
{"_id": "SYBBmboM9dWep7Tp2", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit^.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EQEZ8qBe5cBPSmcta", "msg": "There are 25 possible tokens that can appear here:\n( * @ Int NAME NUMBER STRING String Time ^ all fun iden let lone no none one seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 18:39:59"}
{"_id": "b6RcrNCxgEck8Mk3w", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xP3tkMuc9EoZWaQp9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-30 19:27:42"}
{"_id": "4KqGymSs5W7pc9ykd", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet t = trans | iden in (trans.trans <: Event)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yztALbER8rrmuxF9F", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:33:14"}
{"_id": "uKXZk8tarQGbge2nN", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "Tza4pW6Cwnu8pfY7J", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:50:13"}
{"_id": "iJxQ9htQDJ3j3kJYD", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one s : State | no trans.s\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iyw9wX7dumrLZEAbj", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-8 15:45:23"}
{"_id": "sh2WCSTHRAbn9dgxX", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState-Init in Event.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "eNjpLY8k2HhsS6aYK", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-13 00:13:58"}
{"_id": "Fvq4n3r9zghJ6MWCo", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tsome s : State | Event in s.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YyiAqXjTD2J3AGHkv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-11 00:23:05"}
{"_id": "nMDAqfWwvZKSoYLag", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | Init.trans in trans implies ~trans.e->s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "G7cZxgGnQvgxCzehK", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:26:30"}
{"_id": "C7rwP3kHwGJwCBkC9", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans = State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "QQuMxy7WcLwLczsjk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:16:05"}
{"_id": "TMYXCN9hMHDvKKEp3", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 13:14:49"}
{"_id": "XTqfi7cubkBCW6adC", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one s : State | no trans.s\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LTRMkE4ZcSHRtHbtr", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 15:44:37"}
{"_id": "8KZDGfJXoAPXC9HBW", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init in ~(^trans_bin).State\n}", "derivationOf": "GCMfJuohdsteMhgxx", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-24 09:22:45"}
{"_id": "RhbG2cMyLRSdGTvpm", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet adj = { s1, s2 : State | some e : Event | s1->e->s2 in trans} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some (trans.State).e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6zSjBGu7joGpDDmdq", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-3 11:18:26"}
{"_id": "LyJoxxwMdZFmMFr2C", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\ttrans.~trans in iden\n}", "derivationOf": "xzjC5yaxpSk2MPqMD", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 14:18:14"}
{"_id": "GrBjYYqZR685mN5i5", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tsome Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "D9wX8xrtjhnC3kkEd", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:21:31"}
{"_id": "qeZrRgmTJEpWa5jLY", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YyFJZgRYbgcHYQqrB", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 09:58:54"}
{"_id": "Ze7HHabT7ML4WGbjA", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cnqpxcfYczWt8Qau7", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-9 02:26:05"}
{"_id": "mFT2dgNWqpBfxtEnc", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | all e: Event | Init.trans in trans implies e->s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ycfgRit8w3XrHK58u", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:28:07"}
{"_id": "MFvEmbqbZY9roMDC6", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n  all s : State | one s.Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6SCXJ5geAENdNehTa", "msg": "This cannot be a legal relational join where\nleft hand side is s (type = {this/State})\nright hand side is this/Init (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 09:39:03"}
{"_id": "9m9MtnBjT2X5BFtaJ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    all i : Init | i.*{s1, s2 : State | s1->Event->s2 in trans} = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "WZRtQCr5Np75coRff", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:35:51"}
{"_id": "XCTSkY5Ky6xd25m9R", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qQrBfc8bgn8hFhcN4", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-7 20:54:59"}
{"_id": "NSof4TdzmDDvZYvup", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s:State | State in s.^trans\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KEzSfqwERRy8HFDCs", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 19:08:08"}
{"_id": "RHThJFizX2Wbz8btE", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-9-12 09:47:42"}
{"_id": "xXiweYJyaX9J6FJtT", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State, e: Event | lone e.(s.trans)\n  \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\npred inv4 { all s : State | some i: Init | s in i.^adj \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r:State | (s.trans).State = (r.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { \nall e: Event | some s: State| e in (s.trans).State \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { all s: Init.^adj | some s.^adj & Init\n\n}", "derivationOf": "rz24azpKBBbeZDmcD", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-18 12:18:18"}
{"_id": "nMW6aSfjNWYKQCKq4", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-4 16:40:21"}
{"_id": "RBHm4GzvpRwN2FM8B", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | i->s in ^(trans.s) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "ptpWyLSRS5J3esaK8", "msg": "^ (this/State <: trans) . s is redundant since its domain and range are disjoint: {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-14 00:21:18"}
{"_id": "JvwMnCT28ERcGzrxq", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\nall s,s1:State,e:Event|some s2,s3:State | s->e->s2 in trans implies s1->e->s3 in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ERvgXZ2GTThxtTnQS", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:35:57"}
{"_id": "t67TwGBaQSRJdDH3e", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, s1:State,e:Event, t:trans | s->e in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZStbv6gvCsnMGYs5v", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 12:17:44"}
{"_id": "Jk4P2gf3Fu3sH9TBu", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    iden in *trans_bin . ^trans_bin\n}", "derivationOf": "BhicdhRDZAXMbiGe9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:48:23"}
{"_id": "8dHtTj4ZX8adp7L7K", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s:State | (s.trans)->Event\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vTTYnLcbHEbZFKopY", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:10:16"}
{"_id": "RhTq6H8dzDcST5ejJ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3qiHycAoAG5Q72a6q", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-12 20:53:29"}
{"_id": "F6E9HjMq36ae9xn34", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n  all x : Event | (trans.x) in State one -> one Init \n}", "derivationOf": "dnN5g2Yyw83vHrdQF", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:11:06"}
{"_id": "LDCyJpz9fDMFh3miT", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = State.trans | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "g8MJun74aqeyJoq9f", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 13:42:54"}
{"_id": "utsJ94DRXTFBokQiR", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  ~trans.trans in id \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "d4aBK5xS68KCmmuEm", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:36:13"}
{"_id": "6upMQnkPWKZHhBWZG", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s: State.trans.Event | s.^{y,x: State | some e : Event | x->e->y in trans} = Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mqQuos5H6GQBSv375", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:10:03"}
{"_id": "yAi8TNm8kavcKs5ct", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aCipkR9izCF8wa25o", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/State->this/Event}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 09:32:02"}
{"_id": "7h3uG5h2GhCRDb6sZ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some s.(Init<:trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CsdGmDof4xrDzDave", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:11:07"}
{"_id": "BxrTPrfkWXYkC7dss", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 11:08:55"}
{"_id": "XCSc8Tu5XdepdvWxk", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | s in Init.^(trans.State)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "Sx4jX3NL34KQL3Nro", "msg": "^ (this/State <: trans) . this/State is redundant since its domain and range are disjoint: {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 03:43:48"}
{"_id": "ciCDEvZqxvR9sm8Dg", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s1, s2:State, e:Event | lone s1->e->s2 in trans \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nJd9n4QPgQqrSFLbc", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-21 18:45:42"}
{"_id": "eNjpLY8k2HhsS6aYK", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState-Init in Event.(^Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zKcqSyrkGnRb22aer", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-13 00:13:35"}
{"_id": "kiYfP7XuKctM342RD", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans} |\n  State in Init.(^t)\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "swd5SSJqTrvzFKaxZ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:55:15"}
{"_id": "ptpWyLSRS5J3esaK8", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | i->s in ^(trans.s) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | e->s in State.trans \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "v2atha5YJjTgkbWjE", "msg": "^ (this/State <: trans) . s is redundant since its domain and range are disjoint: {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-14 00:18:53"}
{"_id": "jguqy8aYxeMuu3ukp", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PhNv4SvDb8tsfNS5o", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-10 21:00:36"}
{"_id": "EiBXAr6CHBDigRRre", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "S8cAeJSKuAM6pTapQ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 14:24:13"}
{"_id": "EcHNqzTwjRHPEHGEC", "cmd_c": false, "cmd_i": 0, "cmd_n": "run$1", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\nrun {}", "derivationOf": "oSc4BAAP3M9wRksmg", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-11 01:18:52"}
{"_id": "9imN6Epr87R4Dk66y", "cmd_c": true, "cmd_i": 0, "cmd_n": "bla", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2: State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s: State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\nfun getEventsOfState[s1: State] : Event {\n  \t{ e: Event | some s2: State | s1->e->s2 in trans }\n}\n\npred inv5 {\n\tall s1, s2: State | getEventsOfState[s1] = getEventsOfState[s2]\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e: Event | some s: State | e in getEventsOfState[s]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\n\npred isReachableFromState[s: State, i: State] {\n  \ts in i.*onlyStates\n}\n\npred inv7 {\n\tall s : State | some i: Init | s.isReachableFromState[i] implies i.isReachableFromState[s]\n}\n\nassert bla {\n  \tall i: Init | i.isReachableFromState[i]\n}\n\ncheck bla", "derivationOf": "XjDhSmpkDGKpbdHRs", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-2 18:20:15"}
{"_id": "qYsJ23Bn9fHLBNMv2", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | s1->Event->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i : Init, s : State | s in i.*tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TzXKYAJNZBeJ3gPqp", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 15:54:45"}
{"_id": "ke83Xh5eqatqFb4d7", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tall s: State | s in Init.^rel\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xsyap4w7LmghmodZk", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-9-12 10:01:46"}
{"_id": "sXSsEWakyQ7HW5Cxa", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (s->e).trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "z6juYfxKACjeX5E57", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-11 00:09:38"}
{"_id": "LQcoNFGKmwTJr88ja", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y, z : State | some e : Event | x->y in trans implies y->x in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:40:15"}
{"_id": "22f94SL8WHbaSfwPN", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n  \tState in t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tall s : State | Init in s.~t\n}", "derivationOf": "NYw4usFu84bbzzbtQ", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:33:58"}
{"_id": "YuHiJmMgmB9jPqHGT", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | State.trans = x.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "jxotuLphtasz3iZrC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:16:49"}
{"_id": "5BNJ28GLySGWuexyX", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s1, s2 : State | lone (s1.trans.s2)  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Cz49Skes28BXE6Ddi", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 03:50:41"}
{"_id": "ceeECS3b9haYpaoam", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tt5Pn7zMusbAHMMHx", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:26:35"}
{"_id": "B6AvgmPZh7TwWuYW8", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s:State | State in s.^trans.Event\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NSof4TdzmDDvZYvup", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 19:08:19"}
{"_id": "vQzKK4c9KJteYoa8v", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | all e:Event |  some e<:s.trans \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e<:State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WzGafXbE38HpaeZFN", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 20:06:03"}
{"_id": "geoQP7b8ymvZZ6nTc", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aiwqTR2LkybPzpP7e", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:31:54"}
{"_id": "FSfAvpvJeSpQWY9Hm", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "yipoF8A5hakDHp9Pp", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:18:14"}
{"_id": "29nutK3twvBabXKzc", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { Init.Event\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ja4ikmA4ph7nE8iGB", "msg": "This cannot be a legal relational join where\nleft hand side is this/Init (type = {this/State})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:16:25"}
{"_id": "6mqpx9XzYGrBrLEDB", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sXSsEWakyQ7HW5Cxa", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-11 00:13:12"}
{"_id": "E6z8epDdFFboKyngo", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n  \t\tsucc : set State\n}\nsig Init in State {}\nsig Event {}\n\npred x {\n\tall s1,s2:Event | s1->s2 in succ iff some y:Event | s1->y->s2 in trans\n}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some i:Init | s in i.^succ\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "There are 1 possible tokens that can appear here:\n}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-8 16:04:35"}
{"_id": "vJXyiJ9zHKrCLPoW3", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | Event in s.(State->Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "huTWNteGpEeuKt7Md", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-24 11:14:04"}
{"_id": "w78Y79i6KkyRBwutG", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  all x : State, y : Init, z : Event | trans in y one -> one z one -> one x and x != y\n}", "derivationOf": "boai9cvQMzX3jyWyR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:41:20"}
{"_id": "LNLB9WouvGLJgtL5q", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  State in Event.(*(Init.trans)) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "fhFHdtACNKJJbSdxT", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:33:30"}
{"_id": "YXkan9Xg4NFQFf4nc", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | i->s in trans.trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "5KXWQJx2tMuTXxLv4", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/State}\nRight type = {this/State->this/Event->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-14 00:47:19"}
{"_id": "RrGrhtBdp5rHxb8en", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone s:State | s in Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "g3X8nQDtmTaXhnbia", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-8 00:23:02"}
{"_id": "LKSXNYorrnkqw4Cem", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "u24cNJia8n8s7Aqf8", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 09:13:21"}
{"_id": "gvB2Du37xSP4HCnQW", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  lone State\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5MfhKu9rifcPbmXKt", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 01:38:56"}
{"_id": "Zf5re76h7pgsaCuYz", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2: State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s: State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\nfun getEventsOfState[s1: State] : Event {\n  \t{ e: Event | some s2: State | s1->e->s2 in trans }\n}\n\npred inv5 {\n\tall s1, s2: State | getEventsOfState[s1] = getEventsOfState[s2]\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e: Event, some s: State | e in getEventsOfState[s]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SaK62FbANpS3fFtpj", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-2 18:13:29"}
{"_id": "gtxGC8NpW9iCnWmQs", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DgwYWaYw735etqzCr", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 20:09:33"}
{"_id": "MjpkHHWY4KnvXHAKv", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State, i : Init | (s in i.(^onlyStates)) implies (i in s.(^onlyStates))\n}", "derivationOf": "mvopyqSzF56RxoRKQ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:31:35"}
{"_id": "DWrJ5GjX5GajKPK6R", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s,p:State | s.trans in Event & p.trans in Evente implies s=p\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yDJ75tAxEQtJ9FDPr", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-15 16:52:55"}
{"_id": "5og8aFLFgNrEXABHT", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone State\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "i9NThk79nQkxDXRhP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 11:54:14"}
{"_id": "GYCheC6yFHXhsj4in", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init in State.*trans_bin\n}", "derivationOf": "RvqjfMeQr4dmPmB4M", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:51:38"}
{"_id": "jSDLHvQW2RfKhxfvi", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  \n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GKHRsZuW8sDgY4hYR", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:31:52"}
{"_id": "6zBQneKXefepZSFuv", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pw4CeSHwtAP2D8DEJ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 09:40:54"}
{"_id": "RC944SzogggsJ2pYg", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.*(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ftyXGG7JNNiopJPez", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 21:58:58"}
{"_id": "ucA8zyEKXHspDqk6G", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i : Init, s : State | s in i.*(trans[Event])\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "w86fPfXBGYLgKLH7F", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 15:50:34"}
{"_id": "Jf2s9rEQ9PRnErBmm", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TMq4tbcxWk8JpfzXs", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is this/Init (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:25:09"}
{"_id": "aXwCSxCa5oHw9uN2j", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    iden in *trans_bin\n}", "derivationOf": "aEbnEnJLcmMDZ6L3a", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:48:44"}
{"_id": "mSDBnnoTR6XoaQ3g7", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\talways (all s: State | some s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\talways (all s: State | lone s.state.State)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "M3Bahvmg6DLLEj2Bc", "msg": "The name \"state\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 20:08:18"}
{"_id": "Z72ZeHwM7vt6gZms5", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init | some e:Event | some Init implies State in e.*(i.trans)\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RJBSFmyqh36vSRRZr", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 17:34:34"}
{"_id": "C47GGDRSKamZh3A6o", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | State in e.(s.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tiEyn2hEYc37zxhar", "msg": "The name \"e\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 18:49:58"}
{"_id": "QC3YjHvkf4uGbXkiC", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some s.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XBeCwRqDHFGT4TsQj", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:07:37"}
{"_id": "Zd32CR8Qhw2EaHQE2", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet t = trans | iden in trans.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "w2F78hNfeoyfjchmK", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {univ->univ}\nRight type = {this/State->this/Event->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:31:15"}
{"_id": "YuCuZnfCw3Zo3CcAy", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SHKiPciiAD7P73Bnq", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:34:17"}
{"_id": "Xao9dPfBmJhrThSw2", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "46bXj8Z4Tjcizr8Qj", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:50:19"}
{"_id": "3x3jZ7NXPFX6eXPnm", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in ^(Event.(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yQmQ8tH7GREvhic6t", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-13 00:04:26"}
{"_id": "tZ8PsXJqvEn2dQ7yF", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jguqy8aYxeMuu3ukp", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-10 21:00:38"}
{"_id": "RrabZzazgWdRKGE4H", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone (x.trans).y\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KmyBPB8HAdL77danB", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 22:05:04"}
{"_id": "Wy2N8PKvviMpKkyyK", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.*adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tInit in Init.*adj\n}", "derivationOf": "BTNfdDXT83e64TPak", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:12:29"}
{"_id": "LZFHo9JPYgXk6bEJ4", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | x->Event->y in trans implies y->Event->y in trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "PmFyZaFnNKrr2Dhij", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:28:06"}
{"_id": "zRG5DG7mDcJytB8rR", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is this/Init (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:25:27"}
{"_id": "yRSRBERSA6fJzTCcM", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HSoSgcW6Rbaz5qLSo", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 23:11:58"}
{"_id": "tRFcJA34NHqnWP9gc", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t one s:State | { Event.(s.trans) in Event.(State.trans) }\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fMDDeQuxrJGR5TStR", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-20 01:53:52"}
{"_id": "gpFpk9NSacLo85EM6", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YYZFBjHZwfATgk2Bh", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:25:37"}
{"_id": "RgbdZLYfyLTZMC7Xv", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : Event | State in *(x.trans).y\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Fgc7uqSprE48smf72", "msg": "The value of this expression does not contribute to the value of the parent.\nParent's relevant type = {this/State->this/Event}\nThis expression's type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:25:33"}
{"_id": "igcZXsZCJXecCx6XM", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (s->e).trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Mw7eePY8GmRTAnWwb", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:19:51"}
{"_id": "kAoWjMxhNHAARrW58", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\nrun {} for 5 State", "derivationOf": "EyFGMkgHoWC729LXC", "msg": "You must specify a scope for sig \"this/Event\"", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-11 01:20:28"}
{"_id": "6fg48p7yJ3ogP9FLc", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tall s:State | s :>(Init.trans.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6najwcTJpNNtFCWTJ", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 19:36:33"}
{"_id": "2Z5Pjjr85gPcTvHkY", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-2-18 15:58:53"}
{"_id": "FHedPqKXZQZ2GskTo", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n  \ttrans in State.t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tall s : State | Init in s.~t\n}", "derivationOf": "dhBDxrdKeMpryPzt2", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:33:24"}
{"_id": "DPwgMpyabHZPCNpAa", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init| some State implies   no ((State-Init)  - (Event.^(i.trans)) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mbQkibd73Eeczzjip", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 18:53:01"}
{"_id": "BMMweD4D4PNDz8gy5", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Initial.{s1 : State, s2 : State | s1->Event->s2 in trans} = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "QmTNKsgu5c7dAZnhN", "msg": "The name \"Initial\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:41:19"}
{"_id": "NvpSWnkP32yQxwGZG", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State, e : Event | some State->Event->State \n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6gjNZGbSgM8rx3WB9", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:55:22"}
{"_id": "YepwTkvQkWpvZJEMG", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n\t\n}\n\n/*\nAll the states have the same events available.\n*/ \npred inv5 {\n\tall disj s1,s2 :State |  no ((s1.trans).State) -((s2.trans).State) and no ((s2.trans).State) - ((s1.trans).State)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n\tall s:State | some trans.s implies ^(s.trans) :> Init\n}", "derivationOf": "ybFsfMpkCb42SmWDf", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:10:55"}
{"_id": "3Xh6hhFxqzK8ymh6z", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  no Init  implies no State and (some e:Event | all s:(State-Init) | some(Init & trans^.(e->s)) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6ki2Xi9WXB4Dv2yFq", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 14:21:20"}
{"_id": "TpKNqjFvaYFD6oRdi", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  all  s : (State - Init)  | some e:Event |  some ( Init & trans^.(e->s) )\n  \n  \n  \n \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MvA8ekyM6wNrdXF8c", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 19:05:55"}
{"_id": "XNjK5vcrb6iLAMBAH", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).Event = (s2.trans).Event \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BEGhL9bgGMB4Hi2nS", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:41:27"}
{"_id": "Eyry6rYvkQHDDiJzX", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8X8qfqpHqEN36jr47", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:06:05"}
{"_id": "gg5gzD5kZAKKffHCt", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet t = { all s1,s2 : State | some e : Event | s1->e->s2  in trans } |\n  \tState in Init.(^t})\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AYKHGPSRLXzDT4Zeb", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 11:02:11"}
{"_id": "Y67fbCFPKyS5Xyu9T", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | s in (Init.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s : State | Event = s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "P6WSEuANQBa8kmue2", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:14:23"}
{"_id": "8SEXAz8AEhfXEpQwq", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | all s: State | Init.trans implies e->s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NskXL4RA63WcFdojN", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:13:51"}
{"_id": "pshyqtWJpDRfRwXaN", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2hB5GYKemsn828P6m", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 18:36:01"}
{"_id": "7upTcADLPeH5PHSt8", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e.(State.trans)\n  \n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall i: Init, r : (i.^function) | i in r.^function\n}", "derivationOf": "yKxuCysauLBb6ptAh", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:24:08"}
{"_id": "uuYT2nMxwqYf98PnH", "cmd_i": 3, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all e : Event | State in trans.(e->State)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "5GtzHtnJQE4gLPe9K", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:13:53"}
{"_id": "gd5cFXqN6wE82rpS4", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State | (one Init) and ((s in Init.(^onlyStates)) implies (Init in s.(^onlyStates)))\n}", "derivationOf": "MjpkHHWY4KnvXHAKv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:32:51"}
{"_id": "v2H3vDAiA9TLpFsdn", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.(~trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NtRNksbnANJJdQbid", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 02:43:20"}
{"_id": "Q3SvTwfaCYcKzCFw7", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | Init.trans in trans implies e->s in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "29xWpoAJrmjteD8iM", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:27:54"}
{"_id": "RxW9ankJEgfbK6qHo", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n (State) in Init.^adj\n\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  \tlet adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n\tall  s1,s2 :State |some e:Event |  (s1->e->s2) in trans implies ( Init in s2.*adj  ) \n\n  \n}", "derivationOf": "gKtYebFZ2RmNKboX4", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:11:39"}
{"_id": "QJzRP56vQdBhTMZSv", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e : Event | lone e.(s.trans) \n\n}\n\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { all s: State | some i: Init | s in i.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r : States | (s.trans).State = (r.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FbjPyLZ7Gzw4HHKDs", "msg": "The name \"States\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-9 18:24:55"}
{"_id": "D5Rfyn7EC4iC5aerY", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t~trans.trans in iden\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZuEDnkznvZaaojkQA", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 20:09:16"}
{"_id": "hvLYSgHuJBCxgfcMH", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init | State in *(x.trans)\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RCYRaz7jRsSAkatLx", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {univ->univ}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-16 22:14:47"}
{"_id": "T9kB9364wDTtFQ2jk", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  all s : State |all (a,b),(x,y) : s.trans | b!=y\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "D593Q42Qjmi6qCw24", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 10:28:30"}
{"_id": "ALd87yeLKJNSTexPH", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-7 18:21:34"}
{"_id": "AC559MwjPsXsARYj6", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in State:>trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dKZBXvNG27qermcgt", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:22:54"}
{"_id": "xW8jZkNo4SBYpaJJ5", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tP3Gtkuwz5cHxLLcu", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-16 21:35:50"}
{"_id": "wsHHo3QE5Hf5KNpuF", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\nall s: State | f : Event | lone n: State | f->n in s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TDMAwQRSqWMveScQp", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:17:11"}
{"_id": "xKevaRzpT3QLY54cs", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n trans.State.Event = State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n\n   all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n\nState in Event.(*(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  \n \n all x : State | x.trans in State.trans\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n\nEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n\nsome (Event.(State.trans))\n\n}\n\nrun {} for 3", "derivationOf": "yR7pHegKEYaqTrdyz", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-6-10 10:31:04"}
{"_id": "Snb5aJya4LSneWbrK", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  some Init.trans\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3jteJ2T4d6JGA5TZL", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-10 21:04:44"}
{"_id": "QDPe8tZRoXjhgjLeS", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "u6ToCyML5fi79ENRe", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 03:34:40"}
{"_id": "EfMQdhLkJnhCFxJ8z", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tall s:State | s :> Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rJJGHCL6DPaYK2gSa", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 19:33:52"}
{"_id": "LQHJST9EYKLhpMFD9", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  \n  \n  \n State in Events. (Init.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XbBCYbesB7BTabKnv", "msg": "The name \"Events\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 18:56:27"}
{"_id": "roYQxCWwoWvfk399T", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s1,s2 : State, e : Event |  one s1.trans.s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7CtCrfbxP9Qzcfoiv", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:06:49"}
{"_id": "jcm2So63sE7PHf552", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event,  | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RrabZzazgWdRKGE4H", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-16 22:08:25"}
{"_id": "3LWt2xJ3LKt9Y3Jh5", "cmd_i": 3, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState->State in Init->^(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "iHoXdePvc2X8ZPpgN", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/State}\nRight type = {none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:31:17"}
{"_id": "E2YgP9ChHhS2qpCJg", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden{State} in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEPq3JRAhrb9aGKw", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{univ->univ}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:44:09"}
{"_id": "eCidByJKbcP2xKCtH", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some s.(Init <: trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "73YeuJzwfDsN8PL87", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:14:21"}
{"_id": "nCnDcuqxP8ijotJ88", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ed3rK3sX9dH994t6B", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is this/Init (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:28:44"}
{"_id": "bgh3RSg8Bdrxf5sYC", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n\tInit.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in (State.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "3AawGQoGM5WSaA7zS", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:39:40"}
{"_id": "huTWNteGpEeuKt7Md", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | some s->Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZzvK2M6yDBtvjak6S", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-24 11:12:24"}
{"_id": "JDiqWB7ve2PSxdvfh", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State| lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall e: Event | e.(Init.^trans) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4hyFThRypAjg3xs5r", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:30:34"}
{"_id": "DrcR5c95TaTaFNQfW", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-4-21 20:42:58"}
{"_id": "fwi3rB4eFmX7Tpk2y", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e.(State.trans)\n  \n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall r : (Init.^function) | some Init in r.^function\n}", "derivationOf": "Jwuho7hjkmeHMLeQb", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:21:20"}
{"_id": "5vwLJgxgSQ8CWPEs7", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4EsvCmPxiJfjFtAxM", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 23:43:35"}
{"_id": "Q8RR6EJFDKwWd3zSe", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RkGdF39CNGZ8Gcfjt", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:18:23"}
{"_id": "ySiQeieAA7kz8TrDM", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  no Init  implies no State and (some e:Event | all s:(State) | some (Init & trans.(e->s)) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gsvdfEoqsWqvZtsm3", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 14:22:02"}
{"_id": "m3cdYnrZWFRSiP3JD", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e.(State.trans)\n  \n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall i: Init, r : (i.^function) | i in r.^function\n}", "derivationOf": "tKD6ph35QursESDev", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:22:46"}
{"_id": "T9ctabavXieA8GuHD", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | one i:Init | i in (^trans.s)\n}", "derivationOf": "h9QoSCDRPzywx6bXP", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:56:36"}
{"_id": "b7Mbs9drd4zWFmqXC", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init |  some (i.^trans :< s )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QGqZvBt5rj2D2GzEW", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:52:09"}
{"_id": "5qfoewDdCmTr9ucQr", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nall e:Event|some s:State | some trans.(e->s) or one trans.(e->s)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jitDoQcKj2FGg8KF6", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 14:48:31"}
{"_id": "kQPawwaDhE4kso26N", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:State | some e:Event | some  Init and no  (State  - (e.*(i.trans) ))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XtStHJyofFiqScFDs", "msg": "There are 29 possible tokens that can appear here:\n# ( * @ Int NAME NUMBER STRING String Time ^ all disj fun iden int let lone no none one pred seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 18:05:24"}
{"_id": "ZQR3Rjn9bpn868hM7", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:(State-Init) | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yRXaYjmhfx2Gb3tdx", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:56:27"}
{"_id": "Rj4tqPvdHLFzecSef", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {all x,y : State, some z : Event | x->z->y in trans}|\n\tall s : State | some Init.(s.^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "yFihBE86oNTCvQynn", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:50:06"}
{"_id": "G6LvdYP99a6MvxLBZ", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FzSPA9nsjT5bjwLQ5", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-14 09:05:42"}
{"_id": "CDZbPMqrWzWzi2dS4", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Zd32CR8Qhw2EaHQE2", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 13:32:23"}
{"_id": "af3Cpy9u4ZHprTHFy", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s,s1:Stat|  s.trans in s1.trans \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kQPawwaDhE4kso26N", "msg": "The name \"Stat\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 18:06:26"}
{"_id": "8f9WknKz8uZQYSaCe", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event |some s:State | lone e.(s.trans) in State \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2NJkxARBhqCFPpvTy", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 14:20:24"}
{"_id": "2NuDKaP32sJ6dMdHG", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n  all x : Event | some Init.(^(~(trans.x))) \n}", "derivationOf": "XSvBz2w2GthrgYNfN", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:21:36"}
{"_id": "xHDSoiLjcaQx3hAaZ", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | lone s.trans.State.Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bW2YENCEXtDx9F9BG", "msg": "This cannot be a legal relational join where\nleft hand side is s . (this/State <: trans) . this/State (type = {this/Event})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:31:50"}
{"_id": "4Q28hGwMx2nuPJXN8", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall s:State,e:Event | lone s->e in trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AksJv3fyZ6ynXAAxY", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 19:04:43"}
{"_id": "P4nfCFrmYK2s6XYxR", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t(State.trans).~(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tycwrC9YqaZeEk6uj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 02:40:54"}
{"_id": "CJyaiSGHHGR5jaKco", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RG2w846kyCjBCP98s", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:20:59"}
{"_id": "xgay7uGjRekE9mxHj", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | x.trans in y.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JrKFfpugMcxkpm9qJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-18 22:12:08"}
{"_id": "cdefbZKYvrmTHNxAq", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans} |\n  some e : Init | State in e.(^t)\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dyNhvv7mD8LthJNdg", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:47:52"}
{"_id": "gn7LqvJQmAzA9dC6g", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : Init.^adj | Init in s.*adj \n}", "derivationOf": "D6a3Amz3rT9jHxTNk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:31:32"}
{"_id": "bkPSX5SaqKfnS7y25", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s1,s2 : State | some e : Event | s1->e->s2  in trans\n  \tState in Init.(^( s1,s2 : State | some e : Event | s1->e->s2  in trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7bEtQApPQJLBRJF9p", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 11:00:33"}
{"_id": "Z823nJ8ZCp7xc28bp", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | State.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Y482K6CNJAWZHPndu", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 03:23:54"}
{"_id": "GP6i7ootq2HytbQWM", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone (State.trans).State\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fmhMYfGaJmrGSvheC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-9 17:35:24"}
{"_id": "g5Yam28ce8hpwX5MS", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | i->s in ^(i.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | e->s in State.trans \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "G2Zpfwi5xRhtpMJN5", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-14 00:17:44"}
{"_id": "9a3D5cJSBGB3hK2Sk", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall e:Event | e->State in State.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "q5gHN2s7dACdRPyH9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:18:27"}
{"_id": "65847gZXEWjTQaZvW", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n  \n  \n  \n \n  no ((States - Init)-(trans.~trans))\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bTsPxRwFCiy2fwu22", "msg": "The name \"States\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 19:24:49"}
{"_id": "W2uCctfL3Ce7ovG3X", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | (trans.x) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wJF5teyHvFbRqaiZA", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:52:03"}
{"_id": "qWDGtc6fMsSy7iXaB", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init |  i.^(s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GJmbx5xdXw5zQe8cw", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:53:44"}
{"_id": "wsfBpj6itTYrnCKXH", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s: State | State in Event.(s.*trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SW8Awa2HxoBReHqhn", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 20:11:50"}
{"_id": "KJqk2ykE2BNghBnAM", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState = Init.^(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "5ufv3osHxq4v9BHu6", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:27:24"}
{"_id": "dWGYBauPffkpuq49i", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\ttrans = Event->State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3LuqCbfXh9XKiTPBp", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 12:19:36"}
{"_id": "wmmYwgKnyWFe9gEXC", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | all e: Event | Init.trans implies e->s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hJFkzxqidzZB3TZSN", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:24:15"}
{"_id": "DKQZNc9dYdysjM7gy", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 :State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8ab6witx2nqahMWDa", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:20:06"}
{"_id": "WXynMgoRBQNyNbsQm", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qdJsT4FFKDvWu77tn", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-2 17:57:58"}
{"_id": "AW3hi7t7jRyARt6i6", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans}\n}\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.*adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3niTLsBfSv4i3M5yn", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:38:10"}
{"_id": "Ha7tmx2oj7PHnB9FF", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  some Init.Event\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mMKtaLiCv7TmWAxax", "msg": "This cannot be a legal relational join where\nleft hand side is this/Init (type = {this/State})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 21:06:45"}
{"_id": "6YgoSetDkux2TWL77", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\nall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pvfMArLkFaHdTw4yG", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-4-21 20:48:19"}
{"_id": "fqki4jyszeYkR4mkS", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init|some Init implies  no ((State-Init)  - (Event.^(i.trans)) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "j3uW4dE733vyiC9ou", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 18:51:19"}
{"_id": "fyuPyKgZPieHJtmu5", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet t = { s1,s2 : State | some e : Event | s1->e->s2  in trans } |\n  \tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YKxCju284hcRkwp4M", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 11:02:34"}
{"_id": "dzT3CQBfwpTgTtLFd", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans.Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5jKtkvkw6MBjn4suR", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 21:31:29"}
{"_id": "j3uW4dE733vyiC9ou", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init| no ((State-Init)  - (Event.^(i.trans)) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QZJtFDmtrN9pEiX3y", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 18:50:33"}
{"_id": "BjHTkBmQGYzLpXZYQ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tall s:State | Init <: s.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kPMeTtxb9cjQ8vmsq", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 19:38:21"}
{"_id": "MDkhLPJABbMqHcxFX", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | some (s.trans).e\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "JvxaTmMw6z59zyQ6w", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 11:55:45"}
{"_id": "GaTC4DaKR5RP3QZ8S", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aeNNSk9sY6gzpHNtP", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 23:56:47"}
{"_id": "QJzjZEhDPzwB3tmYj", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\nfun f[t : trans] : State->State {\n\t{s1->s2 : State->State | s1 in trans.univ and s2 in univ.trans}\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QYozseytmRgYrgcNA", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-11 00:46:39"}
{"_id": "9fZcW9tz2SoKZyoXz", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s1 : State |  (Init->Event) in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hyawTdq6azgghZPdZ", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:02:02"}
{"_id": "3jteJ2T4d6JGA5TZL", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tZ8PsXJqvEn2dQ7yF", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-10 21:00:40"}
{"_id": "z4ZNGAhpZhyhd3ixG", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  all s : State | lone trans.s\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jintSqnxD6dfaxoq3", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 09:55:02"}
{"_id": "dPEnTdTnxop5RKhdy", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4SxScxsexGDXpx6uy", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:31:28"}
{"_id": "yKCMh6HwBnyDSKaq4", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.trans.State\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aeoJm226vTxmmhpit", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-9 17:32:15"}
{"_id": "6najwcTJpNNtFCWTJ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tall s:State | s :>(Init.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "db5PnYzBzcefthRvu", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 19:35:52"}
{"_id": "9CkTQKBZeSAFXxyjs", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | all e:Event | e in s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "y3TawmuvppgmzRcyG", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 21:31:45"}
{"_id": "7sZiTppNadah3kqRw", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.Event\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nfEyM2WnEDByAoGTt", "msg": "This cannot be a legal relational join where\nleft hand side is this/State (type = {this/State})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 11:15:15"}
{"_id": "vyMmCWaPZ6dpZt3fo", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1:State | Init in (s1.trans)\n}", "derivationOf": "AwznRZL9M5vFAHd6Y", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:12:38"}
{"_id": "E4785RbYZXC7crKip", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-1 08:29:25"}
{"_id": "qDkRF5eyCC2DsdCGB", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | some (s.~(Init.^trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "XGTDHk2JDF93zBH9r", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:05:52"}
{"_id": "ArLcNWXAmbo6dsFLH", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 {all s:State | s in Init.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r :State | (r.trans).State = (s.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { all e: Event | some (trans.State).e\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {all s:  Init.^adj | some s.^adj & Init\n\n}", "derivationOf": "zM7aCbvhYahhH547M", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-20 22:30:37"}
{"_id": "uzxr2RzzqMiYZyHZ3", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i:Init | i.trans in State.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8qmskt9fcmStreH3h", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:45:58"}
{"_id": "tPeZrSkPap6wDZjj3", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  \n  \tall s : State, e : Event | lone e.(s.trans)\n  \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s : State | s.trans.s in Event\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "siPD6nfdrt6agAxX9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 11:10:19"}
{"_id": "8WXGFB2Dhzv2JzDiq", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9sCn6J5pPcgR6Hcmi", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-21 18:43:03"}
{"_id": "umdyo8PTCGapgK8iS", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init | ^(s->Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "Nu9NmTsLF843JNiGL", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 15:10:42"}
{"_id": "HFd3YW5oiiwf9MoGb", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some x.Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XKSEgMptxRhBknTyW", "msg": "This cannot be a legal relational join where\nleft hand side is x (type = {this/State})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:58:38"}
{"_id": "THBKsiALfdoynpNPv", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cLRsR9jHtBinjK2rE", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 18:53:09"}
{"_id": "vtfthCqnypDoapagF", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone s.trans <: e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EpmxyAXhRsyorwdbF", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 15:12:20"}
{"_id": "dKZBXvNG27qermcgt", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in State<:trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2LyfDc9bRCz2gKsro", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:22:46"}
{"_id": "4gfZBpyyjTfchnyF2", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  some (Event.(Init.trans)) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "ZMEmLuvZkKjcKGkvS", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:27:03"}
{"_id": "P2RwTjX9gDia5xbsG", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tState in Init.^rel\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2: State | s1.trans.State = s2.trans.State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  \tall e: Event | some s: State | e in s.trans.State\n\n}\n\n\npred reachable[from, to: State] {\n   \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tto in from.^rel\n}\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all to: State | reachable[Init, to] => reachable[to, Init]\n\t\n}", "derivationOf": "X5Z4msBnDnLNJPWz9", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-9-12 10:04:43"}
{"_id": "Bifc9f49Hkq8tqmtr", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event| some e.~trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FsJcgrKEoEur6Rcoo", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:46:58"}
{"_id": "fzJToExesZEtsCrin", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) + Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JTSQxCDkHxwKDtJiR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:13:30"}
{"_id": "9H78LLKamGnQbRpER", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set State -> State {\n  { s1, s2: State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "CqYR46i7v8H9XmDAc", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:17:53"}
{"_id": "upYaovicXDaQcpksa", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some (Init.trans).s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | some (s + ~s)\n}", "derivationOf": "pJhyhx5Bex8vwwccf", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:25:36"}
{"_id": "oHL9eSjinZT7rmMJe", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pynEjaSu5Ci9hsASb", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:11:16"}
{"_id": "tfwSvWpeMyX7F3CCs", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State| lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s,ss: State | (s.trans).State = (ss.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: State | s in Event.(s.^trans)\n}", "derivationOf": "xFG33KaXruKxsCX4Y", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:42:05"}
{"_id": "dXGCo8RkNv5PkZATC", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init <: trans | State in s.^(trans.Event)\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "cS3uGzAWAEXK2udxd", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:45:48"}
{"_id": "jQkjiYKHKieP8RwCe", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tState.trans in Event -> lone State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y: State | some (x.trans).y} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s,t:State | s.trans.State = t.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\n\npred inv6 {\n\tall e:Event | some (State.trans.State & e)\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet adj = {x,y: State | some (x.trans).y} | all s:Init.^adj | Init in s.^adj\n}", "derivationOf": "g5ySxpi9dFohkwkWq", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:29:27"}
{"_id": "8nWS8schSaJTGqZCD", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | e->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s1, s2: State | all e1, e2: Event |some n: State| e1->n in s1.trans and e2->n in s2.trans implies e1=e2\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "Tvsj7EwBmtDydpwmD", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 21:39:15"}
{"_id": "WDR8xjdBjgbaG2DGq", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone (s.trans).State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nCnDcuqxP8ijotJ88", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:35:55"}
{"_id": "bRFQpAEvxKw9tHTRh", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in ^{x,y: State | some x.trans.y}.Init\n}", "derivationOf": "HBkpCfW4RgPDfgCZk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 01:14:15"}
{"_id": "w3HyFPdSDBCoAwLbN", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | lone s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KFnjobvru7Cm29LaY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-26 09:23:28"}
{"_id": "xgeDcLj5G9rqRQw5K", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "A8hoCtac9twPX88TW", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:45:50"}
{"_id": "piDuP2FMkhNZSNG7z", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "KL3J3932ZAcTQPaHs", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 17:43:08"}
{"_id": "FEDsNtuo32KcJvhgo", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tsome ^t implies some Init.^(~t)\n}", "derivationOf": "r85NCmE4eThy2yy3u", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 07:38:59"}
{"_id": "FQ2Nd5jY6MHirJoL4", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^trans in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sYSTjKMnRydgTWAn4", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 18:40:26"}
{"_id": "6aj3nfK48XZqK7pyD", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | lone s.trans.Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^trans.Event = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "r5GRChPE6wPZzgXEz", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:04:39"}
{"_id": "6gjNZGbSgM8rx3WB9", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State, e : Event | some x->e->State\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vrwWtFvGh6X98Bpj9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:54:51"}
{"_id": "uAkQk7QpaQZtWkF2B", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bsPeZt437SGwmzYvA", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-21 18:48:00"}
{"_id": "qdGKhSek2HNjhuN4t", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mwmXcK5K375msvC7K", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 19:06:16"}
{"_id": "p8iax4ke7TXstDias", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.(^{ s, ns : State | s->Event->ns in trans }) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RWHx5q62QzTw3mDjB", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:24:26"}
{"_id": "R7fHpGmy8sMrLe9r4", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event| some s:State | s in (e.State).trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8rZXSFbfYEKjxXhJE", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is this/State (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:47:30"}
{"_id": "Dx45TFgeps3kEa5Z8", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1 : State, s2 : State | some s1.trans.s2} |\n    Init.*trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "rEni9caqk4iX8hkPf", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:43:38"}
{"_id": "7JEXrN8cuzzj5ACm2", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State, e: Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FmGrtCCi56BA6nX3K", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-18 11:59:28"}
{"_id": "8dn3bA2yHFi5XPGZr", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | Init.^{x,y : State | x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Amdn5kHhDKLnHYrte", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 13:16:46"}
{"_id": "cgxqqWjX5JbmitGSe", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gaRg6QhDbRRGymsF6", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:28:27"}
{"_id": "vQ9yLqrrqQpwKpDm2", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | s.~(State.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "db8YJeiYcZXSutMNc", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 22:05:21"}
{"_id": "QdfMz9aGGx8jDWNof", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall x : State, y : Event | lone x.(trans.y)    \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XHrQQHy29ex4t6ZEz", "msg": "\"State\" is already the name of a sig/parameter in this module.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 09:58:06"}
{"_id": "iaLrzAf7FxqoDZeiN", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FQ2Nd5jY6MHirJoL4", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 18:40:39"}
{"_id": "gb42tEHuWCrcpQRuA", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | lone s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-26 09:22:54"}
{"_id": "7KXnsiubfHdNnGYFB", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone s:State | s in Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2:State, e:Event | s1->e->s2 in trans and s1->e->s1 in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "oHAvsdkvRxpcfzDWv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 00:31:06"}
{"_id": "cjY3oCGMs5kFBKNA8", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tState in Init.^rel\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2: State | s1.trans.State = s2.trans.State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  \tall e: Event | some s: State | e in s.trans.State\n\n}\n\n\npred reachable[from, to: State] {\n   \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tto in from.^rel\n}\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s: State | from[Init, to] => from[to, Init]\n\t\n}", "derivationOf": "ExxaXPtp8ipPheLX3", "msg": "The name \"to\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-9-12 10:04:25"}
{"_id": "FGLTN4WivSmdtB7Xw", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2Z5Pjjr85gPcTvHkY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-2-18 15:59:03"}
{"_id": "s7fsodsB6otdQuzZx", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init in (Init.^trans2 + (Init->Init))\n}", "derivationOf": "diKGysF4XLJLfQiW3", "msg": "+ can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/State}\nRight type = {this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 11:00:11"}
{"_id": "HzDhtmSwzcmwvkTu8", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | all e : Event | x->e->y in trans and y->e->y in trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "Stt3rdCNGti74w2mg", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:29:24"}
{"_id": "aizYWpcR2CXWu6g8f", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | all e:Event | lone e->s in s.trans\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hSZFycuW4gfcedQ7M", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 18:45:56"}
{"_id": "vfrEPqSHqChSY7ANc", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Gr3yQggJjLCiWssPm", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 20:40:18"}
{"_id": "y94wCwFpTe43vyk3k", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (~(s.trans) <: e)  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s1 : State | e1 in s1.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JFqrnYZBRs2Sxnm6x", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:15:42"}
{"_id": "rg7D7JtCmF9TgTFWA", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  some State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "j3KwLSwEzEMmw546k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:22:55"}
{"_id": "rQjzpJ8qXiQowuEX6", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7wZLxTtWr7x6GCKvN", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:12:44"}
{"_id": "EWg8GugSryt2zxyvf", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State, e1,e2,e3,e4:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans and s1->e3->s1 in trans", "derivationOf": "Np4d3eQs6BwXFkHv3", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 12:44:54"}
{"_id": "yeGgtzTWmEYfjzYek", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | some e : Event | s->e in Init.^(State.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "NoETSjQQTNKyjSQoT", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event}\nRight type = {none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-23 03:57:40"}
{"_id": "3x7pt5pHn6ykjwHCK", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {all x,y : State, some z : Event | x->z->y in trans}\n\tall s : State | some Init.(s.^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "6rtKGfaywynzb5GAo", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:48:58"}
{"_id": "qH8mxTj99GpPBxHzo", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all t:trans | lone t\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FjxQkpLFATbiDWpGH", "msg": "Analysis cannot be performed since it requires higher-order quantification that could not be skolemized.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 18:43:14"}
{"_id": "9DMtqkGMHYxrrsJYW", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/ \npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\nall s : State, e : s.trans | ~e.e in iden \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HrcrQ2cq2WByf2ejd", "msg": "Analysis cannot be performed since it requires higher-order quantification that could not be skolemized.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-4 17:21:39"}
{"_id": "L4Wf7g8GSPMXYsDt3", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some Init <: trans.(Event.s)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fF5fkLHbJF7tHzTAe", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 21:35:39"}
{"_id": "vcZ24XWMtb66tWoJg", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event |some s,s1:State | some (s1->e->s) in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5qfoewDdCmTr9ucQr", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 14:53:43"}
{"_id": "r85NCmE4eThy2yy3u", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tsome ^t implies some Init.~(^t)\n}", "derivationOf": "JN9c9cF8KsFfqABGw", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 07:38:49"}
{"_id": "K4tkDweK7JtGyaKfa", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet x = Init <: trans | State in ~(Event.(State.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\nrun {} for 5", "derivationOf": "uZtAXwoLK2Z6dYzEi", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-11 01:35:49"}
{"_id": "WdBCiqgGv2naz9SWm", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {all s: State | lone (s.trans).State\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QMgsiPagxES4wvg9e", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 01:26:36"}
{"_id": "8X8qfqpHqEN36jr47", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {some State.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:05:51"}
{"_id": "SXnJjdCuiAXQZqvCK", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, e : Event | State in ^(e.(s.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GcXr28QTH7G9pW9kZ", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 18:52:27"}
{"_id": "gLyXJ8f3d5FpJvzv9", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jx68W5SvdNmrygoZu", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:11:21"}
{"_id": "wackytJsX9r6ojfdT", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | e.s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CJyaiSGHHGR5jaKco", "msg": "The name \"e\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:21:09"}
{"_id": "A8hoCtac9twPX88TW", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some x.trans in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Xei4Hw5kYp32QZH6x", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:45:41"}
{"_id": "XxxkuazN3YEhPJWiu", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i :Init | some e:Event| State in e.*(i.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CFCcRGzHLc5FZGrX5", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 14:28:00"}
{"_id": "Cy4cuuBkwmsPsqfdP", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tlone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Bb7pQGtyt4RXiZPcJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-12 19:38:59"}
{"_id": "97PXAcdgfzEbeF7zg", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | Init.trans in trans implies trans.e in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "q5gxoa5CvXJjPiFN8", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:27:19"}
{"_id": "GaG3JzWkBEb6u6txk", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.trans\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "q35xd75MsCe7T98QE", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-17 21:34:15"}
{"_id": "28vXrCk66wHx8ffTJ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.(^onlyStates)\n}\n\nfun onlyStates : set State -> State {\n  { s1,s2: State | some e: Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "vPWSBzt9QcxW4NhS5", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:17:20"}
{"_id": "Nu9NmTsLF843JNiGL", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init | State in ^(s->Event.(s.trans)).State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "apGHrpFFsW7GxBELP", "msg": "^ this/State . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 15:10:15"}
{"_id": "X5J7ozcsgFrfsApnv", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State |one e: Event | lone e->s in trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "oAgetGXYY9PTegcRs", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 20:42:06"}
{"_id": "r9YYzogaYRGugvemx", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "b6RcrNCxgEck8Mk3w", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-30 19:28:00"}
{"_id": "z4yXQ3QY5trHThzqu", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some x->Event implies some y->Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "D8zvycf2SfGB2eBBc", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:01:56"}
{"_id": "s5XmMyaosbGHaK8eM", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall e : Event | e\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "F2tFYCW8r9YrQqqMM", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:37:36"}
{"_id": "evqknFkMCmzn828rR", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in (trans)\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "KEWc8JYd7iC78cMbD", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-23 08:21:54"}
{"_id": "e2pQ4EEuYoW5AxLcE", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tState in State.(trans.Event)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "oLxLPtgKtxm48XLQY", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-18 22:13:50"}
{"_id": "XqmBbzNAXBXgoWgeF", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dzT3CQBfwpTgTtLFd", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 21:32:33"}
{"_id": "3RyrmaC4cdnS4ZS6p", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s:State, e:Event | lone s.trans.e\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XnbTNEob8jkj9phKn", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-15 16:19:37"}
{"_id": "aLMHx3YBWofj7BNPr", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i : Initial | State in i.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DNeGGEA45PmbRgz4Z", "msg": "The name \"Initial\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:04:15"}
{"_id": "xvjAJ6bufjuqXLFhn", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n  \tall s:State | s.trans.State in Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \t\n  \tEvent = State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pTGEJPBCGa9B6D8ek", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:28:02"}
{"_id": "zLjhS3e5wYJEDLaFZ", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, s1:State | s.trans.State = s1.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \t\n  \tEvent = State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gtqNTXT2444phWnK3", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-21 12:30:56"}
{"_id": "ouSrsb84Ma7MBriQR", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State| lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i: Init, e: Event | e.(i.trans) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iLJEJw7bJSWLdzian", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:27:55"}
{"_id": "Stt3rdCNGti74w2mg", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | all e : Event | x->e->y in trans implies y->e->y in trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "hNtckotXt56wTSpuG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:29:10"}
{"_id": "RFoZF5jBizFNTX2EB", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | one e.(s1.trans) & e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "49ZJY2oyeWr5dHm3t", "msg": "The name \"e\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:31:40"}
{"_id": "8WGNLYj78XoFtFXBZ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init| some trans implies some Init and    no ((State-Init)  - (Event.^(i.trans)) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DyXafJdLvfugsEWTf", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 18:55:16"}
{"_id": "efoTm7HBekGad58YZ", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tInit in Init.^adj \n}", "derivationOf": "HXMcqXSNTs7keZ4RL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:33:00"}
{"_id": "rzvDjtw6xaFEZyY8c", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | State.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EzhWAoswPi27fTuSL", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 03:26:05"}
{"_id": "dbYuQyes9TReXLWkG", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State | lone Event.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZC2AYi59pSBdqqM5h", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 22:11:52"}
{"_id": "FXx2WMJ8p4NQdPt4r", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tone State->Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5CnWu9WShyqWReQhz", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-24 11:08:36"}
{"_id": "MDnF8yQtESpyncxof", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  lone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | some e : Event | lone (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  State.trans = Event->State\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "s49NiTN34yL7nigTN", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:21:56"}
{"_id": "N2ribbwdfCQY3TWht", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in State.~(State.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XxNFms6GmN4NzJjPt", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:32:23"}
{"_id": "9GqNcRarSf5PRYKLT", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n trans.State.Event = State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n\n   all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n\nState in Event.(*(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  \n \n all x : State | x.trans in State.trans\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n\nEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n\nsome (Event.(State.trans))\n\n}", "derivationOf": "tpYSWJWygfKZcqhZP", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-6-10 10:32:01"}
{"_id": "bsPeZt437SGwmzYvA", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | Init->Event->s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KmfEKpTHparQt7G39", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-21 18:47:21"}
{"_id": "CJJMSxesbf68KuLJf", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QjysAxXLP9AZomQBA", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:00:22"}
{"_id": "u2qJrQqTkSGvfZNkp", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet r = State.trans | iden in ~r.r\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 09:14:36"}
{"_id": "AGqXQGoqi2Mi3NKxh", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | e->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2: State | all e: Event |some n: State| e->n in s1.trans & e->n in s2.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "bJA4xudpu8L5rvYYj", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:35:46"}
{"_id": "uBN3Sjq3jQWjoH3iF", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 { Init.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XnWWCFSEzd2uYufma", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-20 22:14:43"}
{"_id": "ditrNdswjt338u4Ak", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event->State in s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tfEdm7frEynmtTQ92", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 00:17:49"}
{"_id": "bXqeodHM4vK9ZfpgX", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    \n    \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ME4M8NDNQqA5NhZFY", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:24:00"}
{"_id": "qdJsT4FFKDvWu77tn", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yEfqHQzG59MiYSPo4", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-2 17:57:54"}
{"_id": "sSzze6JptDBu4b4pH", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n    all s:(Init.^adj) | some ( s.^adj & Init )\n  \n\t\n}", "derivationOf": "9vmkYGbrmudbgRx3B", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 16:36:05"}
{"_id": "vfSNDbFQ4Yv2T8Can", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  \tState in Init.(^{s1,s2 : State | some e : Event | s1->e->s2  in trans})\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bkPSX5SaqKfnS7y25", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 11:00:59"}
{"_id": "zyue4xgf7LNmBn4mY", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in ^{x,y: State | some y.trans.x}.s\n}", "derivationOf": "tafc9rzMLoZkS4qHL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:42:55"}
{"_id": "vHTkCiv3FBteBYn9K", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:35:34"}
{"_id": "G7GYs3vfgxGmwCkRy", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 :State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State-Init | Init in Event.(s.~trans)\n}", "derivationOf": "MdMFLiDqsRd8265X6", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 00:21:53"}
{"_id": "MvA8ekyM6wNrdXF8c", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  some Init and  some (State-Init) and all i:Init|    no ((State-Init)  - (Event.^(i.trans)) )\n  \n  \n  \n  \n \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RwpJwZbHTcoiQdTK7", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 19:01:28"}
{"_id": "5LqYjovZ4xFtpQvj9", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "E8RSquQF5GFozADhG", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-20 01:05:23"}
{"_id": "fux6JYPGLq5mm6KBb", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tInit in Init.^adj.*adj \n}", "derivationOf": "efoTm7HBekGad58YZ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:34:46"}
{"_id": "Gu2KhPue8wpTvBM39", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event->State in s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ditrNdswjt338u4Ak", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:18:00"}
{"_id": "QMgsiPagxES4wvg9e", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {all s: State | lone s.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5LqYjovZ4xFtpQvj9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 01:26:21"}
{"_id": "ch8DQeoPoZn92Rihe", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sAAX3PG9Z3uzvw3LK", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-2 17:37:11"}
{"_id": "qF3PdB2HQvz2LQi8E", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | lone Event.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xHDSoiLjcaQx3hAaZ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:32:01"}
{"_id": "3EgLKvbJ4mZgTffcF", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State, e: Event | lone e.(s.trans)\n  \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\npred inv4 { all s : State | some i: Init | s in i.^adj \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r:State | (s.trans).State = (r.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { \nall e: Event | some s: State| e in (s.trans).State \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { all s: Init.^adj | some s.^adj & Init\n\n}", "derivationOf": "xXiweYJyaX9J6FJtT", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": [{"parent": "State", "type": "this/Init:State"}]}, "nodePositions": {"State0": {"x": 413.6640625, "y": 265.3333333333333}, "State1": {"x": 413.6640625, "y": 132.66666666666666}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2020-12-18 12:20:24"}
{"_id": "9RatmxnN4c225bnHD", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ddvznvk4BXwnz6bRD", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:15:03"}
{"_id": "oiguL2nJfrP9DtJFQ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | s in State.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "8Ln5Fx6mwcnT8Rbt4", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 02:56:43"}
{"_id": "ibNfjZkgyXQ2ciyfn", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\nall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\ntrans in State -> Event -> lone State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\nall s: State | s in Init.^trans[Event]\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\nall s1, s2: State, e: Event | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nall e: Event | some s: State | some s.trans[e]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9SrEXqtFGdfrYCDgT", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-14 09:47:38"}
{"_id": "vAy4G2fKvksp3ALgu", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in ^{x,y: State | some x.trans.y}.s\n}", "derivationOf": "fznh5jcqEdphXGc5P", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:43:25"}
{"_id": "Aw2Xm8ZaHzqXZibZq", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tno s:State | no s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n  \n  \t\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "C6hBRdAgBB4LCCE4Z", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 15:40:23"}
{"_id": "zuQxrKqWagrtPfLxW", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2Y6zgWyXNBmk6N2xi", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:25:45"}
{"_id": "Gr3yQggJjLCiWssPm", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome S.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ajTKvaeaQybDae8eA", "msg": "The name \"S\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 20:40:10"}
{"_id": "diKGysF4XLJLfQiW3", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init in (Init.^trans2 + Init->Init)\n}", "derivationOf": "Wcym9JMND6suBNtny", "msg": "+ can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/State}\nRight type = {this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:59:56"}
{"_id": "g7cr3v7ZMGG4GZgnG", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s,s1:State|  s.trans in s1.trans \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "af3Cpy9u4ZHprTHFy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 18:06:34"}
{"_id": "TnKRA6bJgfFWJPXgs", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/ \npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\nall s : State, e | ~(s.trans).(s.trans) in iden \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9DMtqkGMHYxrrsJYW", "msg": "There are 3 possible tokens that can appear here:\n,  : =", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-4 17:23:55"}
{"_id": "mnSikkKTQrs2CmRBB", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CaQdZw66d4i6eZJF7", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:18:50"}
{"_id": "zfcWYmYAmQCaRG2No", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t(Event.(State.trans)) in State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7Xc3FWLsGPY6ph6yo", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:46:29"}
{"_id": "4kj8CxN8bB9JtQYd5", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tState in Event.(State.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-18 22:15:26"}
{"_id": "NLJHaK6QRDXHmpQDw", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Kn2PkdiFsdzsCgZNh", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 11:53:21"}
{"_id": "a4DQisNA55fWteckp", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n  \t\t\t\t\t\t\t\n    \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "8RLboYf8eu6AFR6WN", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 11:21:25"}
{"_id": "W8WmLRDPZ47hieiLe", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y : State | some e : Event | x->e->y in trans} | \n  \tall i : Init, s : State | i->s in ^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9BMbZYmWReZNDaMGQ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:13:48"}
{"_id": "BYyrTAzgKjRFMn949", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in State.trans -> State.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yZdgfeMWBvWZM9pLS", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:21:30"}
{"_id": "D8zvycf2SfGB2eBBc", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State, e : Event | some x->e implies some y->e\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wzZyfwhC6ancWmr36", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:01:31"}
{"_id": "3FqgMFt3ArtaaSRPD", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden[State] in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AoMaRY5xvbwkP3jGc", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {univ}\nRight type = {this/Event->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:43:53"}
{"_id": "3XKE6PwrwJEytvSEe", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: State | Init in (^trans.s).Event\n}", "derivationOf": "wY83dTpfaszTpWWzX", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 20:16:39"}
{"_id": "Ga3oPmRnBE3DTNzBS", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.^(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "WGgDWbx7vE9CBuEzw", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:25:01"}
{"_id": "ywRD2dpMXPXxGzAGn", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\nfun onlyStates[s : State] : set State->State {\n\t{ aux : Event.(s.trans) | s -> aux }\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^onlyStates[Init]\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "F9AdDA4hJY7Jwta62", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 01:02:57"}
{"_id": "3et53fXYPBk2v3PgB", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some t:trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cu4Y7rZLzakCpg6yn", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:29:27"}
{"_id": "dhR5oM7MegXhfjsBB", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n\npred inv6 {\n\tall e:Event | e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "YZsng3uEfiegfsAfW", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 22:10:17"}
{"_id": "jTGcdCvvRHjDP4Z4B", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.^(trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "ECdAMiL2GiXGvzFWg", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-23 03:47:12"}
{"_id": "XHrQQHy29ex4t6ZEz", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall x : State, y : Event | lone x.(trans.y)    \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AWv3Xj44MexiMGG3r", "msg": "\"State\" is already the name of a sig/parameter in this module.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 09:57:54"}
{"_id": "oQgTTq2yH7ev2PER6", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2 : State | some e: Event | s1->e->s2 not in trans } \n  \n}\npred inv4 {\n  \t\tall s : State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "smzSy5z5rRcFBn6EL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-2 18:03:07"}
{"_id": "cgA8exM8B5feAZ22q", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n  all u : Init | State in u.*{ x : State, y : State | x->Event->y in trans}  \n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rHtt9Qf7HpJr5jXxr", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:33:25"}
{"_id": "KbGSX2cFjMycL4R8Q", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-8-25 04:31:31"}
{"_id": "tc8zx79YKfoeWDyHr", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (s.trans <: e) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vHGCAzx8MtR7jQPZd", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:12:33"}
{"_id": "JoeYhRJPKxQT24eo7", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.{s1 : State, s2 : State | s1->Event->s2 in trans} = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "BMMweD4D4PNDz8gy5", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:41:27"}
{"_id": "33DXHvW4TfEJuGo2C", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some trans.s\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-15 16:02:42"}
{"_id": "eGACinQdmdYxgJ9vb", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t \n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "8sqN37j8Z67JRQrkd", "msg": "^ this/State . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 11:07:21"}
{"_id": "WCD69CawxEzyWcnwT", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | Init.trans.trans:>s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e<:State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7YZcsudRwjH6mZAxr", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 20:12:43"}
{"_id": "CYbqvnqTfBDmdeTJT", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.*trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "Dx45TFgeps3kEa5Z8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:44:02"}
{"_id": "Rm6Gdb7bENcxS7GFR", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 {all s:State | Init in s.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mp3rR4WeXzdT7xakF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 22:15:41"}
{"_id": "sFcXzPYzB8kvgbhmY", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x,y : State | some z : Event | x->z->y in trans} | State in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "f9mpBTHK5FwsBpmB7", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:12:56"}
{"_id": "xh2FJigqSqtWN8jMT", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "8CG9j5ZMvmKbq4Pq9", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 17:43:15"}
{"_id": "iDaYQgPqC2unNgCHr", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | Init in s.^{x,y: State | some x.trans.y}\n}", "derivationOf": "jK8EW9rARxgWBPNEy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 01:16:45"}
{"_id": "C4Bwr8CANGtxv6aPi", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some s.(Init <: trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wDsk3W75NiTGTFDQt", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:11:46"}
{"_id": "kceKivWetAiKF6WRC", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tlone State in Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "y2iGZ8835TYZpf5yX", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 15:03:05"}
{"_id": "QXjSKFxxg2iCNAGn5", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State| lone Event->State & s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "N8kRycMeHamFjG7LW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 21:33:35"}
{"_id": "PswcNRP8G6HvFQAYD", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init | State in Event.*(x.trans) + x\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kEHq5JfnM4hWgvFEn", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:13:20"}
{"_id": "bvcvCMDGBsjSKLMwJ", "cmd_i": 3, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | (~s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "obB7dShuko2B99zGS", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:23:19"}
{"_id": "csGja5A9mYzdBwBs4", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.(^{ s, ns : State | s->Event->ns in trans }) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | s.(trans.State) = State.(trans.State)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.(trans.State) = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t((State - Init) -> State) in ^{ s, ns : State | s->Event->ns in trans }\n}", "derivationOf": "bK6dBjRuS23djLYp4", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:34:26"}
{"_id": "w4tuKvF26d3CedAF7", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone Event.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mNN8YtroCFNgh3YNb", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:21:31"}
{"_id": "mf8Wbx83o7AXot3gJ", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | some e : Event | s1->e->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.^tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e : Event | some s : State | some s.trans[e]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : Init.^tr | s.^tr in Init\n}", "derivationOf": "HCvn5JfLXfmj5sLTH", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 16:15:27"}
{"_id": "svqLD2QdpNdzbiEog", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some t:trans in s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "A3wJsQahA2jqaj4ia", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:23:12"}
{"_id": "u2J4neBByHrwNaHHp", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | State in e.(s.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "C47GGDRSKamZh3A6o", "msg": "The name \"e\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 18:50:10"}
{"_id": "w9z8ZRh6473qeAfkb", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in Event.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aJmLAzTcFSrFxexQ8", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 22:17:37"}
{"_id": "Hi8KwPhZYf6Krco8G", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i : Initial | State in i.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aLMHx3YBWofj7BNPr", "msg": "The name \"Initial\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:04:23"}
{"_id": "mBNgcekumR6FLd42W", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State, e1,e2:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans\n  \n  }", "derivationOf": "NsnKGufMsxrztMLwy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:45:13"}
{"_id": "8GfzAQAgMkSLbfnuv", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\nno Init  implies no State and  all i :Init|some (State-Init).^~(i.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zGKeY3mp9zjKDpQTL", "msg": "^ ~ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 14:06:33"}
{"_id": "jumZ6F9XDkGMudkzL", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone I e.~s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ArMzp5PoozAJisYJp", "msg": "The name \"I\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:48:26"}
{"_id": "FGojYeboRtN6cq339", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | s.trans = State.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QajmoJDWrdT4bsvrv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-24 11:04:46"}
{"_id": "vZ79shqiSNPHpf5pz", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "wvsjSGR7cwsumHswZ", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-23 03:00:05"}
{"_id": "cgnvJmvGNZJrv79bb", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s,s1:State,e:Event|some s2,s3:State | s->e->s2 in trans implies s1->e->s3 in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hRuGXXv7Y7hHyQfmH", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 21:11:11"}
{"_id": "qhoHYGg5niD9H2bmE", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | all s: State | e.~trans in Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YqYnoZo5CQCNDTmva", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:11:55"}
{"_id": "rLMvybYZPMGP5iLbd", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ESZqW8zTKKDgvAXWj", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:14:36"}
{"_id": "NYw4usFu84bbzzbtQ", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n  \ttrans in t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tall s : State | Init in s.~t\n}", "derivationOf": "FHedPqKXZQZ2GskTo", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:33:32"}
{"_id": "ym9RhmM9kMkia6u6K", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State, e1,e2:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans and s1 in s1.trans\n}", "derivationOf": "Zn5dLxn6QF5GGSuWX", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 12:42:17"}
{"_id": "TEfiEry7xTP2vJaNv", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s1, s2:State | some e:Event | (s1->e->s2 in trans and s1 != s2) \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2ZDDsewq9FbP4v7b8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 00:17:02"}
{"_id": "2wLPS7SWaYjsx4ccN", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "o6rcyg5spyfx4PigY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:11:37"}
{"_id": "XbBCYbesB7BTabKnv", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  \n  \n  \n State in  Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mj3AQhuHc837RM3Bh", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 18:56:16"}
{"_id": "iY2wt2Zy6pPWSFbyx", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, disj e, e1 : Event | s->e in trans.State and s->e1 in trans.State => e = e1\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yCw7hJRdXdrLFobrB", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 02:51:23"}
{"_id": "dNajspiskQyEBJELQ", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tone Event.(State.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "fc4qMYCpZp2wiyqXJ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:21:26"}
{"_id": "JvDEmKP27zQmdajvs", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \t\n\tall s:State |\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\ncheck {} for 7", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 13:52:47"}
{"_id": "nDCcKRpAifpafFeEb", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  all i:Init |(State) in i.*adj\n\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tntaShQEPPR5y5QXs", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:04:24"}
{"_id": "xymXGkHKqZqMABpdG", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tKncxcKa5mJM4EoHW", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:26:46"}
{"_id": "n2ySZpMBrCyWndW8c", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sLW3CExf7ponYgT3P", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 09:58:19"}
{"_id": "uCByiFT35t4dGEKv4", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x  : Event | State in Init.*(trans.x)\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "crC5S7MR7ceHZfERH", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 22:25:01"}
{"_id": "ELxiD2AJKFahaibD9", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State | lone Event.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "uGwy8cs2L9rSv6JWe", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 22:11:06"}
{"_id": "GCxqEPWJ9X2Q3CJsG", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {all s : State | lone ~trans.s\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Si4DP2tjyzzccBAdJ", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 21:13:14"}
{"_id": "TzxJgxnBE3EFBdbXy", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : State | Node x.*(trans.Event)\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tHG9SjTJjhQksmrME", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:22:51"}
{"_id": "wJF5teyHvFbRqaiZA", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event.(trans.x) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ACWvQnbM5DZbd8eF6", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:51:42"}
{"_id": "YyiAqXjTD2J3AGHkv", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GqzetPNRM62a2Rx7E", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-11 00:21:28"}
{"_id": "fhFHdtACNKJJbSdxT", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  State in Event.(*(Init.trans)) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "xiMcPpiEgNSCNP7Ee", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:27:39"}
{"_id": "wDsk3W75NiTGTFDQt", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some s.(Init<:trans:>State)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7h3uG5h2GhCRDb6sZ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:11:25"}
{"_id": "KRY6gXQZM7sNhs2uD", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  \tall s : Init.*adj | some s.*adj <: Init\n}", "derivationOf": "78742mLeir5p8BFQZ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:52:23"}
{"_id": "nwm7Tcamyg8NnCEd5", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State, e1, e2 : Event | some e1.(s1.trans) and e2.(s2.trans) implies e1 = e2\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "v9b3oF6WMtKWM6hR4", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:31:00"}
{"_id": "guWCgjng4tE2CFjQA", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tState.trans in Event -> lone State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y: State | some (x.trans).y} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s,t:State | s.trans.State = t.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\n\npred inv6 {\n\tall e:Event | some (State.trans.State & e)\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet adj = {x,y: State | some (x.trans).y} | all s:Init.^adj | Init in s.^adj\n}", "derivationOf": "jQkjiYKHKieP8RwCe", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:29:31"}
{"_id": "okWCEXhrfSWLavMms", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | (s.trans).^Event = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mfyALXrLqpemRWWp5", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 12:12:55"}
{"_id": "AaBxzWji4M5FBYjMG", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  \tEvent.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "dzNxBNpmuzAzw8xJs", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-14 00:55:48"}
{"_id": "BhicdhRDZAXMbiGe9", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    iden in ^trans_bin . *trans_bin\n}", "derivationOf": "XYdH6GRzzBpuZD2YK", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:48:12"}
{"_id": "RDWuEpJxEpPfjkKHM", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n\tInit.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | Event = (s.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "wJHSZKTQeCm9WgN5d", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:40:43"}
{"_id": "vHGCAzx8MtR7jQPZd", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (s.trans <: e) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gdvyTNcDaqNwSwiE6", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:12:11"}
{"_id": "oGiMTtdoLkcmX6vTR", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | Event->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fTLanNPWeKriYq7Ar", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:16:19"}
{"_id": "d6SWBGQn6S6pHT8ex", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "w7s2GL4i2ZTFtNeqH", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 04:05:30"}
{"_id": "rY8ai4ToSCY4btsGA", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans in Event\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NKGfFbnMi86zCF2mK", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:45:30"}
{"_id": "7waPxtBDBmfpdzcWp", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | lone s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pKxS52xunTWWHEQYJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 01:41:55"}
{"_id": "HQzgGowCDXHdDZmP8", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all x : Event | some Init.(*(~(trans.x))) \n}", "derivationOf": "Tk56vQbGAzADk853G", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:26:48"}
{"_id": "bddhLYPnzCN52Cdwa", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | lone s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "faBQcTR2ikP2a47E8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 11:08:51"}
{"_id": "548XeAaAwYnd99Ywe", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | Event.(s.trans) in Event.(State.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EEX95gsswKYcziwk9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-18 22:17:13"}
{"_id": "7yLYxWFX66PzEKfPg", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 :State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State-Init | Init in Event.^(s.trans)\n}", "derivationOf": "dStAm2fTogjf4XykS", "msg": "^ s . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:21:34"}
{"_id": "8sqN37j8Z67JRQrkd", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "zhkHp8dPqRxg29uFx", "msg": "^ this/State . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-11 13:09:57"}
{"_id": "iETmfwHrrquQccsxL", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2: State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s: State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\nfun getEventsOfState[s1: State] : Event {\n  \t{ e: Event | some s2: State | s1->e->s2 in trans }\n}\n\npred inv5 {\n\tall s1, s2: State | getEventsOfState[s1] = getEventsOfState[s2]\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e: Event | some s: State | e in getEventsOfState[s]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\n\npred isReachableFromState[s: State, i: State] {\n  \ts in i.*onlyStates\n}\n\npred inv7 {\n\tall s : State | some i1,i2: Init | s.isReachableFromState[i1] implies i2.isReachableFromState[s]\n}", "derivationOf": "yNHfbZbvqNZ9hYBik", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": []}, "nodePositions": {"State0": {"x": 535.375, "y": 199.1999969482422}, "State1": {"x": 267.6875, "y": 199.1999969482422}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2020-1-2 18:23:29"}
{"_id": "9ATcPdTCME5JapEj4", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).^s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mLBJo7S765JcqsgE4", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:08:02"}
{"_id": "9ubZFmohyCanv4Zfe", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MeMdWzfbjwbC4xDCW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-12 20:53:06"}
{"_id": "9Seh4nB8oN8TxwtMH", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | s.trans in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fMAeQ37NP7xnqpcDn", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-30 18:44:55"}
{"_id": "Ebwc9BsdRQwPnGx4r", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  some s: State | sin s.^trans.State.Event = Init\n}", "derivationOf": "HrbnmzozfaYEmHdSt", "msg": "The name \"sin\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:59:24"}
{"_id": "zM7aCbvhYahhH547M", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 {all s:State | s in Init.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r :State | (r.trans).State = (s.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { all e: Event | some (trans.State).e\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {all s: in Init.^adj | some s.^adj & Init\n\n}", "derivationOf": "x9K93gzGNo3mPMSkk", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-20 22:30:24"}
{"_id": "C6hBRdAgBB4LCCE4Z", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tno s:State | no s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  \n  \tall s1,s2:Init | s1=s2\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rJPtqFiHsbCzBgCAu", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 15:40:13"}
{"_id": "qXAsnmzk5x3E7hyuB", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some (s.Event).^~trans :> Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3tnXEpi5G4FPJeSpn", "msg": "This cannot be a legal relational join where\nleft hand side is s (type = {this/State})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 20:46:57"}
{"_id": "KfDmmpA8Ya8zRhzir", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function[s: State]: State->State {\n  {s1, s2: State | s1->Event->s2 in trans}\n}\n\n\npred inv4 {\n\tall s: State | Init.^function[s]\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Fz3fPdK6Qp6TLS2To", "msg": "Name cannot be resolved; possible incorrect function/predicate call; perhaps you used ( ) when you should have used [ ]\n\nThis cannot be a correct call to fun this/function.\nThe parameters are\n  s: {this/State}\nso the arguments cannot be empty.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:58:00"}
{"_id": "Ny6NS8WfR2dZoRptY", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { some trans.State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-17 20:40:19"}
{"_id": "x3SAdosJ8yfhq6Fdw", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tlone Iinit\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HDsEtZgn76enNkhxh", "msg": "The name \"Iinit\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-9 03:23:12"}
{"_id": "Y7vx536DuH3QJMLtw", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in State -> State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Aw2R3GC8iNcchAL2n", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:22:20"}
{"_id": "t3ojga3xjHgDDdPqo", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "zkpWgDNQ72TTbA9aF", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:27:37"}
{"_id": "mNBYnWxY4C9vRu6EL", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  some i:Init | (State) in i.*adj\n\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pujR3tfLBTrWe4iJH", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:07:35"}
{"_id": "j3KwLSwEzEMmw546k", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7we4ybFPnbM6MAp2M", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:22:48"}
{"_id": "YbD56Ly7dnEX5pZJq", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = {x,y : State | some z : Event | x->z->y in trans} |\n  State in Init.(^t)\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  State in State.(trans.Event)\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9iTMohokcDrCmLWjh", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-18 13:19:33"}
{"_id": "FeZbtWWTMwxr7hpk3", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-7 03:28:05"}
{"_id": "P5aaXxJZ3sBSTfjse", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone State && no trans\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZHfJR2Ay9Ha5z4RS3", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 11:56:45"}
{"_id": "WZeAc7KYA46gcb4uf", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  \tall s : Init.*adj | some s.^adj <: Init\n}", "derivationOf": "KRY6gXQZM7sNhs2uD", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:52:37"}
{"_id": "9tfSgd3y4cds8BxQx", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one s : State | no trans.s\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iJxQ9htQDJ3j3kJYD", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 15:45:25"}
{"_id": "pnD6Mjc684rcSNCyo", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "o3ceypBXNT94SPLPz", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:51:03"}
{"_id": "YxYf6RcXzEpjyM9fq", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "tiMaHRjqyKbEdd5DP", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:05:14"}
{"_id": "cx54hxD9xyzoAtMxv", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t(Event.(State.trans)).~(Event.(State.trans)) in iden\n}", "derivationOf": "4wJkRwFkoHWC7eYPw", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 14:21:28"}
{"_id": "mwZtWSg3hjo97sPK3", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | all e : Event | x->e->y in trans implies y->e->y in trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "xMhvuBNDAe8baH43X", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:26:58"}
{"_id": "5A6yru5NoY96Eh37A", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates[] : set State -> State {\n  \t{ s1,s2 : State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s : State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xJLpvz6oLFSB4MrWL", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-2 18:02:53"}
{"_id": "mqQuos5H6GQBSv375", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s: State.trans.Event | s.^{y,x: State | some x.trans.y} = Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "uKud5aRKmNAAhNvwm", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:09:23"}
{"_id": "Npnq7XEL9JcuwNN2e", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlet R = State.trans | iden in ~R.R \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tmtJfbPQfqPLjZ4os", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-4 16:51:34"}
{"_id": "WzbKHz3TphmwaQfPj", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 {all s:State | s in Init.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r :State | (r.trans).State = (s.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { all e: Event | some State.(trans.e)\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4HuoLaozsuEc4ZwcS", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 22:23:10"}
{"_id": "HNdZgYsDLWumWJCYy", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | all s: State | Init.trans->s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Shr45XnrgMPfQDybF", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:09:39"}
{"_id": "Aw2R3GC8iNcchAL2n", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in State.trans -> State.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KzDHvwr4huw4irbQZ", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:21:51"}
{"_id": "EZbYg457twcpYzGAx", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | some (i.trans).Event.(trans.s)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "rDQ7upKiT2YkKSPDs", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-14 00:50:13"}
{"_id": "27hdF3av9iaTME2FH", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i:Init | State in Event.(^i.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nzu2YKhNmN3pfv78j", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:48:25"}
{"_id": "z6juYfxKACjeX5E57", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone s.trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2w39iizvknC2B6jP8", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-11 00:09:11"}
{"_id": "trBwhudo7aB27Khu2", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | one i:Init | i in (^trans.s).Event\n}", "derivationOf": "ya8CMHQupZ43pE5pE", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:56:51"}
{"_id": "MPPgdMgWYB7tuHBJj", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t Init.*trans in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CsBR5ygr4zG7Y73HW", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 22:00:58"}
{"_id": "nouSZ8cM6M7jvpccF", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tState->Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "29Lpp3PbpFZ8hngED", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-24 11:08:09"}
{"_id": "pynEjaSu5Ci9hsASb", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Y52ivaPY37iuC776n", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:11:00"}
{"_id": "zbLdqA3q6LkKaXiwk", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pJhYnqomuDcHsYvqo", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-12-30 17:26:28"}
{"_id": "ycfgRit8w3XrHK58u", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | Init.trans in trans implies e->s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Q3SvTwfaCYcKzCFw7", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:28:02"}
{"_id": "iy5uHRXRbmSMCuund", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans = State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "mcSTDobzmh8mF5Qwg", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:17:44"}
{"_id": "aD6ZRrh76uyKjJuYG", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "eCnxjJi2ko6CmGHFk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 18:33:05"}
{"_id": "x9K93gzGNo3mPMSkk", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 {all s:State | s in Init.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r :State | (r.trans).State = (s.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { all e: Event | some (trans.State).e\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { Init in State.*adj\n\n}", "derivationOf": "nNB6rwwdNYp6fAnm4", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 22:27:08"}
{"_id": "TpRbguLkCssWMzyy2", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | some e : Event | s1->e->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.^tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e : Event | some s : State | some s.trans[e]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : Init.^tr | some i : Init | i in s.^tr\n}", "derivationOf": "xS6mBeCxSoaQ7nohQ", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": [{"parent": "State", "type": "this/Init:State"}]}, "nodePositions": {"State0": {"x": 363.90555826822913, "y": 199.08334350585938}, "State1": {"x": 727.8111165364584, "y": 199.08334350585938}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2019-10-8 16:17:21"}
{"_id": "dgEDvcxFaPTip8A6Y", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MaXfpMXMHHNykJQWf", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-12-30 17:19:16"}
{"_id": "oNheSkZPiMPSGNmnp", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State, e: Event | lone e.s.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sAmcrfZ7PE3eH2wE3", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-20 22:11:21"}
{"_id": "nzu2YKhNmN3pfv78j", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i:Init | State in Event.(i.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KoHGQzjFu5Jvhvndi", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:48:16"}
{"_id": "i8sjvFERPQYNixKah", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some s.^~trans :> Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ppPGfBw94sXXppuxS", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 15:51:55"}
{"_id": "z7aSk2cpwNLZS77Wq", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tlone trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "S6PRc3FayKHoDMBdW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 18:15:47"}
{"_id": "DgwYWaYw735etqzCr", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "D5Rfyn7EC4iC5aerY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 20:09:30"}
{"_id": "CsBR5ygr4zG7Y73HW", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t Init.*(Event.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yTeG2tnQkYuXDgGB9", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 22:00:25"}
{"_id": "rDQ7upKiT2YkKSPDs", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | some i.trans.Event.trans.s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "fYeoemZgL4D44Lgtn", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-14 00:49:55"}
{"_id": "E3tkF56R4wpSRgW2Y", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  all i: Init.^adj|  (some Init in i.^adj )\n  \n\t\n}", "derivationOf": "tNvYxzmyxMJoNgG82", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 10:50:58"}
{"_id": "HC6KTyPFQLPZ85kQW", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tsome State->Event->State \n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NvpSWnkP32yQxwGZG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:55:29"}
{"_id": "f4gHaZRjx8ZQRWr4i", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Init.(^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bu5s6N9bm98JdSwCy", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:41:21"}
{"_id": "cmDtozi8cbMPGFp94", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State, e1,e2:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans or s1->e2->s1 in trans\n}", "derivationOf": "k5q7HurDZC7RydD3X", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:41:15"}
{"_id": "jSX9xuPHPgckFHHS2", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Cy4cuuBkwmsPsqfdP", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-12 19:40:25"}
{"_id": "XEuu6HgZQqJvEFQMe", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj={x,y:State | some e:Event |x->e->y in trans}\n  \n  all i:Init |(State-Init) in i.^adj\n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7KXGvRxp3Bcc5x7Zs", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 08:59:50"}
{"_id": "teHeCx8mLG7vDGwps", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | all (e->ns) : s.trans | no s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | one s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "L3qh8WLEtmBQaMH2d", "msg": "The \"all x\" construct is no longer supported. If you know the range of possible values of x, consider rewriting it as \"x == set_of_all_possible_values\".", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 09:37:11"}
{"_id": "ogcLYccn7Fee3rnPu", "cmd_i": 2, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all e : Event | State in trans.(e -> State)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "wJFTb3Znh63WRRZza", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:10:54"}
{"_id": "KeYd57CsqX263zb64", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall t : trans | Init in State.^{x,y : State | some (x.t).y} \n}", "derivationOf": "pch67N9vunJqAFmv6", "msg": "Analysis cannot be performed since it requires higher-order quantification that could not be skolemized.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:13:31"}
{"_id": "7we4ybFPnbM6MAp2M", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kjo6uXwNJcEPqqLok", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:22:43"}
{"_id": "j9uSSMrhwfjhAMbGp", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, e:Event | all s->e in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aP7SMS4ooxCPjqpSt", "msg": "The \"all x\" construct is no longer supported. If you know the range of possible values of x, consider rewriting it as \"x == set_of_all_possible_values\".", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 20:37:11"}
{"_id": "vPcpJWvu26Xcitnqy", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i : Init | State in i<:trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8dzwgtNZyTwzzWQHz", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:04:36"}
{"_id": "6SCXJ5geAENdNehTa", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n  all s : State | one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "roGvSpeEs6BZXWWL2", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 09:37:45"}
{"_id": "EiKfw3X8Dsek8RK7D", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.trans.s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cvPtsZmn4aAhei4YC", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 16:59:22"}
{"_id": "NWf9jj5k8tx9Ai44x", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 :State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State-Init | Init in Event.(s.trans)\n}", "derivationOf": "7yLYxWFX66PzEKfPg", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:21:42"}
{"_id": "sPSx3jCWvPtRAiHjb", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    State = trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WRMQMhXahWn6nZ2PY", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 00:51:03"}
{"_id": "cnqpxcfYczWt8Qau7", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-9 02:25:51"}
{"_id": "9ma37exsFHs2duBXa", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some e : Event | x.e->State = State.e->Stat\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "5Kv5uuavFAHnmFZ7F", "msg": "This cannot be a legal relational join where\nleft hand side is x (type = {this/State})\nright hand side is e (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 14:18:38"}
{"_id": "XPyhBFSgutNnFKT8C", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  Init in ^(Init.trans)\n}", "derivationOf": "c3QMKKTsMzX8w2Qxf", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 18:05:13"}
{"_id": "FEgQ296ekcqrF5PZC", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 22:36:52"}
{"_id": "Tj7uHYRaNNXfCtZGD", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 09:48:17"}
{"_id": "qveybDzJuSBR8dZnJ", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | s.trans in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "27JYnT6faL3guYvTi", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": []}, "nodePositions": {"State": {"x": 492.328125, "y": 199}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2020-11-30 19:47:08"}
{"_id": "FbQaY2BLQsoB46cW5", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "f4gHaZRjx8ZQRWr4i", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:42:01"}
{"_id": "Wcym9JMND6suBNtny", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init in (Init.^trans2 + Init->Init)\n}", "derivationOf": "g3FQNENuHwoMBRHb5", "msg": "+ can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/State}\nRight type = {this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:59:50"}
{"_id": "gsvdfEoqsWqvZtsm3", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  no Init  implies no State and (some e:Event | all s:(State-Init) | some (Init & trans.(e->s)) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3Xh6hhFxqzK8ymh6z", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 14:21:53"}
{"_id": "QudyobGjn8jmYAjJK", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "gw53dfwNfnepJMhYH", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 03:00:33"}
{"_id": "3AawGQoGM5WSaA7zS", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n\tInit.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent = State.(trans.State)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "pxjRwni2QyxFZeFT4", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:38:42"}
{"_id": "membjtCyCcNXpaoFd", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (s->e & State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "& is irrelevant because the two subexpressions are always disjoint.\nLeft type = {this/State->this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 02:45:12"}
{"_id": "g59znePYjELeGcp2t", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t all s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fZev9vpP4wfb3GfFv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:35:24"}
{"_id": "fTLanNPWeKriYq7Ar", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | Event->s in ^trans.Init \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ThGGCNSpP2yXSRXqZ", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 00:16:08"}
{"_id": "nGWZ5w6oK9zDtFACy", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall x : State, y : Event | lone y.(x.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "uL7HXbawRFBbDuMbb", "msg": "\"State\" is already the name of a sig/parameter in this module.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 09:58:59"}
{"_id": "hpCji23viLJZpJR7C", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "M4iprMBMqJ7s7WcsL", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 23:28:46"}
{"_id": "DCn64uDPKRsBwhxos", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\nfun onlyStates : set (State->State) {\n\t{ s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t(all s : State.^onlyStates | Init in s.^onlyStates)\n}", "derivationOf": "4ZqBLsMcGwHY6PXhQ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 01:15:20"}
{"_id": "hiBEfhh6pkYCQzugt", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone trans.s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "r2gWF7J4bEvKbEz2F", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 11:11:59"}
{"_id": "ADCKjFY6uF4TK9wXP", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | Init in ^(~s.trans)\n}", "derivationOf": "SEcxYEizYaMsaZYEM", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:28:31"}
{"_id": "7HQmWGyDX5bXWkX7z", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tno Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "d7RehKuXGN55FjTdX", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-30 18:38:59"}
{"_id": "5DC8xKEp3ueQpTidN", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  {s1, s2: State | s1->Event->s2 in trans}\n}\n\n\npred inv4 {\n\tall s: State | Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "asNidowAafY5ALgNR", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:56:38"}
{"_id": "SRPC3rN3kk7babA3a", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | one e.s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bQ72WdJsYMZuknkni", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:34:59"}
{"_id": "8CmhPzMgTZ9iYPAYL", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t Init.Event.*trans in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MPPgdMgWYB7tuHBJj", "msg": "This cannot be a legal relational join where\nleft hand side is this/Init (type = {this/State})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 22:01:30"}
{"_id": "GbwX8E8ycP7WwhPZY", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | lone s.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sQC7XNZfEQvqAJwjT", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 02:29:58"}
{"_id": "mvJpnAc9BbCRyXoQR", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, s1:State,e:Event, t:trans | s->e in s1.trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9SJsYDq6LMZzeJXwy", "msg": "Analysis cannot be performed since it requires higher-order quantification that could not be skolemized.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 12:18:20"}
{"_id": "Ah4hevXBsjWyPpeH9", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | Init in ~s\n}", "derivationOf": "uCSYEsoKjaLfABq6m", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:29:35"}
{"_id": "dcS969NLLybm9MYLo", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : Event | State in y.*(x.trans) + x\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7T8uqzJYKhfHpLuR5", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:26:09"}
{"_id": "goDJrqg28pgdLPxvR", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7waPxtBDBmfpdzcWp", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 01:42:11"}
{"_id": "9iTMohokcDrCmLWjh", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = {x,y : State | some z : Event | x->z->y in trans} |\n  State in Init.(^t)\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  State in State.(trans.Event)\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-18 13:19:19"}
{"_id": "4hyFThRypAjg3xs5r", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State| lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i: Init | Event.(i.trans) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ouSrsb84Ma7MBriQR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:28:00"}
{"_id": "JkSMThyAs2gK5WTuk", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  all s : State | lone s.Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6QKchCMHyhakP5pxp", "msg": "This cannot be a legal relational join where\nleft hand side is s (type = {this/State})\nright hand side is this/Init (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:09:13"}
{"_id": "bJjsBPYkJ69pFFAzc", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State| lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall e: Event | e.(Init.trans) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8sC2fJwW3ugtEYpc7", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:25:45"}
{"_id": "3D2XuHggecRr7cENd", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  let trans_bin = {s1, s2 : State | some s1.trans.s2} | Init in Init.*trans_bin.*trans_bin\n}", "derivationOf": "GxugYSiLPfvYGn36L", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:22:05"}
{"_id": "syLrY6aAmvGgXpoHC", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some trans.s\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "uBtKk66kSb84fqe24", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:54:34"}
{"_id": "y8H7pGhdfALCzy5wp", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "PQ9anQQHCw9HPzB3J", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:27:31"}
{"_id": "piAcF4qtYFJxLDMzp", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s,p:State | s.trans in Event & p.trans in Event implies s=p\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DWrJ5GjX5GajKPK6R", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-15 16:53:07"}
{"_id": "cqF99ZbLmu5EACeBK", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState-Init in Event.Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NjZ7JLWdTBFKQAHYb", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is this/Init (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-13 00:11:41"}
{"_id": "W8GXHnkmb9RjwSvAM", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlet k = ~trans.State | k.~k in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FSYsPaBoM36KnkXxm", "msg": "This expression failed to be typechecked line 31, column 6, filename=/tmp/alloy_heredoc13298842102401356247.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:57:54"}
{"_id": "Wyysoa5JPMTun3hcT", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State , e:Event | some e->s in s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gugzAq9sNQ6SFai2X", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 11:52:11"}
{"_id": "afwwZwpS5o3StiYbe", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1:State | Init in (s1.trans).State\n}", "derivationOf": "vyMmCWaPZ6dpZt3fo", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:12:47"}
{"_id": "hkhLE83KC9kAMaWnG", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6gNFFDsocvqq4QMfF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-30 18:40:56"}
{"_id": "sJiHzjbBbDW332RSR", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  all x, y : Init | some x implies x = y\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HzvYQequW96PPmb2Z", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 21:43:38"}
{"_id": "jj6Hu75EyD6wqozNo", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s1,s2:State, e:Event | lone  (s1->e->s2) in trans \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KY3GWvz9BYCzqAoaE", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 14:04:00"}
{"_id": "kEHq5JfnM4hWgvFEn", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init | State in Event.*(x.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pAKjq9MkZQq9yzigE", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:13:14"}
{"_id": "PykXkSmjQewwJ3FN7", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n some State\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DrcR5c95TaTaFNQfW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-4-21 20:43:31"}
{"_id": "s9unoypig8vRE4aro", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, e : Event | State in e.^(s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SXnJjdCuiAXQZqvCK", "msg": "^ s . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 18:52:39"}
{"_id": "k5q7HurDZC7RydD3X", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State, e1,e2:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans\n}", "derivationOf": "5fDJsB5H97BXayAYT", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:40:01"}
{"_id": "3qQLNTKuvqPHNH2fz", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "q2Fi8uWEL8rK7QrzG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 18:06:55"}
{"_id": "25YgHqaWAmvG8Wim4", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, e:Event | some e.(s.trans)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "2YBkc5LiQsFxLF8kr", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": []}, "nodePositions": {"State": {"x": 513.5999755859375, "y": 199.13333129882812}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2020-11-18 22:18:15"}
{"_id": "v5ECM2zEtsQNdXhpa", "cmd_i": 0, "code": "\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tState.trans in Event -> lone State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y: State | some (x.trans).y} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s,t:State | s.trans.State = t.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\n\npred inv6 {\n\tall e:Event | some (State.trans.State & e)\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet adj = {x,y: State | some (x.trans).y} | all s:Init.^adj | Init in s.^adj\n}", "derivationOf": "8JskK3TqDYrGjrnWu", "msg": "The name \"State\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:26:11"}
{"_id": "PCMntnEepLxx5Ddmx", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | some trans.s implies (s.~^trans) :> Init\n}", "derivationOf": "ucTyj4rhP3HzZnEPR", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 21:58:14"}
{"_id": "wLe2q5gu9ZuwGzBG7", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | Event = s.(State->Event)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6AiirsS2j7jdASYdk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-24 11:14:55"}
{"_id": "iRjNwrAZanRqCMqAv", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, e : Event | s in e.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-12-30 20:17:55"}
{"_id": "jjGd5zdP3MmbmMBp9", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State, e : Event | some State->e->State \n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HC6KTyPFQLPZ85kQW", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:55:35"}
{"_id": "3tnXEpi5G4FPJeSpn", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, e:Event | some s->e in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "j9uSSMrhwfjhAMbGp", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 20:37:19"}
{"_id": "d6QGvmZgPXoQ2DcYP", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i:Init | State in Event.(i.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9rS4kQ62Ku5u48cSz", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:47:51"}
{"_id": "nrHstFNwcYE3Bb2R9", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | some (s.trans).Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "X6rkQ3ci5Sr4hn9Hc", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 11:55:12"}
{"_id": "5rpfiHHbcP5vPgr3r", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State, e: Event | lone e.(s.trans)\n  \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\npred inv4 { all s : State | some i: Init | s in i.^adj \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r:State | (s.trans).State = (r.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { \nall e: Event | some s: State| e in (s.trans).State \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nDqTAxTxne84QjYe4", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-18 12:13:42"}
{"_id": "2xXZsZ3FkYeZkNHGd", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { (s1, s2) : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "4fSJgRicdiExsDy4x", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-23 04:18:44"}
{"_id": "Y9AQ6Hkgs9ZmWBJmj", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wvbsTZ5CvxG5TPbdr", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-4 16:45:44"}
{"_id": "4hukhzBcCwfoLZnSy", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e : Event | lone e.(s.trans) \n\n}\n\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { all s: State | some i: Init | s in i.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r : State | (s.trans).State = (r.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { all e : Event | some (trans.State).e\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aZSAHJXjv6cKSskRo", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-9 18:31:42"}
{"_id": "pmCPoXEgwsPPoi5PW", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wGYuvEizfpkpRCNjM", "msg": "The name \"s\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 03:03:47"}
{"_id": "wNmGjQKJNBNq6NrRn", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome trans.State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "S6HaQ3CsrpMnGxvji", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-19 15:22:20"}
{"_id": "KeKRN2yHsfKSt4TjD", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \talways (trans.(Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ovHJcAHiAXwPoxXhT", "msg": "This expression failed to be typechecked line 18, column 4, filename=/tmp/alloy_heredoc11480406600808451926.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 20:00:57"}
{"_id": "AiaRYJ9v4mMyyTx8p", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/ \npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t~(State.trans).(State.trans) in iden \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TAgXkCL4GLxYh9b6i", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-4 17:26:23"}
{"_id": "oh5EG9w5gngREdt2e", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans}\n  all u : Init | State in u.*t\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sacuTiMDReDCvWu6a", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:42:41"}
{"_id": "2JA3Pdv942ZiXc2kn", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4D7mRnuBP8zPGGZBP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-9 03:26:50"}
{"_id": "uEwJQSqrpjHqgxqzP", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State , e:Event| lone e->State & s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, s1:State | s.trans.State = s1.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | Init in s.~^trans\n}", "derivationOf": "rcze4EX8R2uRgQqkZ", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 21:40:27"}
{"_id": "2Y6zgWyXNBmk6N2xi", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:25:33"}
{"_id": "v9b3oF6WMtKWM6hR4", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | some e : Event | one e.(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4HWond3ZM2t5gL7ri", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:29:38"}
{"_id": "bCm7mvtqYzmBq6h4K", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in ^(Event.(Init.trans)).trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3x3jZ7NXPFX6eXPnm", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-13 00:05:10"}
{"_id": "GNfSjc3d5j6mjmfnE", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 :State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KfLhft5cB8i7yZHsJ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:20:35"}
{"_id": "peqf5AR36fxcPczDK", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State |some e: Event | s.trans implies lone e->s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RaBTqxMWWRKQTYSAy", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 20:46:06"}
{"_id": "nasB3wepJ3LAwRmKZ", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Z3xfe5EEuZyv5AwBY", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-15 16:07:25"}
{"_id": "w3gJJYNJP3zM2YnDD", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    lone State.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "oHL9eSjinZT7rmMJe", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:11:51"}
{"_id": "wDL78Ymv4k5dqLSr6", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | some e : Event | s1->e->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.^tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e : Event | some s : State | some s.trans[e]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : Init.^tr | s.^tr in Init\n}", "derivationOf": "mf8Wbx83o7AXot3gJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 16:15:51"}
{"_id": "y2iGZ8835TYZpf5yX", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\nall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 14:59:57"}
{"_id": "yRXaYjmhfx2Gb3tdx", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:(State-Init) | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | State.(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Lqq32z3S3XK3mevd3", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:55:08"}
{"_id": "ddCb8xbCypqxkdPZq", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    all i : Init, s : State | some i.(*{s1, s2 : State | s1->Event->s2 in trans}).s\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "qkrx2AZpMbyKbuNNA", "msg": "This cannot be a legal relational join where\nleft hand side is i . * {s1,s2 | s1 -> this/Event -> s2 in (this/State <: trans)} (type = {univ})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:36:55"}
{"_id": "9sCn6J5pPcgR6Hcmi", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-21 18:42:08"}
{"_id": "arvHgQQPePux2sB65", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | lone e : Event | s.e.S\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GbwX8E8ycP7WwhPZY", "msg": "This cannot be a legal relational join where\nleft hand side is s (type = {this/State})\nright hand side is e (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 02:31:44"}
{"_id": "8sC2fJwW3ugtEYpc7", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State| some s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mBejRmSrPaW8jB7ks", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:10:43"}
{"_id": "phHMyFjzPwxutCQ6d", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.^(trans.State)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "yLpFvhAPGELvhAGZx", "msg": "^ (this/State <: trans) . this/State is redundant since its domain and range are disjoint: {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 03:43:12"}
{"_id": "4xn4BaJnvdygS5vcW", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QBz636MDCWS5Akxud", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-11 00:51:52"}
{"_id": "yNHfbZbvqNZ9hYBik", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2: State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s: State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\nfun getEventsOfState[s1: State] : Event {\n  \t{ e: Event | some s2: State | s1->e->s2 in trans }\n}\n\npred inv5 {\n\tall s1, s2: State | getEventsOfState[s1] = getEventsOfState[s2]\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e: Event | some s: State | e in getEventsOfState[s]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\n\npred isReachableFromState[s: State, i: State] {\n  \ts in i.*onlyStates\n}\n\npred inv7 {\n\tall s : State | some i1,i2: Init | s.isReachableFromState[i1] implies i2.isReachableFromState[s]\n}", "derivationOf": "XnJF4qDukmnCX9E9D", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-2 18:23:18"}
{"_id": "2LyfDc9bRCz2gKsro", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in Event -> State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Y7vx536DuH3QJMLtw", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:22:31"}
{"_id": "Bcca54qoM79L8S7r8", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init | State in Event.*(x.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "eoXqNDJSnaHk4yxDA", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:05:21"}
{"_id": "o9nnzKLMwiYhrRDRi", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nxoRaLfFZgZJGQJwt", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:19:34"}
{"_id": "hRBecyyKPwtabqxh2", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\nall s: State | all e : Event | lone n: State | e->n in s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\nall s1, s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "q4rzHC7g87RWpqpf4", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-7 21:41:21"}
{"_id": "ZgagwycjpnePYQfpd", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.trans[Event]\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "opHPQqG85XjKNXWo7", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-9-12 09:50:58"}
{"_id": "yRb7NBTyvAx5qWM7d", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LMn35DPrPmdmL29Gk", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 17:05:50"}
{"_id": "PsYewngzku5RTsRWL", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "euTJebYuEZSoDctjJ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 03:34:45"}
{"_id": "BWTEizEF7w8vixzo6", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | State in Init.*(s<:trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "5oEzyNBpx2yDcSAyG", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:43:23"}
{"_id": "AwmACdjtu8CeKdamM", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in s.*{x,y: State | some y.trans.x}\n}", "derivationOf": "jFW5imsvSTa7kv2ki", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:41:49"}
{"_id": "meHnNRa3FSujcNhmx", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "fqCDuSGnit4sWnc2M", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 02:09:44"}
{"_id": "6zSjBGu7joGpDDmdq", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet adj = { s1, s2 : State | some e : Event | s1->e->s2 in trans} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some (trans.State).e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3Hpc75YM57AvdaABY", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-3 11:18:21"}
{"_id": "zyud9fbW2JhRRHZ7a", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.(^{ x : State, y : State | some e : Event | x->e->y in trans})\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n\n}", "derivationOf": "KkJpwgM95hxbqiosN", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 11:00:21"}
{"_id": "e6ytbJzhxKTTzhgJr", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.(^{ s, ns : State | s->Event->ns in trans }) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | s.(trans.State) = State.(trans.State)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.(trans.State) = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t((State - Init) -> State) in ^{ s, ns : State | s->Event->ns in trans }\n}", "derivationOf": "csGja5A9mYzdBwBs4", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:35:39"}
{"_id": "Sqw7pYKh6HH8YMPWb", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | State.(x.trans) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HtB3PSrCuEsmSWqSC", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:48:53"}
{"_id": "Ed3rK3sX9dH994t6B", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "b6xth6LtCwMi4jz3N", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:25:56"}
{"_id": "gJJPT7PWqy8Mj76ZY", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init | s in (i.trans)->State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "K4mGS8F5NQBoXWkLD", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:50:53"}
{"_id": "rJJGHCL6DPaYK2gSa", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s :> Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "q2Fi8uWEL8rK7QrzG", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 19:33:18"}
{"_id": "ypKHbYbhgYui7FyEh", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tEvent.trans in State.*trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bDqfwBKmFTuFnmbH4", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 21:53:18"}
{"_id": "Mpken94J2756tuKM2", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s1 : State | some s1.State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (s.trans <: e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | s in Init.*trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": [{"parent": "State", "type": "this/Init:State"}]}, "nodePositions": {}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2020-11-5 10:24:17"}
{"_id": "LJCPEuTCBCYnBmtQt", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ev2SkCieS93GrgGGg", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-14 09:04:25"}
{"_id": "rA6Thnhn5rG66Xob3", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7L9rvA7mZBXLd8fPP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 03:27:30"}
{"_id": "wWPckeoSjZ3579cyG", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | some ~trans\n}", "derivationOf": "Ah4hevXBsjWyPpeH9", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:30:12"}
{"_id": "Lcz62K52ugyFpt3vL", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | lone e : Event \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "arvHgQQPePux2sB65", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 02:31:57"}
{"_id": "YXdw55uKK27ZFDEyi", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dw9pqph6JWDwWiQ6H", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 03:04:24"}
{"_id": "u5ZXTP8rigeRwJ3YH", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "NDbav4v9jxif8Lns3", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 14:24:18"}
{"_id": "Z2n4QYzmYdWC9pEpP", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in Node.^trans.n\n}", "derivationOf": "K4tkDweK7JtGyaKfa", "msg": "The name \"Node\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-11 13:09:32"}
{"_id": "boai9cvQMzX3jyWyR", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  all x : State, y : Init, z : Event | trans in y one -> one z one -> one x and z != y\n}", "derivationOf": "9PCRRK95bPmRMGF94", "msg": "== is redundant, because the left and right expressions are always disjoint.\nLeft type = {this/Event}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:41:13"}
{"_id": "mHkuJt7AA6yYMQ5p3", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.*adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tInit in Init.*adj \n}", "derivationOf": "QQmeDTbQAFiYhYaHx", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:50:53"}
{"_id": "Ft6Fb5miKB5xdQwiD", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LW7YbJuSHKR36vXvT", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-11 00:23:22"}
{"_id": "QpCsnTX8k9w8kd7pF", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | Init in ^(~trans<:s)\n}", "derivationOf": "86ftTyN4avwubhTcB", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:28:02"}
{"_id": "2Qmfr9KAah8qTzS2K", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  State in Event.(*(Init.trans)) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "LNLB9WouvGLJgtL5q", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 14:33:35"}
{"_id": "F3kKcj2Xmx8zMhtJ8", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | some e : Event | lone (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  State.trans = Event->State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DqRFTpw2CBhhKgc2T", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:23:46"}
{"_id": "FbQvdyJZhNjeGuSfP", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State,\n  \t\tsucc : set State\n}\nsig Init in State {}\nsig Event {}\n\npred x {\n\tall s1,s2:State | s1->s2 in succ iff some y:Event | s1->y->s2 in trans\n}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tx implies (all s:State | some i:Init | s in i.^succ)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LLzGGeWBSCboFK6KT", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 16:05:37"}
{"_id": "tsoRMzFknvPJDKPbP", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State.trans, e : Event | lone s.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fWcBf2AZxgAbaLhFD", "msg": "Analysis cannot be performed since it requires higher-order quantification that could not be skolemized.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:17:55"}
{"_id": "rBX5QCD3WPBBLfokZ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    all i : Init, s : State | s in i.(*{s1, s2 : State | s1->Event->s2 in trans})\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "ddCb8xbCypqxkdPZq", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:37:10"}
{"_id": "z7MxrjeYqyZZN6m7G", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "u5ZXTP8rigeRwJ3YH", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 14:24:21"}
{"_id": "gnAjh2k39bxuyDxk6", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n\t\n}\n\n/*\nAll the states have the same events available.\n*/ \npred inv5 {\n\tall disj s1,s2 :State |  no ((s1.trans).State) -((s2.trans).State) and no ((s2.trans).State) - ((s1.trans).State)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n\tall s:State | some trans.s implies (s.trans).^Event :> Init\n}", "derivationOf": "dWrg8h7JbwWCHx3cz", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:10:28"}
{"_id": "S6PRc3FayKHoDMBdW", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tlone trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3sWffFbixcJZhurpJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 18:15:37"}
{"_id": "NChKsRpqcpR7fZDwK", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { all x,y : State | some z : Event | x->z->y in trans} | State in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "sFcXzPYzB8kvgbhmY", "msg": "This expression failed to be typechecked line 38, column 83, filename=/tmp/alloy_heredoc9915699586077614006.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-23 04:13:20"}
{"_id": "EmnuL3HKYbGyDBmoc", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s: State | s in Init.^(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6TGFHHfwLyvNFcshN", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-12-31 18:23:51"}
{"_id": "xRDCokKY5AKG2qPLd", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event |  some e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zwFA43sP8TqZpkGDZ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:05:57"}
{"_id": "h9c8iudBkceXWMGNe", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 17:42:59"}
{"_id": "A9JdJzdHAesKstCrC", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "n2ySZpMBrCyWndW8c", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 09:58:37"}
{"_id": "Fh9JffCarEZgkNEgB", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PuvvgmjxmAwkL2AWg", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 14:41:25"}
{"_id": "4uQiB32jNfQ27NTbw", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2: State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s: State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\nfun getEventsOfState[s1: State] : Event {\n  \t{ e: Event | some s2: State | s1->e->s2 in trans }\n}\n\npred inv5 {\n\tall s1, s2: State | getEventsOfState[s1] = getEventsOfState[s2]\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e: Event | some s: State | e in getEventsOfState[s]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Zf5re76h7pgsaCuYz", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-2 18:13:35"}
{"_id": "QQZ9eHWE8cLisFa7K", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e : Event | lone e.(s.trans) \n\n}\n\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { all s: State | some i: Init | s in i.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r : State | (s.trans).State = (r.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QJzRP56vQdBhTMZSv", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-9 18:25:00"}
{"_id": "Ddvznvk4BXwnz6bRD", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.^(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xBDk9ByFLR3NAkgTz", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:14:50"}
{"_id": "fgzd75eR2NGdSykJS", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans}\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState-Init in Init.*adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "eNcsHgDWCoxii4LBB", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:40:57"}
{"_id": "QsMHxNyajGm773xrC", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Initial\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TMYXCN9hMHDvKKEp3", "msg": "The name \"Initial\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 13:15:28"}
{"_id": "hejepivd6KtXDGeK7", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "v5zL7K3AjWRxHeSH4", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-8 15:14:59"}
{"_id": "YbwpkYRhn3QF5RJR2", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-29 11:20:09"}
{"_id": "TgWRY4C2oLuSMufWg", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init | s in i.trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "z8CvNxBt4yWbm2dT3", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:50:10"}
{"_id": "8FGe3r8EmFS4rqMF3", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bN4Scnn7Rf6acCfYA", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-30 18:39:10"}
{"_id": "6Xe2kwLy3zskPNwun", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s.^(s.trans) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cK6BjMFuiMBia5eXz", "msg": "^ s . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:11:30"}
{"_id": "rFRtfzDoLFtNgZKmL", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init in Init.^trans2 + Init\n}", "derivationOf": "LYRu3dMJRFP7rRPNS", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:58:12"}
{"_id": "KoHGQzjFu5Jvhvndi", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i:Init | State in Event.^(i.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "d6QGvmZgPXoQ2DcYP", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:48:02"}
{"_id": "xXsjAmkJykeXmecsd", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  State in Event.(*(Init.trans)) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "2Qmfr9KAah8qTzS2K", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:33:54"}
{"_id": "SW8Awa2HxoBReHqhn", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fzDPM56S7AYCcxSxi", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 20:10:41"}
{"_id": "E6rRWKwQnQvXZF3ZW", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bddhLYPnzCN52Cdwa", "msg": "The name \"s\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 11:09:05"}
{"_id": "4J5bb9FZg7iAGzF3D", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some (s.Event.^~trans):>Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aG5KKgzMcFsrf2ahs", "msg": "This cannot be a legal relational join where\nleft hand side is s (type = {this/State})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 15:55:25"}
{"_id": "mATsbQiZioHqYqxys", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone trans.Event\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "72MXomtJWXxxnT25v", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-15 16:37:25"}
{"_id": "Bmohca9Tuot8ma64x", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all e : Event | State->State in trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "rGRMeZ3iFMagdYYT3", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:15:17"}
{"_id": "tmtJfbPQfqPLjZ4os", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlet R = State.trans | ~R.R in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Y9AQ6Hkgs9ZmWBJmj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-4 16:50:04"}
{"_id": "fenbW3tmDf2Jjmn5y", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-6-5 10:00:49"}
{"_id": "bvrL52qnxHsj7ysFk", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone (e.(s.trans))\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "u5ugAfpSzii2FddQu", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 19:19:23"}
{"_id": "zkpWgDNQ72TTbA9aF", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "HH2gAJLE3YGz49xdH", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:27:35"}
{"_id": "nNXPZKszrA8HJXuWK", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 {all s:State | s in Init.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Rm6Gdb7bENcxS7GFR", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-20 22:15:55"}
{"_id": "HjFHt5S75i9aoBHgw", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init <: trans | State in ^(s.trans.Event)\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "dXGCo8RkNv5PkZATC", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:46:00"}
{"_id": "pGnGWAN3WANKrdj3n", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet r = State->trans | iden in ~r.r\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "u2qJrQqTkSGvfZNkp", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 09:14:59"}
{"_id": "v7EBRGmMbhPtc8hKv", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | some s.(i <: trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iJmPgAb8qLwhB9Eei", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:12:55"}
{"_id": "u4eTaidT4h8vq3b9X", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  (trans.State).~(trans.State) in iden\n}\n\n\npred inv7 {\n\n}", "derivationOf": "3FANo9apJfBb9HYJb", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:42:14"}
{"_id": "dkxaZWsg9ACDQRrh3", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-18 11:57:01"}
{"_id": "MqHDhQLzT9QpAahnG", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some e : Event | some x->e->y in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "suaTkr9sbQmsMoi5p", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:40:53"}
{"_id": "qQrBfc8bgn8hFhcN4", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-7 20:54:23"}
{"_id": "pkfitNjhQCoWDxBbR", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 09:33:28"}
{"_id": "tosB7AFwoahb49GAE", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  all s : State | some s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "md6eggZLwhzerCMZC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 10:00:38"}
{"_id": "c269CM6YEam3tQQTd", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    all s: State | s in {x, y: State | some (x.trans).y}.s\n\n}", "derivationOf": "79R3JRXcKDC2Kv9Re", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:11:59"}
{"_id": "SRkG4YZqxLE2kudCg", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "h9c8iudBkceXWMGNe", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 17:43:02"}
{"_id": "KGZw2HY8eaK4qJGbP", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SjPsRa6DaR3CJnMHE", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:48:56"}
{"_id": "xHroz9GtXaWSzhnMp", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i : Init | i.trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CwQaNFMWyitqpe4jR", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:07:38"}
{"_id": "xBDk9ByFLR3NAkgTz", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KKqr6JJzCD2kzd9cQ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:14:12"}
{"_id": "Noe7sZeEwndjCFxGC", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/ \npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | ~(s.trans).(s.trans) in iden \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 | s.trans.State = s1.trans.State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wophPwxQ66FGDpdtj", "msg": "There are 1 possible tokens that can appear here:\n[", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-4 17:47:21"}
{"_id": "kKaGba5Rdp9TREGbf", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RC8nucSgLvBN8Dhie", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:26:57"}
{"_id": "6yheadZAyckqeegcG", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone s.trans.Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Rh4nHoorD8T4dfXsa", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:05:37"}
{"_id": "uCSYEsoKjaLfABq6m", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | Init in ~(^s)\n}", "derivationOf": "xmaMNDzpQsFjfsm7B", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:29:27"}
{"_id": "7L9rvA7mZBXLd8fPP", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | State.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jhJvFtKgTkcSKPHtB", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 03:26:52"}
{"_id": "KgDhtpemu2DkPjyR2", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  lone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | some e : Event | lone (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  State.trans = Event->State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MDnF8yQtESpyncxof", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:22:04"}
{"_id": "ZWii2Tr2mKR28YNHs", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init | State in Event.*(x.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "roA7Fnf7mRMFdREP9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:08:41"}
{"_id": "ze9Y6NqNoSbWNyZnq", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone s:State | s in Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s1, s2:State | one e:Event | lone s1->e->s2  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GmKcB2nNHJCRdM6X2", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 00:26:52"}
{"_id": "yztALbER8rrmuxF9F", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet t = trans | iden in (trans.trans :> Event)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CDZbPMqrWzWzi2dS4", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {univ->univ}\nRight type = {none->none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:33:03"}
{"_id": "6ki2Xi9WXB4Dv2yFq", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\nno Init  implies no State and  all i :Init|(State-Init)in  (State).~(i.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PApSXDYC8cB9EoBAz", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 14:07:21"}
{"_id": "tWbhs5egz84y8ksDJ", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "yScXnMftW5rDiKAZ6", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 19:06:53"}
{"_id": "aS9PoaWGQ2mePP8M3", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\nall s1,s2:State | some e1,e2:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans\n}", "derivationOf": "a9ktHqteAK7iPabgJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:25:53"}
{"_id": "AphWvDpREXEMNzmev", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  all x : State, y : Init, z : Event | trans in y one -> one z one -> one x\n}", "derivationOf": "5TFZru2bC4A8tjnjD", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:39:07"}
{"_id": "p2GL65ZbgJ3u5JxEr", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aN2SWCKzTAoqwQNfg", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-23 03:35:33"}
{"_id": "PAhp9bL56WcFN93q6", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tall s: State | one s.~trans\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ALd87yeLKJNSTexPH", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 18:33:07"}
{"_id": "8JskK3TqDYrGjrnWu", "cmd_i": 0, "code": "The LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tState.trans in Event -> lone State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y: State | some (x.trans).y} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s,t:State | s.trans.State = t.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\n\npred inv6 {\n\tall e:Event | some (State.trans.State & e)\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet adj = {x,y: State | some (x.trans).y} | all s:Init.^adj | Init in s.^adj\n}", "derivationOf": "874fyAHaEpMcm9Gvo", "msg": "There are 5 possible tokens that can appear here:\nenum fun let open pred", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:25:53"}
{"_id": "LtzuoaazqdxGnCr9t", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2: State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s: State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\nfun getEventsOfState[s1: State] : Event {\n  \t{ e: Event | some s2: State | s1->e->s2 in trans }\n}\n\npred inv5 {\n\tall s1, s2: State | getEventsOfState[s1] = getEventsOfState[s2]\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BQNHqMwfHoDZo43um", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-2 18:12:13"}
{"_id": "gvfyo7rwLe7Le99Bf", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LAPFeNn7tRjRbwcGR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:03:23"}
{"_id": "Tza4pW6Cwnu8pfY7J", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:50:12"}
{"_id": "dwi94Zx3pEi3XWQ67", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BxrTPrfkWXYkC7dss", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 11:09:22"}
{"_id": "8RLboYf8eu6AFR6WN", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n  \t\t\t\t\t\t\t\n    all  s: State |some e:Event |  some (trans^.(e->s) & Init )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "mNAwNQ2chWWibFw5J", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 11:21:18"}
{"_id": "HrbnmzozfaYEmHdSt", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  trans.State.Event = Init\n}", "derivationOf": "rbpZNxxv73xqfDKXn", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 21:58:39"}
{"_id": "nQmrtzg4CfQd6ZoxL", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LFbZ4dCW7pWqYkfoL", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 23:13:16"}
{"_id": "uhWXjxy9sT2yXg67W", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t(Event.(State.trans)).(Event.~(State.trans)) in iden\n}", "derivationOf": "cx54hxD9xyzoAtMxv", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event . this/State . (this/State <: trans) (type = {this/State})\nright hand side is this/Event . ~ this/State . (this/State <: trans) (type = {none})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 14:21:48"}
{"_id": "EMpyC3uE7jHv75uFy", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState-Init in Event.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tInit in Event.~(State.trans)\n}", "derivationOf": "Kw5LRN6tCmM32a3NT", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-13 00:16:39"}
{"_id": "DNeGGEA45PmbRgz4Z", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QfGMycTadX2nTR58P", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:02:54"}
{"_id": "EgYXqKd7zHGopzQYE", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans.Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6yheadZAyckqeegcG", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:08:24"}
{"_id": "gceogwm44cPrCkEpM", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n \t\t\t\t\t\t\n   \tall s:State-Init |some e:Event |  no e.s.trans\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n  \n  \n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "dw7mocEiJf3jvtiXq", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 11:31:33"}
{"_id": "Hfx98jbiESPcmZihL", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {all x,y : State | some z : Event | x->z->y in trans} |\n\tall s : State | some (s.^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "GHTSXE4RPvkRKNxPS", "msg": "This expression failed to be typechecked line 39, column 26, filename=/tmp/alloy_heredoc14670635967050192863.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:52:38"}
{"_id": "GcXr28QTH7G9pW9kZ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, e : Event | State in ^(e.s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CPHAaSphpCKxg7pQe", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 18:52:15"}
{"_id": "95ESA7FLEp4coqQpE", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    iden in ^trans2\n}", "derivationOf": "2TRkaBKfgHMhNB2jJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:56:25"}
{"_id": "tHG9SjTJjhQksmrME", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : State | some (Event.(x.trans)).y \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9F5cq8h56ScctxTqW", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event . x . (this/State <: trans) (type = {this/State})\nright hand side is y (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:20:20"}
{"_id": "EnAtniGaKmK8oGH7c", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State | Init in s.^(trans)\n}", "derivationOf": "kNf7hQNb47vtRszoh", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 17:45:38"}
{"_id": "hAnLjPL78Et2ttMHw", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \talways (State in trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KeKRN2yHsfKSt4TjD", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 20:01:36"}
{"_id": "AoMaRY5xvbwkP3jGc", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LDCyJpz9fDMFh3miT", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 13:43:45"}
{"_id": "A4dk9FJH3exJTsNwZ", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { on Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3uf5wuBddLQL7wxQD", "msg": "The name \"on\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 11:05:19"}
{"_id": "GJzNDNmtN9GwDQryy", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone (e.(s.trans))\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2 : State | no ((Event.s1)-(Event.s2))\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "piCSxRRcrZrzd5d82", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is s1 (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:13:13"}
{"_id": "ouBLqHcZqGDqiMQWB", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n   some Init.^adj implies some ( (Init.*adj).^adj & Init )\n  \n\t\n}", "derivationOf": "PBcvMd7pXksh5PwRj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:55:38"}
{"_id": "Xphajzv4S4mkQEkM7", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8JH9ocmftCgRDRamB", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 14:22:33"}
{"_id": "it6wJfmJPWqAevLTx", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fRSmbebWKKkqLkjux", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 22:49:24"}
{"_id": "QirEphkEz5aJRsxz7", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | State in x.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "W5HLrCTWgasZtCeQY", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 14:11:04"}
{"_id": "FzSPA9nsjT5bjwLQ5", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LJCPEuTCBCYnBmtQt", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-14 09:04:27"}
{"_id": "9PCRRK95bPmRMGF94", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  all x : State, y : Init, z : Event | trans in y one -> one z one -> one x\n}", "derivationOf": "AphWvDpREXEMNzmev", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:40:44"}
{"_id": "yEYWyXTeEnDNLHD4n", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 :State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State-Init | Init in ^(s.trans)\n}", "derivationOf": "GNfSjc3d5j6mjmfnE", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 00:21:19"}
{"_id": "Pww9H2wHb6k6hjyke", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1:State,e:Event | lone s->e->s1 in trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "B6AvgmPZh7TwWuYW8", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 19:10:03"}
{"_id": "iGybLpS5RusY6NNxi", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tall s : State | Init in ~t\n}", "derivationOf": "sjpvw3A6pLTRAPbLk", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:31:59"}
{"_id": "KFnjobvru7Cm29LaY", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | lone trans.s\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gb42tEHuWCrcpQRuA", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-26 09:23:10"}
{"_id": "Rc3HkhZbrRTKcpFim", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | s in Event.(trans.State) implies s in Event.(State.^trans)\n}", "derivationOf": "oxiG9oPBpFN4aFXY4", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:55:47"}
{"_id": "vTTYnLcbHEbZFKopY", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s:State | Event.(s.trans)\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gGAiTiTaLkobdHaxf", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:10:00"}
{"_id": "2RTi7FGEWW8PdKnum", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x->Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall x : State | State->Event->x in trans implies some Init.~(State->Event->x)\n}", "derivationOf": "Bg9r4Mxyo7PcH9vqh", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 14:06:55"}
{"_id": "pvfMArLkFaHdTw4yG", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8TedzuzDdYfX7Gqfn", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-4-21 20:47:05"}
{"_id": "zwFA43sP8TqZpkGDZ", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | some e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "eRkvw4cN7sCtBaJ63", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:05:17"}
{"_id": "qwEFL6Jw27d636dEz", "cmd_i": 4, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n\tInit.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t{x,y: State | Event in x.(trans.y)} \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "RgHS72JMAKu555jFt", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:36:57"}
{"_id": "MRpRSsbHkGGwCfWyC", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "s8Kw3LsvS6MBbvmHe", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-12 20:02:25"}
{"_id": "CLtG4gzNj3icYXbQy", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n\tall  disj s1,s2 :State |some e:Event |  (s1->e->s2) in trans implies ( Init in s2.^adj  ) \n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:41:14"}
{"_id": "vqChXydkNoR2FqzAg", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  some trans.State.Event = Init\n}", "derivationOf": "ZdQKrWoruv2s4GueS", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {PrimitiveBoolean}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:59:49"}
{"_id": "4HuoLaozsuEc4ZwcS", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 {all s:State | s in Init.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r :State | (r.trans).State = (s.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { all e: Event | some (trans.e).State\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Q6mLuukLjXCHgAd9e", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 22:22:53"}
{"_id": "wjdBFcKSqcJDsuwnA", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n  \tall s:State | Event = s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \t\n  \tEvent = State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2PJcKSkPf96Tiwmek", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:24:48"}
{"_id": "QTYZaAunTrkwX8NGB", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some s.(Init<:trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "Zh5trwKdnKiMunjBy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:35:30"}
{"_id": "gbv7GdY2ZPs3mKt2H", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NahrHAG2FPqi7ue6x", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:25:20"}
{"_id": "HPtndyq2xtXyLQQcD", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone (e.(s.trans))\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1, s2 : State | (s1 in Init) implies(s2 in s1.^trans) \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EykDwZuXhuMsGHEBS", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:15:46"}
{"_id": "Cz49Skes28BXE6Ddi", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yiuN5su4uued23Paf", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-16 03:48:21"}
{"_id": "cpc43bLCgdAERtz8S", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | one s.trans\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QngQF7aFXxMdRKine", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:28:12"}
{"_id": "7KS6RKgBHGpueSQCN", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some s.trans implies Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8zBEJtFmeCqbAAYWA", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:36:03"}
{"_id": "5GtzHtnJQE4gLPe9K", "cmd_i": 2, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all e : Event | State in trans.(e->State)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "ogcLYccn7Fee3rnPu", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:11:21"}
{"_id": "9SrEXqtFGdfrYCDgT", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\nall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\ntrans in State -> Event -> lone State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\nall s: State | s in Init.^trans[Event]\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\nall s1, s2: State, e: Event | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nall e: Event, some s: State | some s.trans[e]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-14 09:47:26"}
{"_id": "MZWGXtYQ6LokxYwSy", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | s1->Event->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init->State in *tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BRFRuuuXz56PwdgY6", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 15:56:30"}
{"_id": "QEA3GaFGEHBdbkmGk", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n \t~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "FSfAvpvJeSpQWY9Hm", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:18:31"}
{"_id": "LugomxT79kzFsWxF9", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State |some e:Event | e.(s1.trans) implies e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JvwMnCT28ERcGzrxq", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 12:37:15"}
{"_id": "WG7cCrA67EueXMoga", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  some ^(Event.(Init.trans)) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "4gfZBpyyjTfchnyF2", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 14:27:17"}
{"_id": "g3hk5PfLkrCXaLPqu", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tno Init.~trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tone Event.(State.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zBzNr7px28pcwQy2v", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:35:12"}
{"_id": "G7MJgu5TgfTAN9voo", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | one (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-16 03:48:04"}
{"_id": "AxXoZcJ6vXKguhgzj", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fHeDRhApHsvWT7Rd6", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:08:12"}
{"_id": "t2RnDbD2Y5o2foWYk", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some e : Event | x.e->State = State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "KEb4jRGTHXByheBnp", "msg": "This cannot be a legal relational join where\nleft hand side is x (type = {this/State})\nright hand side is e (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 14:19:06"}
{"_id": "Wjsj4zQEduhMspM6i", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.^trans[Event]\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZgagwycjpnePYQfpd", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-9-12 09:51:14"}
{"_id": "GCMfJuohdsteMhgxx", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init in ~(^trans_bin)\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-24 09:22:31"}
{"_id": "XxNFms6GmN4NzJjPt", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JAPwRdMpGtah2EDRn", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:30:07"}
{"_id": "aeoJm226vTxmmhpit", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bLymDBLdfWr2fJrmj", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-9 17:22:17"}
{"_id": "SEj78YyBdYr8e6HnF", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : (State-Init) |  one (Init.trans).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "C5KzGyrqShD3Ys4wA", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:05:37"}
{"_id": "FbjPyLZ7Gzw4HHKDs", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e : Event | lone e.(s.trans) \n\n}\n\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { all s: State | some i: Init | s in i.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dDNPaQWusLrsfGZWs", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-9 18:01:57"}
{"_id": "Mws5Cp5LQpukApDEQ", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State | (s in Init.(^onlyStates)) implies (Init in s.~(^onlyStates))\n}", "derivationOf": "h4gXg4Y3djvxK8gNE", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:20:01"}
{"_id": "sQC7XNZfEQvqAJwjT", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tiden in State.trans.~(trans.State)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nZQnpFe9ZGXvLXZgE", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 02:29:02"}
{"_id": "A8ja2X8mEaDLxbt2b", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState-Init in Event.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WzmYhZg5oCkQQBy2x", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-13 00:12:44"}
{"_id": "S8cAeJSKuAM6pTapQ", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "imqRT9LdCJCwSndTT", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 14:24:10"}
{"_id": "29Lpp3PbpFZ8hngED", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | s.trans in State<:trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2BikvEnSHmPyNtHjx", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-24 11:06:12"}
{"_id": "ZGMLR24RQoiz6cHkG", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n  \t\t\t\t\t\t\t\n    all  i:Init |some e:Event |  no (State - e.*(i.(trans)) )\n  \n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "ntyFdkPMemy27BMHK", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 11:04:25"}
{"_id": "ovTX4ufwtvcQPdvWY", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State,\n  \t\tsucc : set State\n}\nsig Init in State {}\nsig Event {}\n\npred x {\n\tall s1,s2:State | s1->s2 in succ iff some y:Event | s1->y->s2 in trans\n}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tx and (all s:State | some i:Init | s in i.^succ)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FbQvdyJZhNjeGuSfP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 16:05:41"}
{"_id": "ZvyK2NW5fRrejr8TR", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | all e:Event |  some e<:s.trans \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e<:State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vQzKK4c9KJteYoa8v", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 20:06:23"}
{"_id": "fasDPdQQ4Zmzm3rTy", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | (iden & (s->e)) in (s.trans).~(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "mr7kpBDxqocp5F29c", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State->this/Event}\nRight type = {this/Event->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:22:19"}
{"_id": "h4ft5xXgSuu2CPnvm", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "sSsgDdn3kmkQx7P4f", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 02:09:39"}
{"_id": "opHPQqG85XjKNXWo7", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.trans[Event]\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CkzJ5pdfy42rBieRT", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-9-12 09:50:54"}
{"_id": "bh44ZrfjEyo9YumCY", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  all s,k : State |lone s.trans.k\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ky7SbHvpaNhADabAJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 10:19:52"}
{"_id": "MMt9rRsgDdECcZWRm", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State| lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s,ss: State | (s.trans).State = (ss.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: State | s in Event.(s.*trans)\n}", "derivationOf": "KQ2KkkMdMpgaX9yxo", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:45:10"}
{"_id": "FWwF66DT9RZEpP4wd", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | State in Init.*(s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "EbnyQBjJgf463Juf6", "msg": "The value of this expression does not contribute to the value of the parent.\nParent's relevant type = {this/State->this/State}\nThis expression's type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:43:43"}
{"_id": "cvCKLeejLwqCRZ683", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Init.(*trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "g3KusqYfCYondk2FB", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 21:47:14"}
{"_id": "cKnb4dfgboeE7tDuo", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  \tall s : Init.^adj | some s.^adj & Init\n}", "derivationOf": "zMGbyS3bzvkJmy8wN", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 11:53:05"}
{"_id": "2TRkaBKfgHMhNB2jJ", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    iden in Init.^trans2\n}", "derivationOf": "cXtHv4oecPLYKFdKq", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {univ->univ}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:56:06"}
{"_id": "EXpeWHuPTChei9mYe", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State |one e: Event | lone trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wYTKjDpwoLjJSCFab", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 18:36:54"}
{"_id": "SWrdEz4upaG6QEkJP", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | s1.trans = s2.trans \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QzEFQsLEP94xccuRu", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:41:04"}
{"_id": "WfzS7jLcsRmXCenyA", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-14 00:05:27"}
{"_id": "A4no2EW2Yjm8Bm7xk", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n \t\t\t\t\t\t\n    all  s: State |some e:Event |  some (trans.(e->s) & Init )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "foxHuWcc4GD4DYS5c", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {none->none->none}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 11:21:54"}
{"_id": "HQucKBXpJfuAzx3dA", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "c3xisY4ykRYY76jPF", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-25 20:58:43"}
{"_id": "rC4z5qcbRyng9BrZE", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event.(x.trans) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MsuT6A4Si2YBP7HJW", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:48:10"}
{"_id": "3ifH4Cvnj876xK8Bk", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in init.^trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "guq9azBmF5fuae8eY", "msg": "The name \"init\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 14:26:03"}
{"_id": "5PPFtuXsAnKFupAky", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some trans.e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yRb7NBTyvAx5qWM7d", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 17:07:07"}
{"_id": "HXCj9dMT4GefLcKW7", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s:State | Event.(s.trans)\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6QSXdhRZAERD9gRf7", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:09:52"}
{"_id": "SKBZRDTpqP5z8NBfP", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State -> lone s.trans.Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^trans.Event = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Hx6BxoyQz6swPrrqm", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:03:18"}
{"_id": "KL3J3932ZAcTQPaHs", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "SRkG4YZqxLE2kudCg", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 17:43:05"}
{"_id": "5TaKtAEM4aqQpqfDe", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {all x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "c6jJoHwbJAPmD8a5N", "msg": "This expression failed to be typechecked line 39, column 17, filename=/tmp/alloy_heredoc4279459076094697424.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:55:28"}
{"_id": "ya9LcgHjKgixmCLsi", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | Event in s<:trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "So2DdaqB7yXxJZmJ2", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 11:57:52"}
{"_id": "j9mi5yF5hjo6Kuje7", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone State.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "E6rRWKwQnQvXZF3ZW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 11:09:11"}
{"_id": "dzACm8Ercji2uWSep", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some t:trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:21:34"}
{"_id": "sTnAggtzHZijNK4K9", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XePFmmukxvcYnhNe4", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:57:54"}
{"_id": "RufbxbJwpWtxSdvRQ", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zRG5DG7mDcJytB8rR", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:25:40"}
{"_id": "feCXvNyQq4cFvnSy6", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e.(State.trans)\n  \n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall i: Init, r : (i.^function) | some i in r.^function\n}", "derivationOf": "m3cdYnrZWFRSiP3JD", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:23:35"}
{"_id": "Pp7fh5HGrc3DTT9iC", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State | some (Init & ^(s.trans))\n}", "derivationOf": "WjQ9RotA2u7awYy4d", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 17:46:46"}
{"_id": "TwPJvjJvvQtDHaxsE", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some Init.( s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "eCidByJKbcP2xKCtH", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:20:03"}
{"_id": "acWpra5fJpQr5roRH", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e.(State.trans)\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9dEzqm3qnnG5n8obv", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 23:14:38"}
{"_id": "FsJcgrKEoEur6Rcoo", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PuzeRyyxPQtE5rEXj", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 22:45:29"}
{"_id": "oz8ep7PsAPZn5hWKr", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-10 18:38:46"}
{"_id": "cvu2YGoTTZftjTPKs", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e->s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZyCrGEfFZ6tctY8as", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:31:36"}
{"_id": "q9BdsfLnggQp67JLG", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  all s:State | State in s.trans.Event\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "C9JnjNTymfXr5JWad", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 19:12:10"}
{"_id": "YJJEPvin2j9Jbei4r", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event | lone e<:State.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rQjzpJ8qXiQowuEX6", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:13:38"}
{"_id": "dPZeNPftighGaysCa", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all  y : Event | lone trans.y\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4pYcpnTR2gcBYsnPf", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 21:51:17"}
{"_id": "FBJ6qtuP9RYh7fmfC", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans}\n}\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i : Init | State in i . *adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pukGxrc3Eo77uRDpw", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:36:04"}
{"_id": "SEcxYEizYaMsaZYEM", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | Init in ^(~trans)\n}", "derivationOf": "QpCsnTX8k9w8kd7pF", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:28:09"}
{"_id": "fqCDuSGnit4sWnc2M", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "h4ft5xXgSuu2CPnvm", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 02:09:42"}
{"_id": "vDDicDwQ4SNgA4gQH", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sbdrSafv3cTMfQCxz", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 13:53:20"}
{"_id": "PDotrbpuzpHyJwduR", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "BSMrzw93zgYTRcKqp", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:35:44"}
{"_id": "uwTgpi6gTj5eTkM7m", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, s1:State, e:Event | lone e->s1 in s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ne5Ra3es7znRdPoT9", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 11:59:28"}
{"_id": "fk6pkoZ6S8MsnRhcR", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in State.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AC559MwjPsXsARYj6", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:23:01"}
{"_id": "YmW4NXB9MSyeRjsjw", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GaTC4DaKR5RP3QZ8S", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 23:58:02"}
{"_id": "u64BLtAoNr3rBwwfK", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  lone Init & lone State\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | some e : Event | lone (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  State.trans = Event->State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KgDhtpemu2DkPjyR2", "msg": "There are 28 possible tokens that can appear here:\n( * @ Int NAME NUMBER STRING String Time ^ all disj fun iden int let lone no none one pred seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:22:22"}
{"_id": "nZQnpFe9ZGXvLXZgE", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tiden in State.trans.~trans.State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BoCfEQyDs5nGgHJH3", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 02:28:54"}
{"_id": "PfN77pNGJ5WNLPJsB", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gavvC95j73jPQ9guE", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-26 09:27:10"}
{"_id": "epiRihKFpGR3WBo4K", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "Seu5zaTTCK4TTMB7w", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:50:16"}
{"_id": "EQDWwARZDXG7WDQfj", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone x.trans.y\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bZBgCnWwjDaMB9vEh", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 22:01:32"}
{"_id": "Bu82Pgc35pvT2sPHW", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans in State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "iy5uHRXRbmSMCuund", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:17:50"}
{"_id": "xjGprvcZzctXBsh9o", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | s->Event->State in trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GQNwmuXudcoZJrs3f", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:11:00"}
{"_id": "yEfqHQzG59MiYSPo4", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xWtgxrGJhfFcCh5nJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-1 12:09:17"}
{"_id": "5KXWQJx2tMuTXxLv4", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "RBHm4GzvpRwN2FM8B", "msg": "^ this/State . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-14 00:22:36"}
{"_id": "ngcMxCPtTjyqhmHoQ", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in Init.^{x,y: State | some x.trans.y}\n}", "derivationOf": "Z5ysTm9iKTzxRF9ND", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 01:14:48"}
{"_id": "viZeRLo7kTSfXQ6zE", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans} |\n  all s:State | some i:Init | s in  i.(^t)\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cdefbZKYvrmTHNxAq", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:54:41"}
{"_id": "6nTAmchoYNhwggwt2", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.^{s1, s2 : State | s1->Event->s2 in trans} = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "68BGhkPF8rphDdvwq", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:33:23"}
{"_id": "ME4M8NDNQqA5NhZFY", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    \n    \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "msHFbWmNx6EkEB2MW", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:23:23"}
{"_id": "MsWuwCu7QtZYF7EtL", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MruhkW6cdqeeHRWjx", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 12:37:39"}
{"_id": "ShYciu7xpTR8qpT5j", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | one e.(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SRPC3rN3kk7babA3a", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:35:10"}
{"_id": "68RBZ9gsAjs9haScd", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.(^{ s, ns : State | s->Event->ns in trans }) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RWHx5q62QzTw3mDjB", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:24:26"}
{"_id": "JDCTeNjoKbWYBrkzk", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y : State | some e : Event | x->e->y in trans} | \n  \tall disj i : Init, s : State | i->s in ^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RaxLgHSeDvDgjv6Hp", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:16:27"}
{"_id": "4YYXkyt5YbqRz4zTm", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i :Init | State in i.^trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FEsupZBc2gQdN5BCK", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 14:26:32"}
{"_id": "GouR3xZZmnvLZRna7", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e : Event | lone e.(s.trans) \n\n}\n\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { all s: State | some i: Init | s in i.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r : State | (s.trans).State = (r.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { all e : Event | some State(trans.e)\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QQZ9eHWE8cLisFa7K", "msg": "The name \"e\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-9 18:30:19"}
{"_id": "i9NThk79nQkxDXRhP", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ExSqsanBi58afnwaG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 11:53:46"}
{"_id": "Kw5LRN6tCmM32a3NT", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState-Init in Event.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tInit in ^Event.~(State.trans)\n}", "derivationOf": "sh2WCSTHRAbn9dgxX", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-13 00:16:29"}
{"_id": "YyFJZgRYbgcHYQqrB", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State:>trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KMysFhXhwg8YiJdKN", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 09:58:47"}
{"_id": "f9mpBTHK5FwsBpmB7", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init | State in Event.*(x.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "yeGgtzTWmEYfjzYek", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:11:35"}
{"_id": "NrSyhqXwScZxHnCF4", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlet k = ~(trans.State) | ~k.k in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hvZLcNTxwnJEgZcfP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 13:58:09"}
{"_id": "x8DnokDcJhoZmyvEe", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans in State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "dGqKPRDGxqJwWThaF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:11:45"}
{"_id": "esj4ZSi7usK7iCJYp", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone (s<:trans).Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JZKgDm6Bc55curtM5", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:01:45"}
{"_id": "FwcYxaFBBx9rvwWsJ", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "95Z5p8BfLzpFZdubs", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-7 21:57:15"}
{"_id": "hNtckotXt56wTSpuG", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | x->Event->y in trans implies y->Event->x in trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "LZFHo9JPYgXk6bEJ4", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:28:30"}
{"_id": "9rS4kQ62Ku5u48cSz", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i:Init | State in i.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "uzxr2RzzqMiYZyHZ3", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:47:40"}
{"_id": "3nu4iQ2jvgt5WizL5", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall s:State,e:Event | lone e.s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7wcLRjQScAFKRZ5sv", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 19:03:15"}
{"_id": "qDga8fo9C8S8nbisz", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\talways (all s: State | some s.trans.Event)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "enorfAfA8swr4xtoS", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 19:58:36"}
{"_id": "wdCtEMGTB9kY456TM", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | e->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "LHLZupnSjrmKMCBTg", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-7 21:42:38"}
{"_id": "RgHS72JMAKu555jFt", "cmd_i": 4, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n\tInit.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t{x,y: State | x.(trans.y) in Event} \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "eKYfXRbnahMyg6QMh", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:36:40"}
{"_id": "wX3sL9ckwpQn56ZyN", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in Event.(State.trans)\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "uaT8D6bR4cggT63hk", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/Event}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:21:12"}
{"_id": "YfxSeLizZWKLsohh6", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event| some s:State | s in e->State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fqTM6F2gojafRrBeZ", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:47:13"}
{"_id": "Si4DP2tjyzzccBAdJ", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {all s : State | lone s.~trans \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pkTfpwFdTRZ2YufpA", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 21:13:04"}
{"_id": "C8p5kc8s3gXEEG7hd", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.*(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "Ga3oPmRnBE3DTNzBS", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:25:12"}
{"_id": "j66T4bWvwyHnCqnNX", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    State.^trans_bin.Init = State\n}", "derivationOf": "MAdpijpQ5yC9CiHnK", "msg": "This cannot be a legal relational join where\nleft hand side is this/State . ^ trans_bin (type = {this/State})\nright hand side is this/Init (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:51:09"}
{"_id": "o2mrzcbSMfAssgpww", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State, some t:trans | t in s\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dzACm8Ercji2uWSep", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:22:24"}
{"_id": "5rJyt6LqTmXfx4Afg", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: State | s in s.^{x, y: State | some (x.trans).y}\n}", "derivationOf": "RcC3w4M5AXS5GmMvs", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 20:17:07"}
{"_id": "aM2rokP7MryDphPeY", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet adj = { s1, s2 : State | some e : Event | s1->e->s2 in trans} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some (trans.State).e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EbJcRuNGLqubP9tmy", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-3 11:17:26"}
{"_id": "YwoTggY4sqJyxamHG", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i:Init | s in trans.i\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LNvDyWnLCPm9a4ehr", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:38:29"}
{"_id": "hJFkzxqidzZB3TZSN", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | all e: Event | Init.trans implies e->s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4TAxuidpoZWStrjQF", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:24:02"}
{"_id": "nopAR4AWW7Z27HH94", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n some State\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MuXJvB8h3YTmDZS2d", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-4-21 20:44:10"}
{"_id": "ByiPZzDjAyLh6HXbm", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State | lone e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WPcqFMymuRLTg5kKR", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 18:34:52"}
{"_id": "FkFix2BQHkogjDHLD", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s1, s2:State | some e:Event | (s1->e->s2 in trans and e not in iden) \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TEfiEry7xTP2vJaNv", "msg": "!in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {univ->univ}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 00:18:49"}
{"_id": "4EsvCmPxiJfjFtAxM", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in ^Init.(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xkhqW7AJCh94XAiCb", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 23:38:44"}
{"_id": "gGLdh3Pj3W4DutmQc", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone Event.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Xa7WMotkEzR5bbkun", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 22:47:04"}
{"_id": "imqRT9LdCJCwSndTT", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "w4Nhs3A8yCnAoqbL2", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:23:42"}
{"_id": "C9JnjNTymfXr5JWad", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4qHrY2nfudoyc4rDB", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-10 19:11:11"}
{"_id": "mq2cTJ6sXc6vxudL6", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.*(Event.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "cgucDDLKnhkYGt6GK", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:26:13"}
{"_id": "wzZyfwhC6ancWmr36", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some e : Event | some x->e implies some y->e\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gsEQqzFubdxW6CDii", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:01:25"}
{"_id": "muQEim5SLGm9kjPrm", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i :Init | some e:Event| State in e.*(i.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XxxkuazN3YEhPJWiu", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 14:33:39"}
{"_id": "TkA5AWwfMRifnQqn5", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | (iden & (Event->State)) in (s.trans).~(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "8LoF4Rany5svq7sks", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/Event->this/State}\nRight type = {this/Event->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:21:32"}
{"_id": "j49GChFYWDmpzGHm8", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall e:Event | State in e.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event| e in (State.trans)State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9HNLhoByuff5CiscN", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 12:27:09"}
{"_id": "oNpdsu2e9XeCvM9MC", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s1,s2:State, e1,e2:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans and s1 in s1.trans\n}", "derivationOf": "3D2XuHggecRr7cENd", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-23 04:22:33"}
{"_id": "Ev2SkCieS93GrgGGg", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-14 09:02:12"}
{"_id": "urMks6Thoqb8Eu4y6", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  some Init.trans\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Snb5aJya4LSneWbrK", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 21:04:47"}
{"_id": "FJDxAwFSDFaDgzkce", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some s.^trans :> Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xbCb6hD5vEzmgHrYN", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 20:16:35"}
{"_id": "fMHyacRWrRiy2pWXu", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { some State.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "r7oCvtf3EZTaTYdmQ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 01:05:04"}
{"_id": "Agx2hgYkCRuFgg2gY", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n  all u : Init | Node in  u.*{ x : State, y : State | x->Event->y in trans}  \n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cgA8exM8B5feAZ22q", "msg": "The name \"Node\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:35:19"}
{"_id": "3JNkcHcq5fhvdLZHA", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | one Event.(s1.trans) & Event.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RFoZF5jBizFNTX2EB", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:31:54"}
{"_id": "QfGMycTadX2nTR58P", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone s.(e.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "esj4ZSi7usK7iCJYp", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:02:25"}
{"_id": "7Gwu6tWCcBQWqdtPc", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {lone trans & Event\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KNbHSaP9A9pcAbzoZ", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 21:08:53"}
{"_id": "tF2YMBRKGeovknTSW", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nYcFosuXvYTF99Qah", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-9 13:53:07"}
{"_id": "pAKjq9MkZQq9yzigE", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : State | State in y.(x.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RFME6HzriweGujXAC", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:11:16"}
{"_id": "sjpvw3A6pLTRAPbLk", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | some ~State\n}", "derivationOf": "wbzLSnjN43GNvYQk9", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:30:36"}
{"_id": "ipt7eDrHw5972WE3r", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init <: trans | State in ^(Event.s.trans)\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "HjFHt5S75i9aoBHgw", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:46:18"}
{"_id": "99EbgjpqmqHWLzis7", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s1 : State |  s1.(Init->Event) in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9fZcW9tz2SoKZyoXz", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:02:20"}
{"_id": "dWv2yab2Ae5SAAkmx", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans} |\n  all u : Init | State in u.*t\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZGR9WAQeGwq9FugJg", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:42:58"}
{"_id": "v5zL7K3AjWRxHeSH4", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s: State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "The name \"x\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-8 15:14:51"}
{"_id": "EhtavR6tCDnoNnGB5", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | all e:Event | lone e->s in s.trans\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qH8mxTj99GpPBxHzo", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 18:45:13"}
{"_id": "3fLcPeqFMjwKLW3Sq", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | trans in e->s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "47dHZtJFbeYfGgzo6", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:32:09"}
{"_id": "k8CvBLxEAYJ7qNH4y", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nsome s:State |all e:Event| some trans.(e->s)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4yXZMDhRGRaFRLuBA", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 14:46:47"}
{"_id": "nDeCNwS9BkRmkMim7", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  (lone Init) and (lone State)\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | some e : Event | lone (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  State.trans = Event->State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "u64BLtAoNr3rBwwfK", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:22:41"}
{"_id": "2Jcsxpa9JZoQeojPC", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden in trans.Event.State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {univ->univ}\nRight type = {none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-10 23:45:26"}
{"_id": "S6HaQ3CsrpMnGxvji", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-19 15:22:10"}
{"_id": "puNhrfjj6NyZD5izp", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tsome Init.trans.Event\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Jjiy87maXr8XrxCPG", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:19:38"}
{"_id": "Fp5wQW5m82cpCT9JE", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State, e : Event | lone e.s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | one s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "teHeCx8mLG7vDGwps", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 09:38:44"}
{"_id": "EykDwZuXhuMsGHEBS", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone (e.(s.trans))\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "R5NMSw68o4bnACfrd", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 19:12:09"}
{"_id": "8zBEJtFmeCqbAAYWA", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | one e.(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AKTGPa7kq6D6WdddW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:35:25"}
{"_id": "ftKjs7Ndk38ckud7n", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event| e in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wJBTJzTgtzMvxFQnB", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 12:27:38"}
{"_id": "g3FQNENuHwoMBRHb5", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init in Init.^trans2\n}", "derivationOf": "zRFrY9Xj9rYDoRew8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:59:06"}
{"_id": "5fDJsB5H97BXayAYT", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State | some e1,e2:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans\n}", "derivationOf": "MsWuwCu7QtZYF7EtL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:39:49"}
{"_id": "ZyCrGEfFZ6tctY8as", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | one s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GFvz7iiQaMBikNEFr", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:30:42"}
{"_id": "ucTyj4rhP3HzZnEPR", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | some trans.s implies s.~^trans :> Init\n}", "derivationOf": "AQ3r8uQYPdSit8g3S", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 21:48:52"}
{"_id": "R2ZWco5MTdCE7jA6F", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | Init->Event->(s-Init) in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e<:State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TupoX8aecBNk25KLa", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 20:11:13"}
{"_id": "9WWcAfNcGNo7AhenK", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s1, s2:State | some e:Event | s1->e->s2 in trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 00:16:18"}
{"_id": "sQS6reeyJbnM7FtjN", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dPEnTdTnxop5RKhdy", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/Event}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:33:18"}
{"_id": "AD8rxjeuoHocosk8W", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | one s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WpkxqxJ3iAEsw4CcX", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 09:34:15"}
{"_id": "u24cNJia8n8s7Aqf8", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (s.trans <: e) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tc8zx79YKfoeWDyHr", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:13:15"}
{"_id": "pj56EceCvNwZnjgrJ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State| some i:Init | i->Event->s in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jbydPphmRgCBhFYHT", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:36:21"}
{"_id": "T33MYoZ8tkwsfmQFK", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.*trans_bin = State\n}\n\nfun trans_bin : State -> State {\n    {s1, s2 : State | s1->Event->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "oiSkceaxBBZKCTAb4", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:31:33"}
{"_id": "ShodfFhCBbAKdE65Y", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XCJyzSsMckebLW7t7", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 23:37:26"}
{"_id": "MuXJvB8h3YTmDZS2d", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n some State\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PykXkSmjQewwJ3FN7", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-4-21 20:43:38"}
{"_id": "foxHuWcc4GD4DYS5c", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n \t\t\t\t\t\t\n    all  s: State |some e:Event |  no (trans^.(e->s) & Init )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "a4DQisNA55fWteckp", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 11:21:43"}
{"_id": "NPsmWviXpoFYPqj7p", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init in Init.*trans2\n}", "derivationOf": "H3MdAu262osgFYEyR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:57:08"}
{"_id": "TT6yqSNjoBFTFb2Xi", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone Event in State.~(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pRyMf6RYwzJwhWTbP", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 23:35:09"}
{"_id": "Y52ivaPY37iuC776n", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    (trans.State).Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6GXe33iq5yMdsPJ8q", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:10:54"}
{"_id": "H5sb3p3h8Nd2DYw7W", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s1 : State |  ^(Init.trans).s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GkyJizCKRxNh4oRrW", "msg": "The name \"s\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:57:49"}
{"_id": "nt9JzeytQKDWPTcas", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: Event.(State.trans) | s in ^{x, y: State | some (x.trans).y}.s\n}", "derivationOf": "Aq3jPgHvYdTDFL4Nv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 21:50:52"}
{"_id": "jc2cFkmjqGLEc5kmN", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  \n  all x : State | no iden & (x.trans)\n}", "derivationOf": "FmkxGcgqmjKcmCK7y", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:32:07"}
{"_id": "mJY4LGgvAj4KPQnng", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i:Init, e:Event |  s in trans.i.e\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YwoTggY4sqJyxamHG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:38:48"}
{"_id": "bSjzWCrfvATtzCfAj", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    all i : Init | i.(^{s1, s2 : State | some e : Event | s1->e->s2 in trans}) = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "f6r2BQmQn8egEKo8T", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:38:07"}
{"_id": "u3psYinSmduvvxzqb", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : Event, y : State | lone y.trans.x\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "96oexFkHy36mRm3mT", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 21:47:27"}
{"_id": "7bEtQApPQJLBRJF9p", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s1,s2 : State | some e : Event | s1->e->s2  in trans\n  \tState in Init.(^(all s1,s2 : State | some e : Event | s1->e->s2  in trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WFRwc3szp5x2Kx2vv", "msg": "This expression failed to be typechecked line 39, column 19, filename=/tmp/alloy_heredoc4473158511578606399.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:59:26"}
{"_id": "F9AdDA4hJY7Jwta62", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\nfun onlyStates[s : State] : set State->State {\n\t{ aux : Event.(s.trans) | s -> aux }\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^onlyStates[Init]\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rJgkLMfheB29Kbbix", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 01:02:05"}
{"_id": "YS8dvkXFmED93CvuK", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BX8GPGzCmd9PqA7Fe", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 09:49:09"}
{"_id": "fmhMYfGaJmrGSvheC", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { one State.trans.State\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TwbKun99AgPjbcpfm", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-9 17:35:01"}
{"_id": "qXD6k8RPpKYPQbbD6", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | State.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Z823nJ8ZCp7xc28bp", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 03:25:41"}
{"_id": "ZGR9WAQeGwq9FugJg", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans},\n  all u : Init | State in u.*t\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "oh5EG9w5gngREdt2e", "msg": "There are 3 possible tokens that can appear here:\nNAME seq this", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:42:48"}
{"_id": "sLW3CExf7ponYgT3P", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 09:57:58"}
{"_id": "d8eXEpakgffpuqMsf", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some x->Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HFd3YW5oiiwf9MoGb", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:58:45"}
{"_id": "prccZRkfvy2ZDAZzQ", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tState.trans in Event -> lone State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y: State | some (x.trans).y} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s,t:State | s.trans.State = t.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\n\npred inv6 {\n\tall e:Event | some (State.trans.State & e)\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet adj = {x,y: State | some (x.trans).y} | all s:Init.^adj | Init in s.^adj\n}", "derivationOf": "guWCgjng4tE2CFjQA", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:29:35"}
{"_id": "Sh2xma8XsHEyj4jqr", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | one i:Init | i in (s.^trans).State\n}", "derivationOf": "gouPvsGxhdyNXW9jR", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:57:54"}
{"_id": "KkJpwgM95hxbqiosN", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans} |\n  State in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kiYfP7XuKctM342RD", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:58:45"}
{"_id": "yCw7hJRdXdrLFobrB", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, disj e, e1 : Event | s->e in State.trans and s->e1 in State.trans => e = e1\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ECWQDjWANaXyWWfHc", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State->this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 02:50:45"}
{"_id": "3e4r4zYQc8wnB2Lwn", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans = State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "RCpMYz47uBkA8F2Gi", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:19:18"}
{"_id": "yDJ75tAxEQtJ9FDPr", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone Event.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bFb77m39j3oy6Pf4v", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-15 16:37:55"}
{"_id": "erQzc7Lnaqgrp5vPw", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: State.trans.Event | s in s.^{y,x: State | some x.trans.y}\n}", "derivationOf": "dTn3Hggqe5B9QM4tm", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 08:39:14"}
{"_id": "bu5s6N9bm98JdSwCy", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "p2GL65ZbgJ3u5JxEr", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:40:49"}
{"_id": "3788zmEJXk2uKwjiM", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | one s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6T5fuDrpPxmohPTn9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 09:34:01"}
{"_id": "rEni9caqk4iX8hkPf", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1 : State, s2 : State | some s1.trans.s2}\n    Init.*trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "ZacSbwjae5ThrcvEm", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:43:16"}
{"_id": "pP7yDv7hPFZ2aWxQx", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall s:State | one (s.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "biFRb2BNALLaXD4JF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:49:56"}
{"_id": "RxgjAbTvJyw6bC3WH", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {all x,y : State | some z : Event | x->z->y in trans} |\n\tall s : State | some Init.(s.^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "AMa3Qk37pSMi9EaXv", "msg": "This expression failed to be typechecked line 39, column 31, filename=/tmp/alloy_heredoc8081334996738737217.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:50:29"}
{"_id": "RaBTqxMWWRKQTYSAy", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State |some e: Event | s.trans implies lone trans.e->s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KbSyMPKeWpLGBAvXC", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 20:45:44"}
{"_id": "D8M8gwnNRGMNQ8244", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet adj = {x,y : State | some e : Event | x->e->y in trans} | ^adj\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:10:08"}
{"_id": "GBxQbw7vqtq3EpuPz", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone I e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jumZ6F9XDkGMudkzL", "msg": "The name \"I\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:48:37"}
{"_id": "RkGdF39CNGZ8Gcfjt", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Hg2eMvqcWnvB63DjG", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:18:15"}
{"_id": "pukGxrc3Eo77uRDpw", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans}\n}\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i : Init | State in i . ^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "e5ZGCmBpkPbYR26KY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:35:53"}
{"_id": "jTckgtFwRHPatEudM", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\nfun onlyStates : set (State->State) {\n\t{ s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | Init in s.^onlyStates\n}", "derivationOf": "vWNA3EfK6FpkWW7nH", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 01:11:12"}
{"_id": "nQpZfph6fNF3SKWvz", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "tnQemRP2LRh6pGmYz", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": []}, "nodePositions": {"State0": {"x": 444, "y": 99.5}, "State1": {"x": 444, "y": 298.5}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2019-11-10 21:16:33"}
{"_id": "QWZBgkue7Av5bBamC", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | all e:Event |  e<:s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e<:State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "W5u4R89X6NDFJuZo2", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 20:05:06"}
{"_id": "qKPWf4kbXR4EjWimM", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans = State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "x8DnokDcJhoZmyvEe", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:12:10"}
{"_id": "eixJfXuKyWtByui3d", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = ^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "meHnNRa3FSujcNhmx", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-23 02:45:49"}
{"_id": "HXcCK4tAncoCMc96w", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t some e:Event, some s:State| Init in ^trans.(e->s)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7pjeb2dDXQKi55eo9", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 15:00:04"}
{"_id": "hcpCZyJhaxqNc499b", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\n\npred inv4 {\n    all  i:Init  |  no (State - i.*(trans) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 19:10:32"}
{"_id": "Z2KkegJjW9gp8uini", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 {all s:State | s in Init.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r :State | (r.trans).s = (s.trans).r\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nNXPZKszrA8HJXuWK", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-20 22:18:13"}
{"_id": "iJL2pbwwLYNbCfn6h", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LuMquZre6E5jXLMPT", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 02:45:41"}
{"_id": "6v2chMHJRbd35rgkL", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in ^{x,y: State | some x.trans.y}.s\n}", "derivationOf": "xY6iXgeFbaNGtcP7g", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:47:01"}
{"_id": "aN2SWCKzTAoqwQNfg", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone State.~(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XAr6y6W46YbW4p7Dk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:34:06"}
{"_id": "7wcLRjQScAFKRZ5sv", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall s:State,e:Event | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JqtxAdD3zSHkK8aAh", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 19:03:09"}
{"_id": "DQwtoZREpLnZhxt9Y", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | some (i <: trans).s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "v7EBRGmMbhPtc8hKv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:13:00"}
{"_id": "h2vN3vPqzKbLQSn9K", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s1, s2 : State | (s1 in s2.(^onlyStates)) implies (s2 in s1.(^onlyStates))\n}", "derivationOf": "yHqNxwJQRF74YQLva", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:29:39"}
{"_id": "Pp2JD8GEeE42THNGo", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s : State | Event = s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "9nNRD2sT8RsLwacMQ", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:14:54"}
{"_id": "2BikvEnSHmPyNtHjx", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | s.trans in State.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FGojYeboRtN6cq339", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-24 11:06:06"}
{"_id": "ma5K3aabGaiBL9m4M", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Init.(trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cvCKLeejLwqCRZ683", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 21:47:26"}
{"_id": "ofAMghLpziZu4LqhT", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n  all x : Event | some Init.(^(~(trans.x))) \n}", "derivationOf": "2NuDKaP32sJ6dMdHG", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:21:45"}
{"_id": "bK6dBjRuS23djLYp4", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.(^{ s, ns : State | s->Event->ns in trans }) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | s.(trans.State) = State.(trans.State)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.(trans.State) = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t((State - Init) -> State) in ^{ s, ns : State | s->Event->ns in trans }\n}", "derivationOf": "25aYiS9MBG72qzTtk", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:32:12"}
{"_id": "pYrTKDXRPTkhkDfs8", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/State->this/Event}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:10:18"}
{"_id": "ESxBxSPzKZEr9Eq9y", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n  all u : Init | State in u.*{ x : State, y : State | some e : Event | x->e->y in trans} \n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KF5T2TFZeebnZAZQF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:36:25"}
{"_id": "4qZ257YoWcNx2aWuu", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State, e : Event | some x->e->State \n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jjGd5zdP3MmbmMBp9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:55:43"}
{"_id": "QGqZvBt5rj2D2GzEW", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init | s in (i.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FbLFnB9dTtPpenfxP", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:51:08"}
{"_id": "trrLcquDvCNFf3zkB", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i:Init | s in i.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DKpDz4ZvhE4enyp5n", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:37:19"}
{"_id": "m7zjN2d6qLab7pYXu", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : States \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LaDN8c8ps5b587FJK", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-12 20:51:07"}
{"_id": "WmoLLJtzBKpK3DNiG", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  all x : State | some Init.(*(~(x.trans)))\n}", "derivationOf": "uAFtPrdHn7TQqSMeE", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:29:16"}
{"_id": "uMpYPnwNiEMRtoyBS", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/ \npred inv5 {\n\tall disj s1,s2 :State |  no ((s1.trans).State) -((s2.trans).State) and no ((s2.trans).State) - ((s1.trans).State)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2km3rqSd4vQ5kJYrM", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": []}, "nodePositions": {}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2020-11-25 21:59:46"}
{"_id": "wPjFTDZr666njJHi3", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some State.e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AoupH3FgAr7tdyAjQ", "msg": "This cannot be a legal relational join where\nleft hand side is this/State (type = {this/State})\nright hand side is e (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 21:10:01"}
{"_id": "BjPSEAtex8bhLrd3G", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tno Init.~trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ghtb5Z6gR2NSdoNGr", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:12:29"}
{"_id": "3rFkAtFig2nyKZwwc", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n   all i:Init | some e:Event | no  (State  - (e.*(i.trans) ))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XWWWdTFCmurDYpLWk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 17:55:46"}
{"_id": "CDrJvkLrPRbbNhtW7", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s1, s2 : State | lone (s1.trans.s2)  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = (Init.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ocBsCZJQehn5WGCrW", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 03:52:19"}
{"_id": "ZRdpwj3jr8QEQLps9", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n   \t~(State.trans).(State.trans) in State->State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "NQrCKZEyD527G5k5z", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:21:30"}
{"_id": "LbHiNW4Q7uZbQdhW7", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "A3BHPtCPe9pirSAKo", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-1 12:09:02"}
{"_id": "xuxMtzJf6ypgDe3p2", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init | some e:Event | ( State in e.*(i.trans) ) or no Init\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Z72ZeHwM7vt6gZms5", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 17:36:29"}
{"_id": "LWmWQhEH5At7CxzdX", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-6-28 04:30:25"}
{"_id": "pwxvanJ7AqNxzwv2p", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 00:44:56"}
{"_id": "wophPwxQ66FGDpdtj", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/ \npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | ~(s.trans).(s.trans) in iden \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : s.trans.State = s1.trans.State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AiaRYJ9v4mMyyTx8p", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-4 17:47:14"}
{"_id": "TqFP89Ga8usQTfegh", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State |some e: Event | s.trans implies lone trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7ggaso3q5qAkijYMb", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 20:44:30"}
{"_id": "6qbPEXqeAHxTppx9p", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init | Node in x.*(trans.Event)\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "63GF8pj3pJkjmh6TH", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:23:37"}
{"_id": "PNxagPtEEPMf9xYNW", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n\tInit.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent = (State.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "bgh3RSg8Bdrxf5sYC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:39:44"}
{"_id": "xHbJQHcPdZQhrj7dR", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Init.trans:>State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, e:Event | some e.(s.trans)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "25YgHqaWAmvG8Wim4", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:11:00"}
{"_id": "ipfzsdmpb5gbhPTnP", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "E2YgP9ChHhS2qpCJg", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 13:44:16"}
{"_id": "4QiLT296NhEketr3s", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tall s:State | s <:(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4EBBsis4qm8vsGbyw", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 19:34:50"}
{"_id": "m5LcLoxndSsEMmvPR", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | Init.trans implies *trans.e\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "feLQAiKdXsNvqiyGi", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:17:18"}
{"_id": "s5WbNPscMrREpi6bJ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JrqrkDz5brK2HT7Ls", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 23:48:47"}
{"_id": "LfbHGEaFY6Fb2RzE9", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | s1->Event->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i : Init, s : State | s in i.*tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TzXKYAJNZBeJ3gPqp", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 15:54:45"}
{"_id": "63GF8pj3pJkjmh6TH", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init  | Node in x.*(trans.Event)\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TzxJgxnBE3EFBdbXy", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:23:08"}
{"_id": "YHsAvqXQC2t6yeDvr", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "7dQmwkvta8YHe5SiH", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:17:20"}
{"_id": "8HXqPCP7L5PhAZHDz", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init | State in  s.^(State->Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "iAGbTQY32rkzanQAh", "msg": "^ this/State . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 15:13:08"}
{"_id": "XnJF4qDukmnCX9E9D", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2: State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s: State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\nfun getEventsOfState[s1: State] : Event {\n  \t{ e: Event | some s2: State | s1->e->s2 in trans }\n}\n\npred inv5 {\n\tall s1, s2: State | getEventsOfState[s1] = getEventsOfState[s2]\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e: Event | some s: State | e in getEventsOfState[s]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\n\npred isReachableFromState[s: State, i: State] {\n  \ts = i or s in i.*onlyStates\n}\n\npred inv7 {\n\tall s : State | some i: Init | s.isReachableFromState[i] implies i.isReachableFromState[s]\n}", "derivationOf": "hE7NhN6MuhrXzBPau", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-2 18:21:16"}
{"_id": "jhhaPH46kF44rdbzA", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s1, s2:State | some e:Event | (s1->e->s2 in trans and e not in iden) \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FkFix2BQHkogjDHLD", "msg": "!in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {univ->univ}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 00:19:10"}
{"_id": "pKxS52xunTWWHEQYJ", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sZz4c8FfenjSLRCLt", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 01:41:42"}
{"_id": "68BGhkPF8rphDdvwq", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.*{s1 : State, s2 : State | s1->Event->s2 in trans} = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "Efftp5efx36AN6fCS", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:32:57"}
{"_id": "wY36GtXCcHfpPx8Jw", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zuQxrKqWagrtPfLxW", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:31:02"}
{"_id": "6NDnzZYowd3kwCKRb", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\ttrans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Q8RR6EJFDKwWd3zSe", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:18:32"}
{"_id": "cmmLL8motm4bj3kuR", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "i9YZvasXZuqGpBAcE", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-16 04:00:14"}
{"_id": "Kj9Mt55sh6WLYazXq", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tall s:State | s in :>(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7WGctuZADGtsayTtZ", "msg": "There are 29 possible tokens that can appear here:\n# ( * @ Int NAME NUMBER STRING String Time ^ all disj fun iden int let lone no none one pred seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 19:35:09"}
{"_id": "sko8kGSST5eAu4tme", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | all e:Event | e in s.trans \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Js5jccctBd9J8zMb6", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 21:34:18"}
{"_id": "eXp88jP74mqj2veBv", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | e->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s1, s2: State | all e: Event |some n: State| e->n in s1.trans implies e->n in s2.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "AGqXQGoqi2Mi3NKxh", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 21:36:28"}
{"_id": "ppFd3ajhTtcoXB883", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\nfun onlyStates : set (State->State) {\n\t{ s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t(all s : State | Init in s.^onlyStates)\n}", "derivationOf": "gt5BvqcXQAPxATqYM", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 01:14:00"}
{"_id": "KF5T2TFZeebnZAZQF", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n  all u : Init | State in u.*{ x : State, y : State | x->Event->y in trans}  \n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Agx2hgYkCRuFgg2gY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:35:28"}
{"_id": "dsdBpCRTc53qbRrZY", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s1, s2:State | some e:Event | (s1->e->s2 in trans and s1.~s2 not in iden) \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jhhaPH46kF44rdbzA", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 00:20:04"}
{"_id": "86ftTyN4avwubhTcB", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | Init in ^(~trans.s)\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:27:56"}
{"_id": "y3TawmuvppgmzRcyG", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NF6xM7Dbh447soneK", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 21:31:26"}
{"_id": "aLT9B5j4Pfct2g7i7", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in ^{x,y: State | some x.trans.y}.s\n}", "derivationOf": "fj9iNv23ovtsT9QMj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:44:55"}
{"_id": "HXMcqXSNTs7keZ4RL", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tInit in Init.*adj \n}", "derivationOf": "LC8M9QPJZHyo8SRTy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:32:37"}
{"_id": "TTLnooNKfK63FywHv", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "j8uet94sMhpWav3rh", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 14:12:19"}
{"_id": "hyawTdq6azgghZPdZ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s1 : State |  (Init->Event)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RTQaj6D8PNcetoYXy", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:01:48"}
{"_id": "tMrwmdxFKQohTXWRS", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { s1, s2 : State | some e : Event | s1->e->s2 in trans} | State in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "NChKsRpqcpR7fZDwK", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:13:44"}
{"_id": "rpQ3xvYCcJWpKpxCA", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in ^(Init.trans).State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "yMyPagxzy8mLNJztk", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 02:48:31"}
{"_id": "EQEZ8qBe5cBPSmcta", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit^.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qQKbkPPpimfyfpHwD", "msg": "There are 25 possible tokens that can appear here:\n( * @ Int NAME NUMBER STRING String Time ^ all fun iden let lone no none one seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 18:39:45"}
{"_id": "MESMzrZzfeEvZQ2sW", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in (^t).Init\n}", "derivationOf": "8FZM6oFFgSnwXczxJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 07:35:59"}
{"_id": "apGHrpFFsW7GxBELP", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init | State->State in ^(s->Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "rukEnAWMDYk2JsApq", "msg": "^ this/State . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 15:09:53"}
{"_id": "bZQaeMtHrzgZgqEqC", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event | lone e<:(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YJJEPvin2j9Jbei4r", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:13:46"}
{"_id": "BF5eLE2opy4oiTAGx", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in (Event.(State.trans))\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "p8hguY54XsnmSNeRr", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/Event}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:23:23"}
{"_id": "NoETSjQQTNKyjSQoT", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | some e : Event | s->e in ^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "EHKgg5Kqnx9wJCpFZ", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 03:50:50"}
{"_id": "N8kRycMeHamFjG7LW", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State , e:Event| lone e->State & s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XqmBbzNAXBXgoWgeF", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-8 21:33:16"}
{"_id": "giAcud2xgsaaj5TMB", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:(State-Init) | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n\tState.~(State.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FBXyfGgEeYKZFZ9Z7", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:59:10"}
{"_id": "9LTakr2A5Ep2Evgx3", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State,\n  \t\tsucc : set State\n}\nsig Init in State {}\nsig Event {}\n\npred x {\n\tall s1,s2:Event | s1->s2 in succ iff some y:Event | s1->y->s2 in trans\n}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some i:Init | s in i.^succ\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "E6z8epDdFFboKyngo", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/Event->this/Event->this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 16:04:43"}
{"_id": "zwobrwZaQx6SezccR", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone s:State | s in Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i:Init, s:State, e:Event | i!=s and i->e->s in trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "K5pJDMmXNPPDpxkks", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 00:29:22"}
{"_id": "SuBBjGvtaK8bbRfLf", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-12 19:38:00"}
{"_id": "JwjA5BRXufEfALbEY", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init <: trans | State in *(Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "dv5Sa8eLPBtJwFSP4", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:47:12"}
{"_id": "Gbn75jtDWnfzY6yaT", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State | some (^(s.trans) :> Init)\n}", "derivationOf": "Pp7fh5HGrc3DTT9iC", "msg": "^ s . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 17:47:02"}
{"_id": "EqGEufwAAbkkWfwwC", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function(s: State): State->State {\n  {s1, s2: State | s1->Event->s2 in trans}\n}\n\n\npred inv4 {\n\tall s: State | Init.^function(s)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KfDmmpA8Ya8zRhzir", "msg": "Name cannot be resolved; possible incorrect function/predicate call; perhaps you used ( ) when you should have used [ ]\n\nThis cannot be a correct call to fun this/function.\nThe parameters are\n  s: {this/State}\nso the arguments cannot be empty.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:58:24"}
{"_id": "HoHe7Q5hBSYr68jTr", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init in Init.^trans_bin\n}", "derivationOf": "GYCheC6yFHXhsj4in", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:51:52"}
{"_id": "yHqNxwJQRF74YQLva", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "Cdv3ah6uGmQYkSHAR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:27:43"}
{"_id": "uj3fXkwCJoybhxQWY", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.*{s1, s2 : State | s1->Event->s2 in trans} = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "6nTAmchoYNhwggwt2", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:33:36"}
{"_id": "6JqsYgGMHHx9R6GPJ", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tsome (State :> trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TTLnooNKfK63FywHv", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:12:49"}
{"_id": "gtqNTXT2444phWnK3", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n  \tall s:State, e:Event | lone  s.trans.State.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \t\n  \tEvent = State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xvjAJ6bufjuqXLFhn", "msg": "This cannot be a legal relational join where\nleft hand side is s . (this/State <: trans) . this/State (type = {this/Event})\nright hand side is e (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 12:29:23"}
{"_id": "EScsiyp9aTaRDh9d7", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | lone State.trans.e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "JJv4arqfcNkAmdpc8", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 21:45:10"}
{"_id": "jhJvFtKgTkcSKPHtB", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | State.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mRXZ85xZghuMm4ZXh", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is this/State (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 03:26:44"}
{"_id": "So2DdaqB7yXxJZmJ2", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | Event in s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "ncJEondTzX6NKfcrL", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 11:57:44"}
{"_id": "zRtmLyPRQEQ4zwBG4", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | one i:Init | i in State.(s.^trans)\n}", "derivationOf": "Wkpc5WTkp99sEWdbC", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:57:38"}
{"_id": "Ge9anQtTNofL7Fo2Q", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | i->s in ^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "ofRf2BSH9ytrqKtjP", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-14 00:47:43"}
{"_id": "NFuPnLBaGsmFTWtjz", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "ub9ZtZRjS48eP8yaw", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:35:40"}
{"_id": "sjHobfkSEDrgrRp7p", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | Init in ~(^strans)\n}", "derivationOf": "ppPxQ3SaMjWeMCME3", "msg": "The name \"strans\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:29:13"}
{"_id": "Zn5dLxn6QF5GGSuWX", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State, e1,e2:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans \n}", "derivationOf": "cmDtozi8cbMPGFp94", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:41:25"}
{"_id": "QRR4KXHeWqHLDCGcY", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GBxQbw7vqtq3EpuPz", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 22:48:47"}
{"_id": "jZNZQt8F6GhXMPxym", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | some e.(s.trans) \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GmnFc7zKSY4b3eEp5", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-18 22:18:19"}
{"_id": "FjxQkpLFATbiDWpGH", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all e:Event , s:State | lone e in s.(State.~trans)\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ByiPZzDjAyLh6HXbm", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 18:42:27"}
{"_id": "XWWWdTFCmurDYpLWk", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "C3MWDcRmCprohSyr9", "msg": "There are 1 possible tokens that can appear here:\n.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 17:55:18"}
{"_id": "3uf5wuBddLQL7wxQD", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 11:04:55"}
{"_id": "R9gnew9AnPKtw5nTy", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  some *(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "C8p5kc8s3gXEEG7hd", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:25:38"}
{"_id": "6R9kM54GsaoCirmgQ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State, e: Event | lone e.(s.trans)\n  \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\npred inv4 { all s : State | some i: Init | s in i.^adj \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7JEXrN8cuzzj5ACm2", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-18 12:06:46"}
{"_id": "cEafhonXEbBreFDda", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XqtySiyoxYtTbeMQJ", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": [{"parent": "State", "type": "this/Init:State"}]}, "nodePositions": {"State0": {"x": 385.6640625, "y": 132.66666666666666}, "State1": {"x": 385.6640625, "y": 265.3333333333333}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2020-6-30 14:48:05"}
{"_id": "ZDrWfTmkQsdK2wyhH", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XemESeik62ZpsKCRA", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 18:10:51"}
{"_id": "iKKLCqW6hnH42DheJ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n  all u : Init | State in u.*{ x : State, y : State | some e : Event | x->e->y in trans} \n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ESxBxSPzKZEr9Eq9y", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:38:30"}
{"_id": "xrwDWdtzp64N3SoZr", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some s.(Init <: trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nC3m6H9WCedeJYk5s", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:13:25"}
{"_id": "S6yDJ7L8jXppJ4DaL", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | all Event in s.trans \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sko8kGSST5eAu4tme", "msg": "The \"all x\" construct is no longer supported. If you know the range of possible values of x, consider rewriting it as \"x == set_of_all_possible_values\".", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 21:34:42"}
{"_id": "LmNwyugMnZnHtKwZA", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KBa2WXG9sCtxaBfT5", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-10 23:49:26"}
{"_id": "siENELY8eTJNJQ3zm", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone t:trans | t in e->s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nKkEYsJhZ4o9ieaso", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:53:51"}
{"_id": "27JYnT6faL3guYvTi", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | s.trans in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LhNmScJLrfwHBHmiZ", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-30 19:45:33"}
{"_id": "3DxtaZqJ6insJCYp2", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState.^trans in State \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\nD\u00favidas\ninv1\ninv3\n", "derivationOf": "5uh4d8psYokqvhSPF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-19 15:46:32"}
{"_id": "wa2DGfX7tKTd4ERy6", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State| lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JDiqWB7ve2PSxdvfh", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:35:19"}
{"_id": "tiMaHRjqyKbEdd5DP", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:05:12"}
{"_id": "JyqDJnKJudEpTXcYC", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tsome State.trans & Event->State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "t4qy5AZsQnQexw9Zq", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 21:29:52"}
{"_id": "qwSxzFha6A3e2A2bt", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | (x.trans).Event in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fd37sfuYKd9tQfLq4", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:47:26"}
{"_id": "7CtCrfbxP9Qzcfoiv", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s1,s2 : State, e : Event |  one s.trans.s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xRDCokKY5AKG2qPLd", "msg": "The name \"s\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:06:41"}
{"_id": "EbJcRuNGLqubP9tmy", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet adj = { s1, s2 : State | some e : Event | s1->e->s2 in trans} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some (trans.State).e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Qqr9rGvSRoJEGX4P8", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-3 11:17:21"}
{"_id": "WujjAnzfyioXCtDx5", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some Init<:(s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TwPJvjJvvQtDHaxsE", "msg": "<: is irrelevant because the result is always empty.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:20:14"}
{"_id": "ZwdzKb2XHZYXQbBiW", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n   some (Init.^adj)-Init implies some ( ((Init.^adj)-Init).^adj & Init )\n  \n\t\n}", "derivationOf": "XodZwJpY77vNSBkTX", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 16:31:52"}
{"_id": "e9cEapTp2JrgB5rf3", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dkxaZWsg9ACDQRrh3", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-18 11:57:10"}
{"_id": "tNvYxzmyxMJoNgG82", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  all i: Init.^adj|  (some Init in (i.^adj).^adj )\n  \n\t\n}", "derivationOf": "EWSwZcvByrTB3rEBz", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 10:50:41"}
{"_id": "z2czByYhYDs5eyvkb", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone State.~(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TT6yqSNjoBFTFb2Xi", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 23:35:24"}
{"_id": "4chD9fjQ7pqNTK82F", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YNK5ctDjXvzXMPn6i", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 23:29:08"}
{"_id": "79R3JRXcKDC2Kv9Re", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    all s: State | s in s.^{x, y: State | some (x.trans).y}\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:07:31"}
{"_id": "2NJkxARBhqCFPpvTy", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event |some s:State | lone e.s.trans in State \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CRqTqyw6sJjTxxBv7", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 14:20:03"}
{"_id": "7XP9t2kDDgsvpyHpa", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "eEL6ddgZTGM6Qotaj", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-30 19:58:06"}
{"_id": "z8bvPoFwkEg3j5cox", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event | lone e in s.(State.~trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mgkT3Nb8Ay2Jq6jiD", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 02:51:49"}
{"_id": "faBQcTR2ikP2a47E8", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "A4dk9FJH3exJTsNwZ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 11:05:27"}
{"_id": "BwLRy2umNiLChYra7", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in Event<:State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AjjATR6nvRjNF2dmn", "msg": "<: is irrelevant because the result is always empty.\nLeft type = {this/Event}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-20 08:25:26"}
{"_id": "yZdgfeMWBvWZM9pLS", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\ttrans in Event -> State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ezZQQL6LuP2w8dPnc", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:21:05"}
{"_id": "Xei4Hw5kYp32QZH6x", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some x.trans in Event\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rY8ai4ToSCY4btsGA", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:45:35"}
{"_id": "7FSyKeL6Yj7GujK8S", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 \n  all i:Init | some e:Event |  State in  (State & e.*(i.trans) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sjgCKpDB3nNMoHHja", "msg": "There are 1 possible tokens that can appear here:\n.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 17:54:11"}
{"_id": "ibdZRZ8Ga5u6NBgPi", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | (x.trans.x) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "23T3ny9zAa87w4okC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:52:23"}
{"_id": "DAntKePWHhK5kESLn", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "o7BX34uR9hgqTbJKL", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:25:32"}
{"_id": "pYsxTtMSRBmTrpRH2", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState.trans in State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cCndEh8J9eBfEBPxH", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-19 15:24:47"}
{"_id": "Zqtjy4sLvYhSspzBA", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 19:04:19"}
{"_id": "nS97m7XM7awPpsSnd", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s : State, e : Event | s->e in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CDrJvkLrPRbbNhtW7", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 03:55:08"}
{"_id": "YYZFBjHZwfATgk2Bh", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TvvrvYcteFE2dZtj3", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:24:47"}
{"_id": "DAbaXwpJYtYK2WtJT", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some State.trans.e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "EScsiyp9aTaRDh9d7", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 21:45:48"}
{"_id": "obB7dShuko2B99zGS", "cmd_i": 2, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | (~s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "Sv3a7L2NhZwWMbsb3", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:23:09"}
{"_id": "oKaiowMjpjD2nL3uE", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dhrcsqgeMJfi8XgvA", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 22:07:05"}
{"_id": "7Xc3FWLsGPY6ph6yo", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t((State.trans).Event) in State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iBpwieENXEGisK8Fv", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:46:11"}
{"_id": "4fSJgRicdiExsDy4x", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2: State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "oRNHfzfRRt8hQmCdS", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:18:33"}
{"_id": "C3MWDcRmCprohSyr9", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 \n  all i:Init | some e:Event | no  (State  - (e.*(i.trans) ))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nWdeoDaoeuJntSDKC", "msg": "There are 1 possible tokens that can appear here:\n.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 17:54:47"}
{"_id": "zBzNr7px28pcwQy2v", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tno Init.~trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tone Event.(State.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BjPSEAtex8bhLrd3G", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:32:29"}
{"_id": "5oEzyNBpx2yDcSAyG", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | State in Init.*(s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "NAZeg9iBDknEnTKDC", "msg": "The value of this expression does not contribute to the value of the parent.\nParent's relevant type = {this/State->this/State}\nThis expression's type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:42:46"}
{"_id": "oRNHfzfRRt8hQmCdS", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.~(^onlyStates)\n}\n\nfun onlyStates : set State -> State {\n  { s2, s1: State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "9H78LLKamGnQbRpER", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:18:14"}
{"_id": "pw4CeSHwtAP2D8DEJ", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n  all i : Init | lone i\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "X7LCCy3p3i848rYGn", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 09:40:26"}
{"_id": "Mv7MoQSo2STeZSW8D", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State , e:Event| lone e->State & s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.trans.^Event\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4dRPRhJ5PobxYD892", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 21:37:30"}
{"_id": "t2k3nv8XfLgeEjjjS", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | e1,e2:Event | e1->s in s.trans and e2->s in s.trans implies e1=e2\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yPmJcRitYiKH6hi9q", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 18:57:09"}
{"_id": "dnN5g2Yyw83vHrdQF", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n  all x : Event | (trans.x) in State one -> one State \n}", "derivationOf": "sAw6obAHu2rwDbqdo", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:10:33"}
{"_id": "8JH9ocmftCgRDRamB", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone (s.trans).State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "w4tuKvF26d3CedAF7", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:21:41"}
{"_id": "xS6mBeCxSoaQ7nohQ", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | some e : Event | s1->e->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.^tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e : Event | some s : State | some s.trans[e]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : Init.^tr | some i : Init | i in s.^tr\n}", "derivationOf": "tW8WZsihiMjQMsj2i", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-8 16:16:43"}
{"_id": "AwznRZL9M5vFAHd6Y", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yRSRBERSA6fJzTCcM", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:12:00"}
{"_id": "SjPsRa6DaR3CJnMHE", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Xn5pvgPPhPr3QufHH", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 22:48:24"}
{"_id": "gw53dfwNfnepJMhYH", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | s in Init.trans.State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "vZ79shqiSNPHpf5pz", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 03:00:17"}
{"_id": "dFr7AJau2XrfS67cy", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | lone e:Event |  e->s in s.trans \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wqvHaGsyPCvK6zbSv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 18:52:40"}
{"_id": "oiSkceaxBBZKCTAb4", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.*trans_bin = State\n}\n\nfun trans_bin : State -> State {\n    {s1:Book, s2:Addr | s1->Event->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "bXqeodHM4vK9ZfpgX", "msg": "The name \"Book\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:31:22"}
{"_id": "MdMFLiDqsRd8265X6", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 :State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State-Init | Init in Event.(s.^trans)\n}", "derivationOf": "NWf9jj5k8tx9Ai44x", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 00:21:47"}
{"_id": "3idug6hzR8xq8kGCQ", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet adj = { s1, s2 : State | some e : Event | s1->e->s2 in trans} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some (trans.State).e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RhbG2cMyLRSdGTvpm", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": []}, "nodePositions": {"State": {"x": 492.328125, "y": 199}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2020-12-3 11:18:39"}
{"_id": "NtRNksbnANJJdQbid", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mHzQ6czva6NHY4GKf", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-20 02:03:31"}
{"_id": "cwKtvigZxa6RjsX2N", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  {s1, s2: State | s1->Event->s2 in trans}\n}\n\n\npred inv4 {\n\tall s: State | Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "v95xsWhiKeT6PTJZr", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:56:12"}
{"_id": "X7LCCy3p3i848rYGn", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n  all i : Init | one i\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MFvEmbqbZY9roMDC6", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 09:39:46"}
{"_id": "ofRf2BSH9ytrqKtjP", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | i->s in trans.trans.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "YXkan9Xg4NFQFf4nc", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/State}\nRight type = {this/State->this/Event->this/Event->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-14 00:47:25"}
{"_id": "hFtGTLM2gs79Rewif", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y : State | some e : Event | x->e->y in trans} | \n  \tall disj i : Init, s : State | i->s + s->i in ^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JDCTeNjoKbWYBrkzk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:19:12"}
{"_id": "vNwFWWBTiTLwPuY42", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | Init.*(s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "QTYZaAunTrkwX8NGB", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{univ}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:42:19"}
{"_id": "QoDb3kqWqCrHZQ4YZ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall e:Event | State in e.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sXYMhtcjahwgLgNuQ", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:22:17"}
{"_id": "q6gYp2Nxk6argvnKJ", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1,s2 :State |  no ((s1.trans).State) -((s2.trans).State) and no ((s2.trans).State) - ((s1.trans).State)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "25YgHqaWAmvG8Wim4", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 08:59:26"}
{"_id": "Bts8GbbfMhR3JG4bS", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2j8N8zRkn2FjgJqeA", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-26 09:29:20"}
{"_id": "zbXnStkdRWk3YH3hj", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    iden in ^trans_bin . ^trans_bin\n}", "derivationOf": "Jk4P2gf3Fu3sH9TBu", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:48:30"}
{"_id": "fzDPM56S7AYCcxSxi", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t~(trans.State).(trans.State) in iden\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zzCjrN8GnCTWKqKDk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 20:10:19"}
{"_id": "TrEHqdojbZHJRTuwv", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in s.^{y,x: State | some x.trans.y}\n}", "derivationOf": "JuJn6m7wDQKwXtdFF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:40:05"}
{"_id": "siDgjtxe6k2sJCavg", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "YxYf6RcXzEpjyM9fq", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:06:27"}
{"_id": "SnhREjyhooNnyQ2E7", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some (x.trans)\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "spQQGv48FjstTfgWM", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:50:31"}
{"_id": "SomRwtTbp6TNrLZKC", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n\tlet adj = ( all x,y:State | some e:Event | x->e->y in trans )\n  \t^adj\n}\n\n/*\nAll the states have the same events available.\n*/ \npred inv5 {\n\tall disj s1,s2 :State |  no ((s1.trans).State) -((s2.trans).State) and no ((s2.trans).State) - ((s1.trans).State)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "BQev54SNdhCJyiwnc", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:01:28"}
{"_id": "kxucuuSWY8G8L2zcj", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ScnwumQE9nS2T9wAd", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 18:13:05"}
{"_id": "feuH3iYTMPpep7Di2", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s->trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit in State.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CvvzzcJ5iGtXQwgtZ", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 18:10:05"}
{"_id": "WseRshCwyctThtGT9", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tiden in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tbymttEjfs3x9Wbej", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {univ->univ}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:42:11"}
{"_id": "XodZwJpY77vNSBkTX", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n   some (Init.^adj)-Init implies some ( (Init.^adj).^adj & Init )\n  \n\t\n}", "derivationOf": "gFC8Edv5WnmGATSe6", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 16:31:34"}
{"_id": "tB7g5Bxkno96Rgxzs", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: Event.(State.trans) | s in ^{x, y: State | some (x.trans).y}.s\n}", "derivationOf": "6uxzpp2j3zD8bwc7z", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 21:54:00"}
{"_id": "4ZqBLsMcGwHY6PXhQ", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\nfun onlyStates : set (State->State) {\n\t{ s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t(all s : State.^onlyState | Init in s.^onlyStates)\n}", "derivationOf": "ppFd3ajhTtcoXB883", "msg": "The name \"onlyState\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 01:15:13"}
{"_id": "sj85povS3b5S6kgKz", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  \n  \tall s : State, e : Event | lone e.(s.trans)\n  \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s : State | s.trans.s in Event\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tPeZrSkPap6wDZjj3", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 11:10:50"}
{"_id": "mwmXcK5K375msvC7K", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  some State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 19:05:38"}
{"_id": "6GmWCSKZoHBonmp5i", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LbHiNW4Q7uZbQdhW7", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-1 12:09:06"}
{"_id": "pkTfpwFdTRZ2YufpA", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {all s : State | lone s.trans \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7Gwu6tWCcBQWqdtPc", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-17 21:11:38"}
{"_id": "fc4qMYCpZp2wiyqXJ", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tone Event.(State.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:20:31"}
{"_id": "yQmQ8tH7GREvhic6t", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in ^(Event.Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9z7LfYQR9jLTWLnpR", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is this/Init (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-13 00:03:33"}
{"_id": "g5ySxpi9dFohkwkWq", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tState.trans in Event -> lone State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y: State | some (x.trans).y} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s,t:State | s.trans.State = t.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\n\npred inv6 {\n\tall e:Event | some (State.trans.State & e)\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet adj = {x,y: State | some (x.trans).y} | all s:Init.^adj | Init in s.^adj\n}", "derivationOf": "EfYzkvLayN5EfriZP", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:29:23"}
{"_id": "eKT7oNd75GTeHBYWp", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some trans.s \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "itmpFrC2gZ7cickNa", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:06:23"}
{"_id": "jCtvbNM2PdBhpG76c", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-5-4 21:14:11"}
{"_id": "WGgDWbx7vE9CBuEzw", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "z7MxrjeYqyZZN6m7G", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:24:24"}
{"_id": "q6N8pvtMy6cm9pRxp", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Yg74uBa3e8CPZqyM3", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-2 18:11:17"}
{"_id": "sZz4c8FfenjSLRCLt", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\talways State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "This expression failed to be typechecked line 17, column 2, filename=/tmp/alloy_heredoc17613142719941237604.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 01:41:13"}
{"_id": "r7oCvtf3EZTaTYdmQ", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone State.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gc6jZkEguJkg8Dejj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 01:04:55"}
{"_id": "65Hr9cs5BS8Wb5PNM", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(Init.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Zob4cAH94t6e5oCdt", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-30 19:25:23"}
{"_id": "8xDTksmaGXkqpB4e8", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tState in State<:trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wpgKdEZnbYzRqd7fv", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:13:11"}
{"_id": "4wJkRwFkoHWC7eYPw", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t~(State.trans).(State.trans) in iden\n}", "derivationOf": "uRxJ3oxGWJ6PY9Yss", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:19:00"}
{"_id": "LpkpoL2xnpzMvpetb", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tNode in Init.*trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jRMRmjpuXZQMDabJk", "msg": "The name \"Node\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 21:46:07"}
{"_id": "3WTj9R6ESxakrg48M", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tsome i : Init | State in i<:trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vPcpJWvu26Xcitnqy", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:04:54"}
{"_id": "SFMA3Y9eEk9uDFnSQ", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some (x.Event.State)\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rb85AHqSRSzMMogds", "msg": "This cannot be a legal relational join where\nleft hand side is x (type = {this/State})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:53:26"}
{"_id": "4SxScxsexGDXpx6uy", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NAd2ZWLBsQdtbzZw5", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:31:25"}
{"_id": "t4qy5AZsQnQexw9Zq", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tsome State.trans & State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "d75QkQERzu6hHAhBp", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 21:29:42"}
{"_id": "23T3ny9zAa87w4okC", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | (trans) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "W2uCctfL3Ce7ovG3X", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:52:14"}
{"_id": "FPXCZZGzDhCASW5PM", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init | ^(State->Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "umdyo8PTCGapgK8iS", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 15:11:51"}
{"_id": "Z5ysTm9iKTzxRF9ND", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | Init in ^{x,y: State | some x.trans.y}.s\n}", "derivationOf": "bRFQpAEvxKw9tHTRh", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 01:14:24"}
{"_id": "FrhGTvj9va8M8QeFP", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlet k = trans.State | iden in k.~k\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gLyXJ8f3d5FpJvzv9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:11:36"}
{"_id": "Ykphe4t2iqsDZxZba", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State |one e: Event | lone trans.e in s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "X5J7ozcsgFrfsApnv", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 20:42:42"}
{"_id": "5ZvEjJ7WdrhYyJuga", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in (State.(State.trans))\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "BF5eLE2opy4oiTAGx", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:23:33"}
{"_id": "d8QFG2oyBXtvjiP9m", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s1, s2 : State | (s1 in s2.(^onlyStates)) implies (s2 in s1.~(^onlyStates))\n}", "derivationOf": "h2vN3vPqzKbLQSn9K", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:29:45"}
{"_id": "JdtqH7XN4L2cecmFP", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  Init = trans.State.Event\n}", "derivationOf": "vqChXydkNoR2FqzAg", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 22:00:09"}
{"_id": "md6eggZLwhzerCMZC", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  all s : State | all t : trans.s | lone t \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "z4ZNGAhpZhyhd3ixG", "msg": "Analysis cannot be performed since it requires higher-order quantification that could not be skolemized.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 09:55:39"}
{"_id": "fdc4iJzeoP23PhvPu", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    State = trans.(Event->State)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JB9Yr5iybWfrGxZim", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/State}\nRight type = {none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 00:48:19"}
{"_id": "3L89ZdA9DAtae7NQ9", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State, e1,e2:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans\n  \n  }", "derivationOf": "ZpyiStEbDWj59KPCF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:46:43"}
{"_id": "Hg2eMvqcWnvB63DjG", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone s.trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tsoRMzFknvPJDKPbP", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:18:04"}
{"_id": "FSYsPaBoM36KnkXxm", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlet k = trans.State | k.~k in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7vy8uN8SCqwvZPPQC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 13:57:26"}
{"_id": "xMhvuBNDAe8baH43X", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some e : Event | x->e->y in trans implies y->e->y in trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "hJF6fAEHuFwmkaHaW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:26:39"}
{"_id": "Fymp6XprR4XyPxFuo", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x:>trans in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xgeDcLj5G9rqRQw5K", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:46:11"}
{"_id": "Sd9mPz8A8436vHtb2", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone (e.(s.trans))\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1, s2 : State | (s1 in Init) implies(s2 in (s1.^trans)) \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HPtndyq2xtXyLQQcD", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:16:05"}
{"_id": "RZMPuNQbfbLuiakHp", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  let trans2 = {s1, s2 : State | some s1.trans.s2} | iden in ^trans2\n}", "derivationOf": "QCiggZ2nWMKwAecmb", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:23:42"}
{"_id": "Y8Psxj6dipgfW3NXL", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some x->Event implies some y->Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Y4vt3252tCD3XXTMD", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:02:38"}
{"_id": "WGf64ryHpyJKT8DBq", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s1 : State |  (Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tmSn2s59o2vpMWLXQ", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:58:05"}
{"_id": "2hB5GYKemsn828P6m", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone State.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "eZeHkWhNrnNDr7Eaf", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 18:34:52"}
{"_id": "tKtxbLDHexmy9gTwv", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.~trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "v2H3vDAiA9TLpFsdn", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 02:43:54"}
{"_id": "ueuPXewT6XcpW3dYM", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | Init in Event.(s.~trans)\n}", "derivationOf": "iDaYQgPqC2unNgCHr", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 01:18:52"}
{"_id": "pnpNh8FMXLNXRY7iC", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init <: trans | State in *(s->Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "JwjA5BRXufEfALbEY", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{none->none->none->none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:47:35"}
{"_id": "EWSwZcvByrTB3rEBz", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  some i:Init| some i.^adj  implies (some Init in (i.^adj).^adj )\n  \n\t\n}", "derivationOf": "Ktxy98ptFebK26kgn", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 10:50:09"}
{"_id": "ezZQQL6LuP2w8dPnc", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\ttrans in State -> State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7DB7urE7QWhKe89rr", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:20:44"}
{"_id": "3KebtqvmF2r32pBDw", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | State.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qXD6k8RPpKYPQbbD6", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is this/State (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 03:25:52"}
{"_id": "3AbKxKS5BMDFr77ez", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "wD9AjnRaFrWqzehcW", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-17 19:11:00"}
{"_id": "SHKiPciiAD7P73Bnq", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sQS6reeyJbnM7FtjN", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:33:47"}
{"_id": "W5u4R89X6NDFJuZo2", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | all e:Event | all e<:s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e<:State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bJWwSPbHd9drijjw4", "msg": "The \"all x\" construct is no longer supported. If you know the range of possible values of x, consider rewriting it as \"x == set_of_all_possible_values\".", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 20:05:00"}
{"_id": "GWS6enDDxMrkGwQzv", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:06:09"}
{"_id": "C5KzGyrqShD3Ys4wA", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  one (Init.trans).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bZdNykzA3GBbLw9Nu", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:05:20"}
{"_id": "HDsEtZgn76enNkhxh", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zxHg2Et857Yb3RGG3", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-9 03:22:43"}
{"_id": "znsySdq62KhsRGq3H", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init | State in s.^(s->Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "9TsPmmRpzTFnGuHQD", "msg": "^ this/State . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 15:09:20"}
{"_id": "DidqAAq6Dyg5ksJSg", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t one s:State | all s2.State | s not in Event.(s2.trans) \n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yhGzmEwCA5SthyQXF", "msg": "The \"all x\" construct is no longer supported. If you know the range of possible values of x, consider rewriting it as \"x == set_of_all_possible_values\".", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 02:02:06"}
{"_id": "ESZqW8zTKKDgvAXWj", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event | lone e<:(State.trans.State)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bZQaeMtHrzgZgqEqC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:14:06"}
{"_id": "F79bwqgsP6gZ29ke4", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | all e1, e2 : Event | some e1.(s1.trans) and e2.(s2.trans) implies e1 = e2\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nwm7Tcamyg8NnCEd5", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:31:06"}
{"_id": "Zp8cPzryKTnwFSTeh", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  State.trans in State\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FvHdESyZvs74TkiCa", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 20:46:58"}
{"_id": "AYKHGPSRLXzDT4Zeb", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet t = { s1,s2 : State | some e : Event | s1->e->s2  in trans } |\n  \tState in Init.(^t})\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6cAhMwWFKrwDYdWdT", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 11:01:56"}
{"_id": "mkKixwqvMr4RhirqZ", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State, e1,e2:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans\n  \n  }", "derivationOf": "3L89ZdA9DAtae7NQ9", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": []}, "nodePositions": {"State": {"x": 444, "y": 199}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2019-11-11 12:47:13"}
{"_id": "cgZwuepgtoFkwzrKF", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | e in s.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xSFtexcSQsqcPnadq", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 09:16:04"}
{"_id": "NzEaGyt3Bz2QYJAzE", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall e : Event | trans.State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7Zed4fmD7Tv3pJxAB", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:38:06"}
{"_id": "otLCnDexmaShWFNMx", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JNmfS5SDRcodqRyEi", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 02:58:21"}
{"_id": "8FZM6oFFgSnwXczxJ", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in ~(^t).Init\n}", "derivationOf": "5yvqu5J2HbcoGi7qo", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 07:35:54"}
{"_id": "YqYnoZo5CQCNDTmva", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | all s: State | e.~trans.Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HNdZgYsDLWumWJCYy", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:11:46"}
{"_id": "foSvqn2hhA4js7HmG", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HR3BS47qkjWPf2gRE", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 00:15:30"}
{"_id": "We67v3acFZ5Ap9H45", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | s in Init.^(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "trHc5RSsGPS9jjoF7", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:28:24"}
{"_id": "X7vg5ZQfLZEDez2KE", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some Initial.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3WTj9R6ESxakrg48M", "msg": "The name \"Initial\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:05:35"}
{"_id": "ppxTEb5wASQCddCWT", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fk6pkoZ6S8MsnRhcR", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:23:29"}
{"_id": "49QD5Bwe6SGykwJwS", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in ^Init.trans[Event]\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Wjsj4zQEduhMspM6i", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-9-12 09:51:20"}
{"_id": "JvxaTmMw6z59zyQ6w", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | some (s.trans)<:e\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "Hsyd6ASi7hsfeknYq", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 11:55:40"}
{"_id": "rDGk2ChxbTxFr6h9H", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\nno Init  implies no State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yttwfba58di2tHnJY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 13:52:10"}
{"_id": "zY8ouykTfe8ccouzx", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  some State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LPNx7iK395MYFoQ35", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:57:36"}
{"_id": "FmkxGcgqmjKcmCK7y", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  all x : State | some (*(~(x.trans))).Init\n}", "derivationOf": "P9CkpYDWJhNzAauMx", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:29:50"}
{"_id": "9dEzqm3qnnG5n8obv", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | lone e.(State.trans)\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nQmrtzg4CfQd6ZoxL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:14:13"}
{"_id": "mRXZ85xZghuMm4ZXh", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | State.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TRrebTpmxk7SZ2MGR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 03:26:11"}
{"_id": "uKud5aRKmNAAhNvwm", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s: State.trans.Event | s.^{y,x: State | some x.trans.y} = Initial\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "The name \"Initial\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 11:09:18"}
{"_id": "dyNhvv7mD8LthJNdg", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans} |\n  some e : Init | Node in e.(^t)\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nQFXeHG2HfbHbaCXk", "msg": "The name \"Node\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:47:24"}
{"_id": "M4YBsDHGQrsbGrost", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s1 : State |  ^(Init.trans).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "H5sb3p3h8Nd2DYw7W", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:57:52"}
{"_id": "grhcYKpKgzrTtHXXA", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init <: trans | State in ^(s->Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "uAXLWGmH9fi9ERSd4", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{none->none->none->none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:51:10"}
{"_id": "ZdgQpf7pK47qFGn6Q", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { some trans.State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "33DXHvW4TfEJuGo2C", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-15 16:03:09"}
{"_id": "gFC8Edv5WnmGATSe6", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n   some Init.^adj implies some ( (Init.^adj).^adj & Init )\n  \n\t\n}", "derivationOf": "ouBLqHcZqGDqiMQWB", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:55:42"}
{"_id": "QXrAHxoYFzyYt4QBg", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in {x:State | some Init.^(trans.x)}\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RpeePbrvZeeLsojsN", "msg": "^ (this/State <: trans) . x is redundant since its domain and range are disjoint: {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:54:27"}
{"_id": "vhKgTKA8yZFfNSSTF", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | s.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "SxjCD9nWcuhpymTLK", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:34:56"}
{"_id": "syyQ6mpocu3qZFyGJ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { State.^Init\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fXMqC6dzFbLRkTmkq", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-15 16:57:24"}
{"_id": "WpkxqxJ3iAEsw4CcX", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3788zmEJXk2uKwjiM", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 09:34:10"}
{"_id": "9WWsN5NLZ3JAtfs64", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | x->y in trans implies y->y in trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "5ZvEjJ7WdrhYyJuga", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-23 08:25:46"}
{"_id": "A84YFkPtvw2m7Qm73", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s:State | lone trans.s\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CcSeH4dR3weQQZ2Nt", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-15 16:04:01"}
{"_id": "WWeAmm4Ddq9vW2KTi", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\nall s:State | s.trans != none\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jtyMf2ykdm6K5rSBR", "msg": "!= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/Event->this/State}\nRight type = {none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-6-10 10:05:24"}
{"_id": "CsdGmDof4xrDzDave", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some s.(Init:>trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QCf9fKofawNvrJd8Q", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:11:02"}
{"_id": "6hRYmf2oLrh4GBGhw", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init in (Init.^trans2 + Init)\n}", "derivationOf": "s7fsodsB6otdQuzZx", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 11:00:26"}
{"_id": "T8BsbGR7WaMgPMhJD", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State  | e->s in State.trans \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZTryZEmCphMYHayy4", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-14 00:11:29"}
{"_id": "tKD6ph35QursESDev", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e.(State.trans)\n  \n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall r : (Init.^function) | all i: Init | i in r.^function\n}", "derivationOf": "9gejYBkav9tLKtQHL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:22:05"}
{"_id": "BwN6ec5F6Shi9Qygr", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tall s : State | Init in ~s.t\n}", "derivationOf": "iGybLpS5RusY6NNxi", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:32:09"}
{"_id": "gYjM2rTJqmTZjpsg3", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : (State-Init) |  some (Init.trans).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SEj78YyBdYr8e6HnF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:05:47"}
{"_id": "PQ9anQQHCw9HPzB3J", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "sv7P2CyD5MKbLn9Re", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:27:30"}
{"_id": "ajnBbYo5H95c54cfB", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t~trans.trans in iden\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\talways (all s: State | lone s.trans.State)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "x98qaJ42dJDRFAv6C", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 20:09:07"}
{"_id": "7DB7urE7QWhKe89rr", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | e.(s.trans) in Event.(State.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "osausyiBnixvvYRGt", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-18 22:19:08"}
{"_id": "fRSmbebWKKkqLkjux", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone ~(s.trans).e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "42mKL9ao3GX7nyMmQ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 22:49:13"}
{"_id": "NAd2ZWLBsQdtbzZw5", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | some e : Event | lone (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "F3kKcj2Xmx8zMhtJ8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:24:03"}
{"_id": "SCihc4brbrm9F6c7c", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | (Event.s).(s.Event) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LmNwyugMnZnHtKwZA", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-10 23:55:49"}
{"_id": "fCFyrYTpkL44BGX7t", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone (e.(s.trans))\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1, s2 : State , e : Event | (s1 in Init) implies (s2 in (e.(s1.^trans))) \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "X38nLSSsBn727wTfk", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:18:04"}
{"_id": "HoBzqJpQGzSGdFvJo", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  all i:Init |(State-Init) in i.^adj\n\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MRBtNPFJyhJpKhyed", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:03:06"}
{"_id": "F8SgtzdFKLoxKKZX9", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    State = trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sPSx3jCWvPtRAiHjb", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 00:51:52"}
{"_id": "zzCjrN8GnCTWKqKDk", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t~trans.trans in iden\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gtxGC8NpW9iCnWmQs", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 20:09:54"}
{"_id": "RG2w846kyCjBCP98s", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone s.trans->e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "igcZXsZCJXecCx6XM", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:20:11"}
{"_id": "3sWffFbixcJZhurpJ", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone trans.s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kxucuuSWY8G8L2zcj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 18:15:07"}
{"_id": "sFsjEyWzxiRAaJrys", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x<:trans in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Fymp6XprR4XyPxFuo", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:46:17"}
{"_id": "BP9SfQfSsuLkBhcPC", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | s.(e.(Init.trans)) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "65Hr9cs5BS8Wb5PNM", "msg": "This cannot be a legal relational join where\nleft hand side is s (type = {this/State})\nright hand side is e . this/Init . (this/State <: trans) (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-30 19:25:40"}
{"_id": "aW2ePoPconevuPg6K", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    State.trans2\n}", "derivationOf": "HoHe7Q5hBSYr68jTr", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:54:29"}
{"_id": "9BMbZYmWReZNDaMGQ", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet adj = {x,y : State | some e : Event | x->e->y in trans} | ^adj\n}", "derivationOf": "D8M8gwnNRGMNQ8244", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:10:45"}
{"_id": "FJRLZz3u4FJQ5tERF", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  some *(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "sZ57ZgzFpA3ePz8Pd", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:25:59"}
{"_id": "zRFrY9Xj9rYDoRew8", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init = Init.^trans2\n}", "derivationOf": "rFRtfzDoLFtNgZKmL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:58:52"}
{"_id": "sfyMdPKDgFKH5xM2y", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-2-26 09:12:54"}
{"_id": "aNkAcuNXN4R2GGDkg", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tState in Init.^rel\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2: State | s1.trans.State = s2.trans.State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pmsdD3wnE87su5rCZ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-9-12 10:02:40"}
{"_id": "YqTHeGWSSAGqdLcGd", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\nno Init  implies no State and  all i :Init|some e:Event | some e.(i.trans) & State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PqRY2iJt96Tfzudjv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 14:05:07"}
{"_id": "PBcvMd7pXksh5PwRj", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n   all Init.^adj implies some ( (Init.^adj).^adj & Init )\n  \n\t\n}", "derivationOf": "gaSQXaMLua3LKhpPa", "msg": "The \"all x\" construct is no longer supported. If you know the range of possible values of x, consider rewriting it as \"x == set_of_all_possible_values\".", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 10:54:29"}
{"_id": "cFwd2DcgTMbcixBBF", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \talways (State in Event.trans.State)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hAnLjPL78Et2ttMHw", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 20:01:47"}
{"_id": "ESzuvZQG9qBTnBqnX", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State,\n  \t\tsucc : set State\n}\nsig Init in State {}\nsig Event {}\n\npred x {\n\tall s1,s2:State | s1->s2 in succ iff some y:Event | s1->y->s2 in trans\n}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some i:Init | s in i.^succ\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9LTakr2A5Ep2Evgx3", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 16:04:48"}
{"_id": "u5ugAfpSzii2FddQu", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone (e.(s.trans))\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1, s2 : State | (s1 in Init) implies (s2 in (s1.^trans)) \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fCFyrYTpkL44BGX7t", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:19:17"}
{"_id": "CCLFLtSejh6FbdjdJ", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all e : Event | State->State in trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "J97hsPXvw8tyEuYmz", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:15:48"}
{"_id": "Ws4kqz9BHqKbXgDuM", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : (State-Init) |  some (Init.trans).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gYjM2rTJqmTZjpsg3", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 23:06:51"}
{"_id": "LojWD2wiZ5Md989vW", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall e : Event | State = Init.^(e.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "KJqk2ykE2BNghBnAM", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:27:36"}
{"_id": "KQ2KkkMdMpgaX9yxo", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State| lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s,ss: State | (s.trans).State = (ss.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: State | s in Event.(s.^trans)\n}", "derivationOf": "tfwSvWpeMyX7F3CCs", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:42:27"}
{"_id": "9XvJToxeeBugsZMu4", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-12-30 17:24:40"}
{"_id": "hNYHFDxKnSHAy7sF3", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some trans.s\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ny6NS8WfR2dZoRptY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-17 20:49:14"}
{"_id": "e5tP6fnDrDG28efYD", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n  \n  \n  \n \n  no ((State - Init)-(trans.~trans))\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ra7v7N8BGGEteb73W", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 21:24:58"}
{"_id": "thysvBGX3oqNgwNA4", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-19 14:44:58"}
{"_id": "k7YEyvHnfkiYoYZRw", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tlet s = State <: trans.State | s.~s in iden \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fsWYMiGwJXtNX38WR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:16:32"}
{"_id": "QzEFQsLEP94xccuRu", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | s1.trans = s2.trans \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mpYEsDBmA8QCH3ASC", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:40:58"}
{"_id": "vqmv9w6TeCWCbktcJ", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nadj = {x,y : State | some e : Event | x -> e -> y in trans}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2Pd6HuYrfXJXhazJn", "msg": "There are 5 possible tokens that can appear here:\nenum fun let open pred", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:47:36"}
{"_id": "5fYd3d7FbtCS39KRx", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 :State | Event->s2 in s1.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9a3D5cJSBGB3hK2Sk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:18:52"}
{"_id": "78742mLeir5p8BFQZ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  \tall s : Init.*adj | some s.*adj <: Init\n}", "derivationOf": "dAahbc2GPYMec2XxN", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 11:52:22"}
{"_id": "foFqoG26biF3JGNwa", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | all e: Event | Init.trans implies e->s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mFT2dgNWqpBfxtEnc", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:28:19"}
{"_id": "dcGdoX5cAD75fZAKB", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : s.trans | ~e.e in iden \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Npnq7XEL9JcuwNN2e", "msg": "Analysis cannot be performed since it requires higher-order quantification that could not be skolemized.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-4 17:19:18"}
{"_id": "5rXEQqeSBQ5MDTD48", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init = trans.State.Event\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  Init = trans.State.Event\n}", "derivationOf": "JdtqH7XN4L2cecmFP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 22:00:25"}
{"_id": "kAsx2PrKmtLiy8E6F", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some e : Event| x->e->State in trans implies y->e->State in trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "75ohiGiMN3HEp9qDk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:15:25"}
{"_id": "mkGLuxcDuAZBEf9ia", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | all e:Event |  e->s in s.trans\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PTqivmF6vcuu3Ad5H", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 18:51:56"}
{"_id": "Y9BXXoNjsw4JZ9QPG", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone Event.~trans\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {for all i : Initial | trans.Initial\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jAgspvWQuKiKag5wY", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 21:32:45"}
{"_id": "zMbcgtp9ZQQwDdGCX", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  State.trans.State = Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jSDLHvQW2RfKhxfvi", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:33:35"}
{"_id": "TAgXkCL4GLxYh9b6i", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/ \npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\nall s : State| ~(s.trans).(s.trans) in iden \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TnKRA6bJgfFWJPXgs", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-4 17:24:03"}
{"_id": "eiaFxB5pLyZ9j7yqp", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init <: trans | State in ^(s->(Event.(s.trans)))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "grhcYKpKgzrTtHXXA", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{none->none->none->none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:51:19"}
{"_id": "aG5KKgzMcFsrf2ahs", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some (s.^~trans):>Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "i8sjvFERPQYNixKah", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 15:55:06"}
{"_id": "iLJEJw7bJSWLdzian", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State| lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i: Init | Event.(i.trans) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bJjsBPYkJ69pFFAzc", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:27:44"}
{"_id": "w3qp7mXPbfdwC2rSe", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {for all i : Initial | trans.i\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yfDRZZ77Kefqu5Xf7", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 21:24:34"}
{"_id": "hJF6fAEHuFwmkaHaW", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | somne e : Event | x->e->y in trans implies y->e->y in trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "9WWsN5NLZ3JAtfs64", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-23 08:26:32"}
{"_id": "874fyAHaEpMcm9Gvo", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:23:01"}
{"_id": "LPNx7iK395MYFoQ35", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "syLrY6aAmvGgXpoHC", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 08:57:24"}
{"_id": "vr6rCeiyDj7LXKvhP", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone trans.(s->e)  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CQfDerzdZbuS2fNG6", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 13:58:06"}
{"_id": "ovHJcAHiAXwPoxXhT", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \talways (State in trans.(Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9eZNKC5rNGq9X9jGe", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 20:00:49"}
{"_id": "4gDpNWNbhpmDe9oFB", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | Init in (s.~trans).Event\n}", "derivationOf": "ueuPXewT6XcpW3dYM", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 01:19:19"}
{"_id": "feLQAiKdXsNvqiyGi", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | all s: State | Init.trans implies e->s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wY4h9aKFWmmxGZEpF", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:16:48"}
{"_id": "o294TfF4qxyXgCKwg", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:s1:s2:State | s->s1 in Trans and s->s2 in Trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "THBKsiALfdoynpNPv", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 18:54:04"}
{"_id": "uj8x82f6HpjQke8mA", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  lone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | some e : Event | lone (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s : State | (s.trans) = Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bNPpQFherJQJSbB3S", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:15:37"}
{"_id": "QAA23dygEJs3zdtkq", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { some s1, s2 : State | some e : Event | s1->e->s2 in trans } | State in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "tMrwmdxFKQohTXWRS", "msg": "This expression failed to be typechecked line 38, column 90, filename=/tmp/alloy_heredoc12896758120977626293.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-23 04:14:31"}
{"_id": "kNf7hQNb47vtRszoh", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State | Init in s.~(trans)\n}", "derivationOf": "TyBquE72m8CQN8kNY", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 17:44:58"}
{"_id": "SfnTb2nppwfjsypS3", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s1 : State |  (Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s:State | no ( Event->(s.trans)  - Event)\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WGf64ryHpyJKT8DBq", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:00:57"}
{"_id": "x5m3HB66oeoKMTX6L", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | one e:Event |  e->s in s.trans\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mkGLuxcDuAZBEf9ia", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 18:52:01"}
{"_id": "p2KMrWEavnvSt4D2D", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init in (*trans_bin).State\n}", "derivationOf": "Yiuo9HmJ5S3cdEYo9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-24 09:23:09"}
{"_id": "6NXhSMwrhm6vM98nf", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n trans.State.Event = State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n\n   all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n\nState in Event.(*(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  \n \n all x : State | x.trans in State.trans\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n\nEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n\nsome (Event.(State.trans))\n\n}\n\nrun {} for 3", "derivationOf": "umR5zwHB8mnFoggbb", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-6-10 10:29:44"}
{"_id": "Ktxy98ptFebK26kgn", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  some i:Init| i.^adj  implies (some Init in (i.^adj).^adj )\n  \n\t\n}", "derivationOf": "6cYqmSuAML2cNvB89", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 10:49:57"}
{"_id": "BQNHqMwfHoDZo43um", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2 : State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s : State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "oQgTTq2yH7ev2PER6", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-2 18:03:13"}
{"_id": "4TAxuidpoZWStrjQF", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | all e: Event | Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "quLhjGc8GGuSEj28P", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:23:28"}
{"_id": "LhySwXAuDXnw6iB5k", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init | Node in (*(x.trans)).Event\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6qbPEXqeAHxTppx9p", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:24:18"}
{"_id": "87K6tbXQ24bmf45J5", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some (State.trans).e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "N8jXZbHMj63BXm9Tk", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 21:17:43"}
{"_id": "A3BHPtCPe9pirSAKo", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | s.trans in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qveybDzJuSBR8dZnJ", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-1 12:08:50"}
{"_id": "QYozseytmRgYrgcNA", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t^Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ft6Fb5miKB5xdQwiD", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-11 00:29:26"}
{"_id": "sbdrSafv3cTMfQCxz", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tF2YMBRKGeovknTSW", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-9 13:53:16"}
{"_id": "LLzGGeWBSCboFK6KT", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State,\n  \t\tsucc : set State\n}\nsig Init in State {}\nsig Event {}\n\npred x {\n\tall s1,s2:State | s1->s2 in succ iff some y:Event | s1->y->s2 in trans\n}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tx implies all s:State | some i:Init | s in i.^succ\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ESzuvZQG9qBTnBqnX", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 16:05:28"}
{"_id": "teiMM7nrjoJDryyR8", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 { Init in State.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "uBN3Sjq3jQWjoH3iF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 22:15:17"}
{"_id": "kTkdnrWg2nmjftKC5", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:(State-Init) | s in Event.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jiMuw3GnGDP2N3wMd", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:52:21"}
{"_id": "evrR7RLQQh9hh9N5Q", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: Event.(State.trans) | Init in ^{x, y: State | some (x.trans).y}.s\n}", "derivationOf": "nt9JzeytQKDWPTcas", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 21:51:30"}
{"_id": "fWJovHxBTzZjsZ5tg", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e->State in State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "iWGj6LdYp8kqZhG4G", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:52:48"}
{"_id": "rb85AHqSRSzMMogds", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | (x.trans.State) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ibdZRZ8Ga5u6NBgPi", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:52:35"}
{"_id": "smzSy5z5rRcFBn6EL", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2 : State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s : State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5A6yru5NoY96Eh37A", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-2 18:03:01"}
{"_id": "pCqCRTpQrBxRfQETM", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | Init.^{x,y : State | some x.trans.y}\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pSyogMv5Jp29pPmG6", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 13:17:04"}
{"_id": "ujEgv72Gy2w84WXh6", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone trans.s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BdSddcgqWXAmvqDHq", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-25 20:30:09"}
{"_id": "SnWB67BurvJm3ssFy", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some s.^~trans :> Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FJDxAwFSDFaDgzkce", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 20:16:47"}
{"_id": "X5Z4msBnDnLNJPWz9", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tState in Init.^rel\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2: State | s1.trans.State = s2.trans.State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  \tall e: Event | some s: State | e in s.trans.State\n\n}\n\n\npred reachable[from, to: State] {\n   \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tto in from.^rel\n}\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all to: State | from[Init, to] => from[to, Init]\n\t\n}", "derivationOf": "cjY3oCGMs5kFBKNA8", "msg": "The name \"from\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-9-12 10:04:33"}
{"_id": "ZStbv6gvCsnMGYs5v", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, s1:State, e:Event | lone s.trans.Event\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dtMk5M8sAmcND56Lj", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:15:43"}
{"_id": "TNHtdGZL3ixZm2kM9", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BbKwjkMeRBGHFBNQt", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-9-12 09:48:40"}
{"_id": "G7cZxgGnQvgxCzehK", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | Init.trans in trans implies trans.e->s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XeHof4JHfg37ZvPKC", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:26:07"}
{"_id": "w4Nhs3A8yCnAoqbL2", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome ~trans.(Event.(State.trans))\n}", "derivationOf": "BsxSur9s7W7Z8twhH", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 14:23:25"}
{"_id": "QBKQipPjM4tBjXW9M", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tsome e:Event| some s:State | e in s->trans->State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bAAE2MKbfSjwbsaDw", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/State->this/State->this/Event->this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:48:26"}
{"_id": "YrcDLoqwDSdqcjFWY", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | Init.Event.s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e<:State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qya6ZGRfGDyhENbED", "msg": "This cannot be a legal relational join where\nleft hand side is this/Init (type = {this/State})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 20:09:50"}
{"_id": "nfEyM2WnEDByAoGTt", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone trans.Event\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "j9mi5yF5hjo6Kuje7", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 11:10:16"}
{"_id": "jRMRmjpuXZQMDabJk", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\ttrans in Init.*trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pP59DvAxn3fsycpMX", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 21:45:39"}
{"_id": "gbmbT6dB89BAGDf9Y", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone s.trans.~e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "a8Day9amkffoBS7nc", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:48:02"}
{"_id": "29xWpoAJrmjteD8iM", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | Init.trans in trans implies trans.e->s in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "97PXAcdgfzEbeF7zg", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:27:32"}
{"_id": "Jwuho7hjkmeHMLeQb", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e.(State.trans)\n  \n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall r : (Init.^function) | Init in r.^function\n}", "derivationOf": "inBGWH8nFaCKm4bzv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:20:19"}
{"_id": "wpgKdEZnbYzRqd7fv", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some x.trans & y.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xgay7uGjRekE9mxHj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-18 22:12:29"}
{"_id": "Fx6nS7Yie27xTsdJ3", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some x->Event->State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MsdH2RKL6FKubYhGp", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:44:00"}
{"_id": "ZE8fzb9ahFgMNd49g", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WSQNzmg5gomBLuZnh", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:23:15"}
{"_id": "XCJyzSsMckebLW7t7", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "z2czByYhYDs5eyvkb", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 23:36:53"}
{"_id": "L66iukRzBzKuofRJL", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone s.(e.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ST2js2tfmCFLfF6h8", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-30 18:42:26"}
{"_id": "7T8uqzJYKhfHpLuR5", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : Event | State in y.*(x.trans)\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RgbdZLYfyLTZMC7Xv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:25:51"}
{"_id": "PXdQyjtvPeoPDEiPX", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Wq7oCYTfGzK7739pN", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-16 17:27:33"}
{"_id": "dzNxBNpmuzAzw8xJs", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  \tEvent.trans.trans.Event\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "eGG7YXZYKWYYzNtHw", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-14 00:55:38"}
{"_id": "P8wmyjik4SA2Wdk5S", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n  all s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n let trans2 = {s1, s2 : State | some s1.trans.s2} |    Init.^trans2 = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\nlet trans2 = {s1, s2 : State | some s1.trans.s2} |    Init in Init.^trans2 + Init\n}", "derivationOf": "389EGiLStYKfPxnxH", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-6-10 09:21:37"}
{"_id": "Gz724YNzhC5iw467H", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | some e : Event | s1->e->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.^tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MSFTCohMpBrgDxBYw", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-8 15:58:52"}
{"_id": "QqkkC8g7qaTcjxEem", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    State.^trans_bin = State\n}", "derivationOf": "j66T4bWvwyHnCqnNX", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:51:17"}
{"_id": "ajmAw2fkAJz7q5yjp", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y : State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "m7L4Le2u2WrsB35s7", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 13:17:19"}
{"_id": "3t86GerjQ3BaRGMsh", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | State.(x.trans) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Sqw7pYKh6HH8YMPWb", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:49:02"}
{"_id": "QerayaWG5Wh5Pf6gc", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EHnuNrowyshdeXS4A", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-15 16:10:06"}
{"_id": "K5pJDMmXNPPDpxkks", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone s:State | s in Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i:Init, s:State, e:Event | i->e->s in trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ze9Y6NqNoSbWNyZnq", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 00:28:54"}
{"_id": "j9CxuCze8JCaJKHTk", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\nfun onlyStates : set (State->State) {\n\t{ s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \t(State = Init) or\n\t(all s : State | Init in s.^onlyStates)\n}", "derivationOf": "jTckgtFwRHPatEudM", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 01:12:16"}
{"_id": "PApSXDYC8cB9EoBAz", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\nno Init  implies no State and  all i :Init|(State-Init)in  (State-Init).~(i.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8GfzAQAgMkSLbfnuv", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 14:07:11"}
{"_id": "YKcDCeoAztifFGkNX", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State, e : Event | some x->e implies some y->e\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2v7LDZ55DN76XK243", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:01:06"}
{"_id": "bJWwSPbHd9drijjw4", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e<:State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "q2Fi8uWEL8rK7QrzG", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-8 20:03:37"}
{"_id": "QmqCgE9BehhY3iTdR", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QerayaWG5Wh5Pf6gc", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-15 16:10:10"}
{"_id": "6GXe33iq5yMdsPJ8q", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pYrTKDXRPTkhkDfs8", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/State->this/Event}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:10:26"}
{"_id": "CXoEXhJK2yAoXpYYu", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t all s : State | Event in s<:trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pxoQJYhPLnfYaDx7j", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-20 08:26:19"}
{"_id": "pJhYnqomuDcHsYvqo", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XYYeELLyMZRbYQgAn", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-12-30 17:26:07"}
{"_id": "PjaEuLhq2BYirYyf5", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in (Event<:trans)\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "YwaXE8pewny24CK9J", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-23 08:22:50"}
{"_id": "JwJbbRrXnQ8NRTF7h", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | one e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iJ5WQ6i374dkWFuTm", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-12 19:43:47"}
{"_id": "thu5cgkM7MYhzQugn", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  let t = {x,y : State | some z : Event | x->z->y in trans} | {all s : State | Init in s.~t}\n}", "derivationOf": "DJrvJbYaiRNjTpFQZ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:24:39"}
{"_id": "fLhjCzJntzbw69a2N", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | State in x->Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "JcSM6n6TKz7cfJzAB", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-23 08:19:19"}
{"_id": "pxoQJYhPLnfYaDx7j", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t all s : State | Event in s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BwLRy2umNiLChYra7", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-20 08:26:09"}
{"_id": "ECiLJ8p4f9R8vPKYD", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.tans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hNYHFDxKnSHAy7sF3", "msg": "The name \"tans\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 20:51:22"}
{"_id": "yfDRZZ77Kefqu5Xf7", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { some State -> lone Event\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hWwdmmYuzoGwq7Grf", "msg": "Multiplicity expression not allowed here.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 21:22:42"}
{"_id": "gEgpSceChQefjtsao", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  lone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qdGKhSek2HNjhuN4t", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 19:07:12"}
{"_id": "eyMWpGnirT9tj454H", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.^(trans.State)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "XCSc8Tu5XdepdvWxk", "msg": "^ (this/State <: trans) . this/State is redundant since its domain and range are disjoint: {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 03:46:24"}
{"_id": "3EhSiTsJCzYsKgEgu", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet adj = { s1, s2 : State | some e : Event | s1->e->s2 in trans} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some (trans.State).e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "uB3cNX9BJC5LHmKSK", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-3 11:18:07"}
{"_id": "cCndEh8J9eBfEBPxH", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\talways State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hJHp7fgXANo5RoZsq", "msg": "This expression failed to be typechecked line 17, column 2, filename=/tmp/alloy_heredoc17881741288879072971.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-19 15:23:30"}
{"_id": "FsNN6fhG5cKFkX57D", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1:State | Init in (s1.trans).State\n}", "derivationOf": "afwwZwpS5o3StiYbe", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:13:53"}
{"_id": "kvdXYdn5ifyCYg97K", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.~(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xnGDtL97tEcc6PfoK", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 03:41:48"}
{"_id": "qt8S4wLiBMPBfs5to", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event| lone e.State.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yGwGJYqnrYodh7W5r", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is this/State (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:47:44"}
{"_id": "oLxLPtgKtxm48XLQY", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tState in (State<:trans).Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BKi8JwncT7RyH5Fxm", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:13:32"}
{"_id": "y7Zic98iTC6SvSvor", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | Event.(s1.trans) = Event.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XNjK5vcrb6iLAMBAH", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:42:08"}
{"_id": "2FFGDYKaxfaWrbijQ", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall s:State | some s.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QBKQipPjM4tBjXW9M", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:49:34"}
{"_id": "46bXj8Z4Tjcizr8Qj", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "epiRihKFpGR3WBo4K", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:50:17"}
{"_id": "ukE9qELMrYz9pt5Hy", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Tqzty46EbMZLmJgKg", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 12:17:54"}
{"_id": "6cAhMwWFKrwDYdWdT", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet t = { all s1,s2 : State | some e : Event | s1->e->s2  in trans } |\n  \tState in Init.(^t})\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vfSNDbFQ4Yv2T8Can", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 11:01:40"}
{"_id": "Dg5dcAJCjxYubJ4nk", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | all e->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6nnegJCx94GPKJo5j", "msg": "The \"all x\" construct is no longer supported. If you know the range of possible values of x, consider rewriting it as \"x == set_of_all_possible_values\".", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:30:59"}
{"_id": "J4d5vN5FoWiKkFxYC", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init | State in x.trans.Event\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "J4ywXfdFjudtfRDZS", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 22:11:27"}
{"_id": "m8xbPTMb7QQsfRb4Z", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some Init.(s<:trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WujjAnzfyioXCtDx5", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:20:22"}
{"_id": "RDDHE3GzGwwXuo7Ln", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tState.trans in Event -> lone State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y: State | some (x.trans).y} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s,t:State | s.trans.State = t.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\n\npred inv6 {\n\tall e:Event | some (State.trans.State & e)\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet adj = {x,y: State | some (x.trans).y} | all s:Init.^adj | Init in s.^adj and lone Init\n}", "derivationOf": "prccZRkfvy2ZDAZzQ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:30:36"}
{"_id": "aGzh4w7HNKbsYapXE", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i:Init | s in i.trans.s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "eCCmbB5dGbghvDYmx", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:37:45"}
{"_id": "tYBr3Fg4RcqLqqmfp", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in s.^{x,y: State | some y.trans.x}\n}", "derivationOf": "TrEHqdojbZHJRTuwv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:40:37"}
{"_id": "JuJn6m7wDQKwXtdFF", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: State.trans.Event | s in s.^{y,x: State | some x.trans.y}\n}", "derivationOf": "erQzc7Lnaqgrp5vPw", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:39:24"}
{"_id": "47dHZtJFbeYfGgzo6", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | one trans in e->s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cvu2YGoTTZftjTPKs", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:32:03"}
{"_id": "uSbThpAdoXm3ctQZX", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone s <: trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vtfthCqnypDoapagF", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 15:12:46"}
{"_id": "rErXTsBgwwEtQTcuM", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  some i:Init | (State) in i.^adj\n\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mNBYnWxY4C9vRu6EL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:08:23"}
{"_id": "J9vfWCM57wZyE8RD8", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { one (State.trans).State\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GP6i7ootq2HytbQWM", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-9 17:35:37"}
{"_id": "NBwBk8HFczHFGDo2F", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | one Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ctjtkp2HXC9LvbXwG", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-12 20:52:17"}
{"_id": "iJmPgAb8qLwhB9Eei", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | some (i <: trans).s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tinMdG2o36bYP7G4v", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:12:43"}
{"_id": "9z7LfYQR9jLTWLnpR", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HcHfAHxfth6QWBFDf", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-13 00:01:42"}
{"_id": "EZinDW5qskSNTAH55", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  let trans_bin = {s1, s2 : State | some s1.trans.s2} | Init in ~(*trans_bin).State\n}", "derivationOf": "thu5cgkM7MYhzQugn", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:25:12"}
{"_id": "5PvAi9GJRhRxXCdK9", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pQWSMx9BKYeFCwsMD", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-8 21:29:08"}
{"_id": "7sQqrJ4NJ2m2c6tDc", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init in (^trans_bin).State\n}", "derivationOf": "p2KMrWEavnvSt4D2D", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-24 09:23:43"}
{"_id": "eoXqNDJSnaHk4yxDA", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : Event | State in y.(x.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iYBbdsRwqzkxkApAH", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:02:54"}
{"_id": "HR3BS47qkjWPf2gRE", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s1,s2:State | all e:Event | lone s1->e->s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mGpPSxoyL3cwRu7wJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:14:43"}
{"_id": "Z7sbwK36aN7cQusGc", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State, e : Event | x->e->State in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fcS536EScYk8D6vML", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:42:53"}
{"_id": "TyBquE72m8CQN8kNY", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "xh2FJigqSqtWN8jMT", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 17:43:18"}
{"_id": "Xn5pvgPPhPr3QufHH", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event| lone e.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qt8S4wLiBMPBfs5to", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 22:47:57"}
{"_id": "8LoF4Rany5svq7sks", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | iden & (Event->State) in (s.trans).~(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "YHsAvqXQC2t6yeDvr", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/Event->this/State}\nRight type = {this/Event->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:21:23"}
{"_id": "6jhHrnn2hNtWiwfXp", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 09:58:00"}
{"_id": "B9G4zDJrrXdJD7Aex", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | s in Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iRjNwrAZanRqCMqAv", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-12-30 20:20:24"}
{"_id": "QQmeDTbQAFiYhYaHx", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tInit in Init.*adj \n}", "derivationOf": "fux6JYPGLq5mm6KBb", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:34:58"}
{"_id": "AMa3Qk37pSMi9EaXv", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {all x,y : State, some z : Event | x->z->y in trans} |\n\tall s : State | some Init.(s.^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "Rj4tqPvdHLFzecSef", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:50:20"}
{"_id": "dAahbc2GPYMec2XxN", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tInit in Init.*adj \n}", "derivationOf": "mHkuJt7AA6yYMQ5p3", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 11:50:59"}
{"_id": "5KTbGd2aX2B78ZJpi", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BxCZPno6JNEBKgzgE", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:57:48"}
{"_id": "9TsPmmRpzTFnGuHQD", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init | State in ^(s->Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "fpp89MiRmZLHHK44y", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 15:09:08"}
{"_id": "ZMEmLuvZkKjcKGkvS", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  State in Event.(*(Init.trans)) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "FJRLZz3u4FJQ5tERF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:26:25"}
{"_id": "Xa7WMotkEzR5bbkun", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FEgQ296ekcqrF5PZC", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 22:41:11"}
{"_id": "4RmofT5FBRkBDFDAW", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JXYaRG4arypHoi8nT", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 03:28:48"}
{"_id": "389EGiLStYKfPxnxH", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\nall e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n let trans2 = {s1, s2 : State | some s1.trans.s2} |    Init.^trans2 = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\nlet trans2 = {s1, s2 : State | some s1.trans.s2} |    Init in Init.^trans2 + Init\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-6-10 09:19:09"}
{"_id": "RC8nucSgLvBN8Dhie", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HiLtRvvyNWBbCrinN", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:26:54"}
{"_id": "NbdA4LJSKXoS9PMuH", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n trans.State.Event = State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n\n   all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n\nState in Event.(*(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  \n \n all x : State | x.trans in State.trans\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n\nEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n\nsome (Event.(State.trans))\n\n}\n\nrun {} for 3", "derivationOf": "xKevaRzpT3QLY54cs", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": [{"parent": "State", "type": "this/Init:State"}]}, "nodePositions": {"State0": {"x": 398.88541666666663, "y": 199}, "State1": {"x": 797.7708333333334, "y": 199}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2020-6-10 10:31:05"}
{"_id": "HzvYQequW96PPmb2Z", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  all x, y : Init | x = y and some x\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "n44np5Q22WeCD7YJE", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 21:43:08"}
{"_id": "hRuGXXv7Y7hHyQfmH", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s,s1:State,e:Event|some s2,s3:State | s->e->s2 in trans implies s1->e->s2 in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "a7rPte2P3M9D5ktyM", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 21:11:02"}
{"_id": "aBA79cdubsuRdkSKg", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | all s: State | Init.trans implies s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gp8butzrniyCQjW4A", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:15:14"}
{"_id": "mcSTDobzmh8mF5Qwg", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | State.trans = x.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "YuHiJmMgmB9jPqHGT", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:17:17"}
{"_id": "uv3ikC2ZfPtrii9kb", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : Init.^adj | Init in s.^adj \n}", "derivationOf": "7Ybo9s8KYRmezQJYQ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 11:30:59"}
{"_id": "2Pd6HuYrfXJXhazJn", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "M2WSNesQg4LyPvD2c", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 09:21:50"}
{"_id": "Emwpn5CetMnv4f5Wy", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.~trans.Event\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Nnysx7p2HmKzL2YFx", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 11:18:07"}
{"_id": "g4ErkM46pbXPagmhb", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  all s : State | #s = 1\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CCMu2hSd4omqnrDE7", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 01:39:58"}
{"_id": "MnxDQz85F9rFxo6Kn", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n\tall   s1,s2 :State |some e:Event |  (s1->e->s2) in trans implies ( Init in s2.^adj  ) \n}", "derivationOf": "CLtG4gzNj3icYXbQy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:41:17"}
{"_id": "ajTKvaeaQybDae8eA", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome S.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ioWkqnmnEnZjcoDm5", "msg": "The name \"S\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 20:40:05"}
{"_id": "wHRXbByCAxkbtotBH", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pnD6Mjc684rcSNCyo", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:51:17"}
{"_id": "c3QMKKTsMzX8w2Qxf", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State | some e : Event | (e->Init) in (^(s.trans))\n}", "derivationOf": "Gbn75jtDWnfzY6yaT", "msg": "^ s . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 17:49:04"}
{"_id": "fkigQggovPhkuZvhj", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 21:29:16"}
{"_id": "MsuT6A4Si2YBP7HJW", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event<:(x.trans) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fr7uo7tMEXu7ruLaW", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:47:50"}
{"_id": "yARNH7ZvXdDEaZjTi", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, disj e, e1 : Event | s->e in trans.State and s->e1 in trans.State => e = e1\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4FDsE2atyeEY52y2e", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 02:53:04"}
{"_id": "cdkYhCxgvNuBc8h3L", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tESaeAgvuweaN3T7L", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 21:18:01"}
{"_id": "8SuaraJacu8FmrzXJ", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-13 12:06:53"}
{"_id": "vhySDtXscyznAJNCC", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s1,s2:State, all e:Event | lone s1->e->s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "zwT4pTafvhxNHyzRc", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 21:00:37"}
{"_id": "ECWQDjWANaXyWWfHc", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e, e1 : Event | s->e in State.trans and s->e1 in State.trans => e = e1\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "membjtCyCcNXpaoFd", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State->this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 02:50:20"}
{"_id": "4rsgCxnPnqRPX8mH5", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s:State, e:Event | s.trans lone ->  trans.e\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ACZzFBiqeZDgBdP9t", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-15 16:30:31"}
{"_id": "TDMAwQRSqWMveScQp", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\nall s: state | set f : Event | lone n: State | f->n in s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aDDTyHxvBSauDAMfA", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:16:53"}
{"_id": "CPPNRKtxSdikEoDLY", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init | some e:Event | State in e.(i.*tras)\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NEQWJXA7G2HGYraLR", "msg": "The name \"tras\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 17:31:00"}
{"_id": "4fvquhL3grs6N9pTJ", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, e:Events | some e.(s.trans)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "PCMntnEepLxx5Ddmx", "msg": "The name \"Events\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 22:08:59"}
{"_id": "mNSqzvEnggFxY593Y", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\nfun onlyStates : set State->State {\n\t{ aux : Event.(Init.trans) | Init -> aux }\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ywRD2dpMXPXxGzAGn", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 01:03:35"}
{"_id": "QkA336hreXuFck3Tq", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.*adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : Init.^adj | Init in s.^adj \n}", "derivationOf": "Wy2N8PKvviMpKkyyK", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:13:37"}
{"_id": "taz8dCDArrxJ7gS46", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 12:14:31"}
{"_id": "kd2PLh6XtBeuHaHpS", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n \t\t\t\t\t\t\n\nall i:Init | some s:State | (State-Init) in s.(~(i.trans).^(i.trans))\n}\n \n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n  \n  \n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "KgDqHE7jcmDeD99yr", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 13:12:58"}
{"_id": "wCvdjsSMCnDNZJYhD", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EYzc7jamfafXBaPXc", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 14:12:12"}
{"_id": "6T5fuDrpPxmohPTn9", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pkfitNjhQCoWDxBbR", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 09:33:44"}
{"_id": "uzutxuu6BYDbXRPws", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event| some s.State | s in trans.e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9AYBiiPStJ9xcp822", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:46:30"}
{"_id": "25aYiS9MBG72qzTtk", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.(^{ s, ns : State | s->Event->ns in trans }) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | s.(trans.State) = State.(trans.State)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.(trans.State) = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t((State - Init) -> State) in ^{ s, ns : State | s->Event->ns in trans }\n}", "derivationOf": "siZnau666TMBamdQs", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:31:38"}
{"_id": "ikSpMSXdLuqPt8FeH", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6e5HfPSNt4doSohQP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 03:32:06"}
{"_id": "fXMqC6dzFbLRkTmkq", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s,p:State , e:Event | s.trans in e & p.trans in e implies s=p\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { State.^Init\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8wqvYD7FomXhStRsp", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-15 16:57:19"}
{"_id": "oxiG9oPBpFN4aFXY4", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | s in trans.State implies s in State.^trans\n}", "derivationOf": "Cf4Rt8x2yQftJwuni", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:55:05"}
{"_id": "BoCfEQyDs5nGgHJH3", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tiden in State.trans.~trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JH6eYW4XHDbLxrhKs", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 02:28:37"}
{"_id": "cK6BjMFuiMBia5eXz", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s.^s.trans = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wgqbfyqt5SYMq5Lwi", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 12:11:17"}
{"_id": "pvnzXGSGnb5hyu2vX", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | Event.s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wackytJsX9r6ojfdT", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:21:14"}
{"_id": "bW2YENCEXtDx9F9BG", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qwwyPBmkHaihh6z44", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:31:15"}
{"_id": "6uxzpp2j3zD8bwc7z", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: Event.(State.trans) | s in ^{x, y: State | some (x.trans).y}.s\n}", "derivationOf": "PHwPeBWMKkec75mvJ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 21:53:59"}
{"_id": "CJ9jGwbAceSzAaHp5", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\nall s: State | all e : Event | lone n: State | e->n in s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BhLcJLzZDP5nqaX8t", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-7 21:18:21"}
{"_id": "jitDoQcKj2FGg8KF6", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nall e:Event|some s:State | some trans.(e->s)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pdDnESWPuHJbDYzB9", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 14:47:47"}
{"_id": "f6r2BQmQn8egEKo8T", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    all i : Init, s : State | s in i.(^{s1, s2 : State | some e : Event | s1->e->s2 in trans})\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "5ze9nmhKFoEheSC3n", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:37:53"}
{"_id": "NjsjAiSt7EAywCLSu", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n   some (Init.^adj) implies some ( (Init.^adj).^adj & Init )\n  \n\t\n}", "derivationOf": "ZwdzKb2XHZYXQbBiW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 16:34:57"}
{"_id": "QajmoJDWrdT4bsvrv", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | s.trans = State.trasn\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "The name \"trasn\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-24 11:04:41"}
{"_id": "LMn35DPrPmdmL29Gk", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XhiAk9c8ob8epjFJr", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 17:05:25"}
{"_id": "xiMcPpiEgNSCNP7Ee", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  some *(Event.(Init.trans)) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "WG7cCrA67EueXMoga", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 14:27:24"}
{"_id": "u3QNgMo3LQPfnCWx5", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t all s : State | Event in s.(trasn.Event)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RQs86WA2SzMuY7uE7", "msg": "The name \"trasn\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-20 08:27:15"}
{"_id": "iQ49iBneyE8jFMnZi", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in ^{x,y: State | some x.trans.y}.s\n}", "derivationOf": "zyue4xgf7LNmBn4mY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:43:06"}
{"_id": "NsMCfLB8kmYGZobit", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tState in Init <: ^(trans.Event)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "w9Tsd4HugF2wddy4q", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-9-12 09:57:55"}
{"_id": "EQRw8WEtfA2mwMCwn", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in Event<:(State.trans)\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "wX3sL9ckwpQn56ZyN", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-23 08:21:31"}
{"_id": "rCFhw8XqrcXsF3Ryf", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone (x.trans).y\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pFXfm5W4z2FhYpZtx", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 21:52:10"}
{"_id": "P6WSEuANQBa8kmue2", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | some (s.~(Init.^trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s : State | Event = s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "P4dyHR72CyaKgX3of", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:11:50"}
{"_id": "PHwPeBWMKkec75mvJ", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: Event.(State.trans) | s in ^{x, y: State | some (x.trans).y}.s\n}", "derivationOf": "xCfF5sug5a9PZG9Yi", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": []}, "nodePositions": {"State0": {"x": 598.9921875, "y": 265.3333333333333}, "State1": {"x": 598.9921875, "y": 132.66666666666666}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2021-1-12 21:52:04"}
{"_id": "osausyiBnixvvYRGt", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | e.(s.trans) in State.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jZNZQt8F6GhXMPxym", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:18:57"}
{"_id": "wgqbfyqt5SYMq5Lwi", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s.^trans = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "McCRBJdWBv6bo2fHG", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 12:11:00"}
{"_id": "qTpDmrtgFPN3kkssi", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rZ9Cpa8ByndHCid6y", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 15:47:08"}
{"_id": "QvWWsJokQMwwZodFa", "cmd_i": 0, "code": "\nsig Node {\n\tadj : set Node\n}\n\n/*\nThe graph is undirected, ie, edges are symmetric.\nhttp:\n*/\npred undirected {\n    no adj - ~adj\n\t\n}\n\n/*\nThe graph is oriented, ie, contains no symmetric edges.\nhttp:\n*/\npred oriented {\n    no adj & ~adj\n\t\n}\n\n/*\nThe graph is acyclic, ie, contains no directed cycles.\nhttp:\n*/\npred acyclic {\n\tall v : Node | no v.(^adj) & v\n}\n\n/*\nThe graph is complete, ie, every node is connected to every other node.\nhttp:\n*/\npred complete {\n\tadj = Node -> Node\n    \n}\n\n/*\nThe graph contains no loops, ie, nodes have no transitions to themselves.\nhttp:\n*/\npred noLoops {\n\tall v : Node | not v->v in adj\n  \t\n}\n\n/*\nThe graph is weakly connected, ie, it is possible to reach every node from every node ignoring edge direction.\nhttp:\n*/\npred weaklyConnected {\n\tall v : Node | Node in v.*(adj + ~adj)\n}\n\n/*\nThe graph is strongly connected, ie, it is possible to reach every node from every node considering edge direction.\nhttp:\n*/\npred stonglyConnected {\n\tall v : Node | Node in v.*adj\n}\n\n/*\nThe graph is transitive, ie, if two nodes are connected through a third node, they also are connected directly.\nhttp:\n*/\npred transitive {\n  \tall v1,v2,v3 : Node | v1->v2 in adj and v2->v3 in adj implies v1->v3 in adj\n}", "derivationOf": "ZwrQpwJDxhoRJYNsv", "msg": "The name \"State\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:45:21"}
{"_id": "rcfr9eSt72w5utfd3", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Xphajzv4S4mkQEkM7", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:22:39"}
{"_id": "3LuqCbfXh9XKiTPBp", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, s1:State,e:Event, t:trans | s->e in t \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nHYYsd5nJqmmnZJJv", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 12:18:43"}
{"_id": "up4HdAn7KA2vZys8d", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e : Event | lone e.(s.trans) \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "J9vfWCM57wZyE8RD8", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-9 17:44:44"}
{"_id": "uZZdmy3hJRM9bhCNc", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | Init in ^(~s<:trans)\n}", "derivationOf": "ADCKjFY6uF4TK9wXP", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:28:38"}
{"_id": "aZSAHJXjv6cKSskRo", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e : Event | lone e.(s.trans) \n\n}\n\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { all s: State | some i: Init | s in i.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r : State | (s.trans).State = (r.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { all e : Event | some s : State | e in (s.trans).State\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "De886eNr957TvF4uH", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-9 18:31:18"}
{"_id": "iJ5WQ6i374dkWFuTm", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | one s.(e.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ppotfPBk9iuQMgAdL", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-12 19:42:45"}
{"_id": "StCSjPhZaP8k9PjmP", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in ^{x,y: State | some x.trans.y}.s\n}", "derivationOf": "vAy4G2fKvksp3ALgu", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:43:36"}
{"_id": "tvvqG7nYYKKKnEEHZ", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 09:36:07"}
{"_id": "M8RxHsB7kw4YJ6JxM", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone s <: trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "uSbThpAdoXm3ctQZX", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 15:46:08"}
{"_id": "B3cJ4vc5cfwvddBZ2", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  all s:State | some s.trans\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "q9BdsfLnggQp67JLG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 19:12:26"}
{"_id": "7wZLxTtWr7x6GCKvN", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all s : State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "w3gJJYNJP3zM2YnDD", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:12:30"}
{"_id": "pcwxy7vgBYn65nLDt", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some e:Event | s in e.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aHezTMbRanjcknPMP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-13 00:07:00"}
{"_id": "HcHfAHxfth6QWBFDf", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans) and Event in State.~(Init.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YmW4NXB9MSyeRjsjw", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 23:59:00"}
{"_id": "cxa3nv7B6eDeE4bTf", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n\tlet adj = ( all x,y:State | some e:Event | x->e->y in trans )\n}\n\n/*\nAll the states have the same events available.\n*/ \npred inv5 {\n\tall disj s1,s2 :State |  no ((s1.trans).State) -((s2.trans).State) and no ((s2.trans).State) - ((s1.trans).State)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "SomRwtTbp6TNrLZKC", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:01:40"}
{"_id": "QBz636MDCWS5Akxud", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tone Init\n}\n\nfun f[t : trans] : State->State {\n\t{s1->s2 : State->State | s1 in trans.univ and s2 in univ.trans}\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QJzjZEhDPzwB3tmYj", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-11 00:47:02"}
{"_id": "HrcrQ2cq2WByf2ejd", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/ \npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : s.trans | ~e.e in iden \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dcGdoX5cAD75fZAKB", "msg": "Analysis cannot be performed since it requires higher-order quantification that could not be skolemized.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-4 17:21:02"}
{"_id": "DbGMCrmHREz55LZGS", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | one Intit\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : States \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "m7zjN2d6qLab7pYXu", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-12 20:52:00"}
{"_id": "Z6TK8Sn8uHDiJLrpX", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | s.trans in State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Wp5iWevcxovxu5XNB", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-19 15:42:44"}
{"_id": "RFME6HzriweGujXAC", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : State | State in y.^(x.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZWii2Tr2mKR28YNHs", "msg": "^ x . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:10:57"}
{"_id": "rcze4EX8R2uRgQqkZ", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State , e:Event| lone e->State & s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, s1:State | s.trans.State = s1.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LjS53b9SSaf2aCa35", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-8 21:39:33"}
{"_id": "6WwKsu3nEWf9squ2Q", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2: State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s: State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\nfun getEventsOfState[s1: State] : Event {\n  \t{ e: Event | some s2: State | s1->e->s2 in trans }\n}\n\npred inv5 {\n\tall s1, s2: State | getEventsOfState[s1] = getEventsOfState[s2]\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e: Event | some s: State | e in getEventsOfState[s]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\n\npred isReachableFromState[s: State, i: State] {\n  \ts in i.^onlyStates\n}\n\npred inv7 {\n\tall s : State | some i: Init | s.isReachableFromState[i] implies i.isReachableFromState[s]\n}", "derivationOf": "4uQiB32jNfQ27NTbw", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-2 18:17:58"}
{"_id": "5vhLewytMAiJ3PruA", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:s1:s2:State | s->s1 in trans and s->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "o294TfF4qxyXgCKwg", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 18:54:18"}
{"_id": "aiwqTR2LkybPzpP7e", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QQBfpv6kWdWrHekoa", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:31:07"}
{"_id": "s49NiTN34yL7nigTN", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  lone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | some e : Event | lone (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  trans:>State = Event<:trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dAT2awTxH8aqJ3GF7", "msg": "<: is irrelevant because the result is always empty.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:21:46"}
{"_id": "Yo7pxpsFHc7gkSLxh", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\n\npred inv4 {\n    all  i:Init  |  no (State - i.*(trans) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "hcpCZyJhaxqNc499b", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 19:10:40"}
{"_id": "idvX5gg7ppM73jXnD", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | one e:Event {  e->s in s.trans }\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "x5m3HB66oeoKMTX6L", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 18:52:19"}
{"_id": "FWpc9E98bBDv8Xa67", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone s:State | s in Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1, s2:State, e:Event | s1->e->s1 in trans implies ~(s1->e->s1)\n}", "derivationOf": "ECNt7XFoXYz82Zbbg", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 00:33:25"}
{"_id": "9LdF6aCQiMRTGQwnR", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some e : Event | x->e->State in trans implies y->e->State in trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "tpizCGcfW5zCGpCgR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:15:39"}
{"_id": "JNmfS5SDRcodqRyEi", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t lone State->Event in s.(State.~trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XBgW4gWbhqkp8mq9Y", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 02:53:42"}
{"_id": "dRRpREFF8mXrSJ2k5", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t all s:State | State.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "g59znePYjELeGcp2t", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:35:58"}
{"_id": "JJv4arqfcNkAmdpc8", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | lone State.trans.e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "wdCtEMGTB9kY456TM", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 21:44:32"}
{"_id": "o3ceypBXNT94SPLPz", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wfveNbfx9vCGLD5ME", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:48:42"}
{"_id": "GQNwmuXudcoZJrs3f", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jRyPaT7JrwYeN85YL", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:09:35"}
{"_id": "XBeCwRqDHFGT4TsQj", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "X7vg5ZQfLZEDez2KE", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:05:45"}
{"_id": "vQck9dHSRqzCD9WpY", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n (State) in Init.^adj\n\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rErXTsBgwwEtQTcuM", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 09:10:17"}
{"_id": "wPm2ANqt44mBR6jAR", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "taz8dCDArrxJ7gS46", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 12:14:40"}
{"_id": "HiLtRvvyNWBbCrinN", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gpFpk9NSacLo85EM6", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:26:24"}
{"_id": "WjQ9RotA2u7awYy4d", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State | Init in ^(s.trans)\n}", "derivationOf": "EnAtniGaKmK8oGH7c", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 17:46:20"}
{"_id": "ub9ZtZRjS48eP8yaw", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "BQg5K83RZkKWk6mnb", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:35:39"}
{"_id": "cXzPJQNGduxpaeYoy", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x->Event->State in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Z7sbwK36aN7cQusGc", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:43:02"}
{"_id": "izADnr3Qin2Knzzt2", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init | s in (i.trans).State \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TgWRY4C2oLuSMufWg", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 22:50:30"}
{"_id": "4axg4fMSFThdqGgrg", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | State.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rzvDjtw6xaFEZyY8c", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 03:26:07"}
{"_id": "FbLFnB9dTtPpenfxP", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init | s in State->(i.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gJJPT7PWqy8Mj76ZY", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:51:02"}
{"_id": "Ni3FMkW8unC6kwE3v", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s1,s2 :State |  no ((s1.trans).State) -((s2.trans).State) and no ((s2.trans).State) - ((s1.trans).State)\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ySiQeieAA7kz8TrDM", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 14:43:32"}
{"_id": "BxMBywGm8kPsCeNhN", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8SuaraJacu8FmrzXJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-13 12:07:04"}
{"_id": "58DPtNbPepv3EGKnz", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init |  some (i.^(s.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "oCXZSEqNnn6XwwLwX", "msg": "^ s . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 22:54:08"}
{"_id": "fWcBf2AZxgAbaLhFD", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone s.trans\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gedphdX5bD4ZQjY3y", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:17:22"}
{"_id": "tpmWTnMQr5RdFqzYj", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  ~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "H5Hu9xEoY4aWzkaEX", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:23:25"}
{"_id": "NF6xM7Dbh447soneK", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fkigQggovPhkuZvhj", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 21:29:38"}
{"_id": "9nNRD2sT8RsLwacMQ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | s in (Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s : State | Event = s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "Y67fbCFPKyS5Xyu9T", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:14:33"}
{"_id": "w86fPfXBGYLgKLH7F", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i : Init, s : State | s in i.*trans[Event]\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3Svci5H73u9EfKuzy", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-8 15:50:20"}
{"_id": "Yg74uBa3e8CPZqyM3", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "u5o934mLeahPYZmcZ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-2 17:58:03"}
{"_id": "sRWPsCcPWvjYMJkKc", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in Init.^{x,y: State | some x.trans.y}\n}", "derivationOf": "WZzgojj8mv7otPyr3", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 01:15:01"}
{"_id": "GQ4ts7q8PvwjqCejS", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \t(State:>trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yxxrsCw8h8mYBkdQZ", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:13:17"}
{"_id": "u6ToCyML5fi79ENRe", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "HcQMzGjguz6tHpmmQ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 03:34:39"}
{"_id": "XnbTNEob8jkj9phKn", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { trans.~trans in iden\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Hs3nTtkQ3JNac4tQ5", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-15 16:18:21"}
{"_id": "tiEyn2hEYc37zxhar", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZDrWfTmkQsdK2wyhH", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 18:38:12"}
{"_id": "nDqTAxTxne84QjYe4", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State, e: Event | lone e.(s.trans)\n  \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\npred inv4 { all s : State | some i: Init | s in i.^adj \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r:State | (s.trans).State = (r.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { all e: Event | some (trans.State).e\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qo3DTD56zyBXdQzKk", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-18 12:12:34"}
{"_id": "sacuTiMDReDCvWu6a", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n  some u : Init | State in u.*{ x : State, y : State | some e : Event | x->e->y in trans}\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QDH7jws3AkyLmjtYZ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:41:46"}
{"_id": "c3xisY4ykRYY76jPF", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | one i:Init \n}", "derivationOf": "KYW6LxRewcJZnDmRw", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:58:37"}
{"_id": "KmfEKpTHparQt7G39", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s1, s2:State, e:Event | lone (s1->e->s2 in trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ciCDEvZqxvR9sm8Dg", "msg": "This expression failed to be typechecked line 31, column 30, filename=/tmp/alloy_heredoc3857611420104838580.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-21 18:46:05"}
{"_id": "QZJtFDmtrN9pEiX3y", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init | some e:Event | no ((State-Init)  - (Event.^(i.trans)) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bz46kpZpL8LnSMz54", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 18:50:14"}
{"_id": "KYW6LxRewcJZnDmRw", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | one i:Init | i in \n}", "derivationOf": "Kbh7WGQa3oGaXwdme", "msg": "There are 29 possible tokens that can appear here:\n# ( * @ Int NAME NUMBER STRING String Time ^ all disj fun iden int let lone no none one pred seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:58:31"}
{"_id": "bFb77m39j3oy6Pf4v", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone trans.Event\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mATsbQiZioHqYqxys", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-15 16:37:38"}
{"_id": "4FDsE2atyeEY52y2e", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e, e1 : Event | s->e in trans.State and s->e1 in trans.State => e = e1\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iY2wt2Zy6pPWSFbyx", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 02:52:45"}
{"_id": "LNvDyWnLCPm9a4ehr", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i:Init | s in i.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aGzh4w7HNKbsYapXE", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:38:15"}
{"_id": "jAgspvWQuKiKag5wY", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone Event.trans\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {for all i : Initial | trans.Initial\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BwD6nn3KRb5jQSA7w", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 21:32:34"}
{"_id": "3Jmf7WoaENZKwMmjM", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \n  \tall e:Event | e in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RWzR2xynGT7Qjv42g", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-21 12:23:15"}
{"_id": "GqzetPNRM62a2Rx7E", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet st = Node\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6mqpx9XzYGrBrLEDB", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-11 00:21:22"}
{"_id": "QACtwTRjFmYgv9wmr", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : (Init <: trans).Event.State | ^(s->(Event.(s.trans)))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "ToTdaxYT7wGcMRQbD", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:53:55"}
{"_id": "zMGbyS3bzvkJmy8wN", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  \tall s : Init.^adj | some s.^adj <: Init\n}", "derivationOf": "WZeAc7KYA46gcb4uf", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 11:52:54"}
{"_id": "AELg8FmBdc7FFGv8e", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, all e:Event | lone s.trans.e \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "q5sh6eEjWhDiSr9Xi", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 12:05:06"}
{"_id": "WzmYhZg5oCkQQBy2x", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState-Init in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cqF99ZbLmu5EACeBK", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-13 00:11:55"}
{"_id": "ntyFdkPMemy27BMHK", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n  \t\t\t\t\t\t\t\n    all  i:Init |some e:Event |  no (State - e.*(i.(trans)) )\n  \n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "s7MLnLgbKuYxYZQkQ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 11:04:21"}
{"_id": "kwC7ms5JiibiisQM5", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tState in Init.^rel\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ke83Xh5eqatqFb4d7", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-9-12 10:01:54"}
{"_id": "mHzQ6czva6NHY4GKf", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t one s:State | all s2.State | s not in Event.(s2.trans) \n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DidqAAq6Dyg5ksJSg", "msg": "The \"all x\" construct is no longer supported. If you know the range of possible values of x, consider rewriting it as \"x == set_of_all_possible_values\".", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 02:02:14"}
{"_id": "5jKtkvkw6MBjn4suR", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone s.trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ngzdhGHgKceDydZgY", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 21:31:14"}
{"_id": "XJKKM3XSNKTqqkRGS", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PfN77pNGJ5WNLPJsB", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-26 09:27:50"}
{"_id": "kDjDbmGX58XtXbxEX", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5vhLewytMAiJ3PruA", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-10 18:58:19"}
{"_id": "2siJTBziNkBxCzkcP", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall e:Event,s1,s2:State | s1->e->s2 in trans implies s2->e->s1 in trans\n}", "derivationOf": "d2NfLaSNRE82RyDTH", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 21:13:13"}
{"_id": "uB3cNX9BJC5LHmKSK", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet adj = { s1, s2 : State | some e : Event | s1->e->s2 in trans} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some (trans.State).e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aM2rokP7MryDphPeY", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-3 11:17:31"}
{"_id": "RTQaj6D8PNcetoYXy", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s1 : State |  (Init.Event)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SfnTb2nppwfjsypS3", "msg": "This cannot be a legal relational join where\nleft hand side is this/Init (type = {this/State})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:01:33"}
{"_id": "ZHfJR2Ay9Ha5z4RS3", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone State && all s:State | no s.trans\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PG8cnCfGFBjfreYGe", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 11:55:55"}
{"_id": "KMysFhXhwg8YiJdKN", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State<:trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "A9JdJzdHAesKstCrC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 09:58:42"}
{"_id": "4pYcpnTR2gcBYsnPf", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all  y : State | lone y.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "u3psYinSmduvvxzqb", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 21:47:57"}
{"_id": "onxDAdZTRGzPvHKHW", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some t:trans | t in s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "svqLD2QdpNdzbiEog", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:23:19"}
{"_id": "eZeHkWhNrnNDr7Eaf", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PAhp9bL56WcFN93q6", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-7 18:34:16"}
{"_id": "KPenZMhW8LtttL494", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i:Init, e:Event |  s in i.trans.e\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mJY4LGgvAj4KPQnng", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:38:59"}
{"_id": "sAtqwXxCf9LqzySH3", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event.(trans.x) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mKkmnH9FiJaE7SXAT", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:51:01"}
{"_id": "Ek59wir9uPMcqKQG9", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.^trans[Event]\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zXumZKYYmJfvXQ67u", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-9-12 09:49:21"}
{"_id": "CufQz2XfWvfa6p2QP", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | some Event(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "aosXYxKyvrNnFCnKA", "msg": "The name \"s\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 11:54:45"}
{"_id": "8dzwgtNZyTwzzWQHz", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i : Init | State in i.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Hi8KwPhZYf6Krco8G", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:04:30"}
{"_id": "deZLxoDSF4beTYLE3", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gbv7GdY2ZPs3mKt2H", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:25:26"}
{"_id": "Cd29v73EQEcJ2ca4T", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n \t\t\t\t\t\t\n   \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "x2GTxERh5EkankXyu", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 11:27:28"}
{"_id": "LihA4odjN2e2tCdjm", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mdKTgvMZcJvkwL296", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-9 17:21:49"}
{"_id": "m8movEagEAvnAxq9M", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State, e1,e2:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans\n  \tall s:State,e1,e2:Event | s->e1->s in trans implies s->e2->s in trans\n  \n  }", "derivationOf": "mBNgcekumR6FLd42W", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:46:04"}
{"_id": "Amdn5kHhDKLnHYrte", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QsMHxNyajGm773xrC", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 13:15:35"}
{"_id": "ST2js2tfmCFLfF6h8", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | some s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hkhLE83KC9kAMaWnG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-30 18:41:06"}
{"_id": "FmGrtCCi56BA6nX3K", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State, e: Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "e9cEapTp2JrgB5rf3", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-18 11:59:23"}
{"_id": "7QWWK2L359nMeufwY", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(*(~t))\n}", "derivationOf": "4LJzqMMahYQ8aiRyi", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:14:08"}
{"_id": "2vtRuXBKd6RQhAhPX", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  some Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:03:15"}
{"_id": "pP59DvAxn3fsycpMX", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | all e1,e2:Event | e1->s in s.trans and e2->s in s.trans implies e1=e2\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "t2k3nv8XfLgeEjjjS", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 18:57:23"}
{"_id": "nC3m6H9WCedeJYk5s", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some (Init <: trans).s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DQwtoZREpLnZhxt9Y", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:13:07"}
{"_id": "xfDNaYkKwDFMdjooz", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | all s: State | Init.trans implies e->s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8SEXAz8AEhfXEpQwq", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:14:29"}
{"_id": "ejvnJZdiHqRQ3FP8F", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State |one e: Event | lone s->e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gkm2p3mAmiaGASX4x", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 18:37:40"}
{"_id": "kyvBTwuXEd5ni3cJW", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n trans.State.Event = State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n\n   all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n\nState in Event.(*(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  \n \n all x : State | x.trans in State.trans\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n\nEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n\nsome (Event.(State.trans))\n\n}\n\nrun {} for 3", "derivationOf": "6NXhSMwrhm6vM98nf", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-6-10 10:29:50"}
{"_id": "DJrvJbYaiRNjTpFQZ", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  let t = {x,y : State | some z : Event | x->z->y in trans} | all s : State | Init in s.~t}\n}", "derivationOf": "RZMPuNQbfbLuiakHp", "msg": "There are 5 possible tokens that can appear here:\nenum fun let open pred", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-23 04:24:20"}
{"_id": "MaXfpMXMHHNykJQWf", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tlone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gxAMojWDaPB2d7Prj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-12-30 17:19:01"}
{"_id": "rZmg9ngXnRkbTJvi8", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  some (Event.(State.trans))\n}", "derivationOf": "izmGT8TZ5FtjNAXXF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:26:48"}
{"_id": "BWhiaT7mXrdMp9Z57", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  Init.^adj & adj.^Init\n  \n\t\n}", "derivationOf": "NYhvXmiPRCs7iN5FQ", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 10:47:46"}
{"_id": "MSFTCohMpBrgDxBYw", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | some e : Event | s1->e->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init->State in ^tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ifS5opueNuNKtRA9Q", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 15:57:44"}
{"_id": "r4u98pnDQtyXX9Y7S", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    some (State.trans & (Event->State))\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "L3oX7qSmqK7xMq2kW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 00:46:38"}
{"_id": "JH6eYW4XHDbLxrhKs", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tiden in trans.~trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ze7HHabT7ML4WGbjA", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 02:27:27"}
{"_id": "jqQ4XNyyeeDCfAMff", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nK3YKDeFfyywLqjHD", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 14:10:37"}
{"_id": "dC4xaQ84yQeBMaHWM", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    State = trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t{state: State, event: Event | some event.(state.trans)}.~{state: State, event: Event | some event.(state.trans)} = univ\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "F8SgtzdFKLoxKKZX9", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/State->this/State}\nRight type = {univ}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 00:58:19"}
{"_id": "ghy5KQinBkomvG7ZP", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  {s1, s2: State | s1->Event->s2 in trans}\n}\n\n\npred inv4 {\n\tall s: State | \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoMbN9Tq234d77fFf", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:55:36"}
{"_id": "dD9qGFrnPrycM4xvt", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone trans.State\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "noMLo8NNAxsLAnvx3", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-9 17:32:42"}
{"_id": "tP3Gtkuwz5cHxLLcu", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans.Event\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 21:35:25"}
{"_id": "inBGWH8nFaCKm4bzv", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e.(State.trans)\n  \n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall r : (Init.^function) | Init in r.^function\n}", "derivationOf": "iy5Y6vfwD3FXNmfGS", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:19:21"}
{"_id": "siPD6nfdrt6agAxX9", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  \n  \tall s : State, e : Event | lone e.(s.trans)\n  \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wyrcwRSrwQxHRiNvB", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 11:06:56"}
{"_id": "Tk56vQbGAzADk853G", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n  all x : Event | some Init.(*(~(trans.x))) \n}", "derivationOf": "ofAMghLpziZu4LqhT", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:22:14"}
{"_id": "Tqzty46EbMZLmJgKg", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  all s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "emz2FXJXjsvgjbPh3", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 12:16:52"}
{"_id": "w665TxMj4iByJcBeD", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.trans \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "chqEPQBmHH6QFjqbP", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:45:49"}
{"_id": "xzjC5yaxpSk2MPqMD", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GMydmv9ByM4uzR7Yy", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 14:17:03"}
{"_id": "Nnysx7p2HmKzL2YFx", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.trans\u00ba.Event\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "L9Q3A4JLqoGedKP9Q", "msg": "The name \"trans\u00ba\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 11:17:50"}
{"_id": "xQjkE9GxLKccW9FiQ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.(^onlyStates)\n}\n\nfun onlyStates : set State -> State {\n  s1,s2: State | some e: Event | s1->e->s2 in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "28vXrCk66wHx8ffTJ", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-23 04:17:28"}
{"_id": "Q9NLsdAgM3CTivtRq", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in Init.^{x,y: State | some x.trans.y}\n}", "derivationOf": "ngcMxCPtTjyqhmHoQ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 01:14:55"}
{"_id": "gSegjZBDBmCBTh8Pe", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  \ttrans.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "AdayqGPYxgvBvGWZi", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/Event->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-14 10:16:45"}
{"_id": "oHAvsdkvRxpcfzDWv", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone s:State | s in Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2:State, e:Event | s1->e->s2 in trans \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zwobrwZaQx6SezccR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 00:30:39"}
{"_id": "hvZLcNTxwnJEgZcfP", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlet k = ~(trans.State) | k.~k in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "W8GXHnkmb9RjwSvAM", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 13:58:02"}
{"_id": "qLXHmF6yvZzsfzYah", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n  \tState.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \t\n  \tEvent = State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zLjhS3e5wYJEDLaFZ", "msg": "== is redundant, because the left and right expressions always have the same value.\nLeft type = {this/Event}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:31:56"}
{"_id": "yFT8HWJNgKKZkSsuj", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all x : State, y : Event | lone y.(x.trans)\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZE8fzb9ahFgMNd49g", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:23:33"}
{"_id": "egCwqrix2JCm2tMGN", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n  \t\t\t\t\t\t\t\n    all  s:State-Init |some e:Event |  some (trans^.(e->s) &Init)\n  \n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "ZGMLR24RQoiz6cHkG", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 11:09:16"}
{"_id": "sY5vexg75nqEKxBBe", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n  all e:Event,s1,s2:State |some e1:Event| s1->e->s2 in trans implies s2->e1->s1 in trans\n}", "derivationOf": "hKpJRvtpEH7YRBEsk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:43:15"}
{"_id": "yxxrsCw8h8mYBkdQZ", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \t(State :> trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6JqsYgGMHHx9R6GPJ", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:13:08"}
{"_id": "8rZXSFbfYEKjxXhJE", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event| some s:State | s in (e->State).trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YfxSeLizZWKLsohh6", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:47:24"}
{"_id": "gxAMojWDaPB2d7Prj", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-12-30 16:45:52"}
{"_id": "w2F78hNfeoyfjchmK", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden in ~trans.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:30:29"}
{"_id": "guq9azBmF5fuae8eY", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tStates in init.^trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "y5fiMo4aB9Q4iPY6G", "msg": "The name \"States\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 14:25:57"}
{"_id": "XSvBz2w2GthrgYNfN", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n  all x : Event | Init.(^(~(trans.x))) \n}", "derivationOf": "TJ4CrTwz6haSTNi6P", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 12:21:29"}
{"_id": "qxihADXPq8gJR2Pdh", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State , e:Event | some (e->s) in s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Wyysoa5JPMTun3hcT", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 11:52:23"}
{"_id": "jFW5imsvSTa7kv2ki", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in s.^{x,y: State | some y.trans.x}\n}", "derivationOf": "tYBr3Fg4RcqLqqmfp", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:41:15"}
{"_id": "hKpJRvtpEH7YRBEsk", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State, e1,e2:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans and s1 in e2.(s1.trans)\n}", "derivationOf": "ym9RhmM9kMkia6u6K", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:42:41"}
{"_id": "bDqfwBKmFTuFnmbH4", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tEvent.trans in Init.*trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "32PoMXtahfrKYrCWv", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 21:52:56"}
{"_id": "ce38Aw9yGXHbbwmZp", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2Jcsxpa9JZoQeojPC", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {univ->univ}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-10 23:46:24"}
{"_id": "FBXyfGgEeYKZFZ9Z7", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:(State-Init) | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | all e:Event | e in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZQR3Rjn9bpn868hM7", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:57:11"}
{"_id": "DAv5qc65nZPAknRtZ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in (Event.(Init.trans) + Init)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fzJToExesZEtsCrin", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:13:41"}
{"_id": "f52Dm6MKsZuDZK8tk", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vRFDow3KQLe7dHLZe", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-9-12 09:48:02"}
{"_id": "KKqr6JJzCD2kzd9cQ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DAv5qc65nZPAknRtZ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:13:53"}
{"_id": "xkhqW7AJCh94XAiCb", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tWC2BZ3f9CteWGQny", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 23:38:27"}
{"_id": "GY3NYzN2vqekgLEcH", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall s:State,e:Event | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pybpBamcKhoHtAgT9", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 19:00:35"}
{"_id": "KxCMRQ6mZ85RcTj9B", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sTnAggtzHZijNK4K9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:57:56"}
{"_id": "Q7EJFNXR5o2wQLJJC", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  \n  \tall s : State, e : Event | lone e.(s.trans)\n  \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\tEvent in State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gZxBzHCyTH85pc7zH", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 11:12:28"}
{"_id": "SjaSLHgnjFsaFFiEF", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in e.(Init.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "s9unoypig8vRE4aro", "msg": "The name \"e\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 18:53:44"}
{"_id": "gaSQXaMLua3LKhpPa", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n   some Init.^adj implies some ((Init.^adj).^adj &Init)\n  \n\t\n}", "derivationOf": "E3tkF56R4wpSRgW2Y", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:53:53"}
{"_id": "Np4d3eQs6BwXFkHv3", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State, e1,e2,e3,e4:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans and s1->e3->s1 in trans implies s1->e4->s1 in trans", "derivationOf": "sY5vexg75nqEKxBBe", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 12:44:43"}
{"_id": "ra7v7N8BGGEteb73W", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n  \n  \n  \n \n  no ((State - Init)-(trans.~trans))\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "65847gZXEWjTQaZvW", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 19:24:54"}
{"_id": "wJHSZKTQeCm9WgN5d", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n\tInit.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | Event in (s.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "PNxagPtEEPMf9xYNW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:40:37"}
{"_id": "ZuEDnkznvZaaojkQA", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t~trans.trans in iden\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\talways (all s: State | lone s.trans.State)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ajnBbYo5H95c54cfB", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 20:09:10"}
{"_id": "6AiirsS2j7jdASYdk", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | Event in s.(State->Event)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vJXyiJ9zHKrCLPoW3", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-24 11:14:09"}
{"_id": "ArMzp5PoozAJisYJp", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone s.trans~.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gbmbT6dB89BAGDf9Y", "msg": "There are 25 possible tokens that can appear here:\n( * @ Int NAME NUMBER STRING String Time ^ all fun iden let lone no none one seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:48:09"}
{"_id": "QgjEWhXcbd2jcdHrf", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | State in x<:Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "fLhjCzJntzbw69a2N", "msg": "<: is irrelevant because the result is always empty.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:19:30"}
{"_id": "d2NfLaSNRE82RyDTH", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cgnvJmvGNZJrv79bb", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-10 21:12:02"}
{"_id": "fZ55HaAJndNrbiLDh", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yFT8HWJNgKKZkSsuj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:23:50"}
{"_id": "euTJebYuEZSoDctjJ", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "QDPe8tZRoXjhgjLeS", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 03:34:42"}
{"_id": "pFRiiWL2j7nv4Jbbg", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tState.trans in Event -> lone State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y: State | some (x.trans).y} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s,t:State | s.trans.State = t.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\n\npred inv6 {\n\tall e:Event | some (State.trans.State & e)\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet adj = {x,y: State | some (x.trans).y} | all s:Init.^adj | Init in s.^adj\n}", "derivationOf": "oisAKr7T4ouApLuwW", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:26:52"}
{"_id": "yipoF8A5hakDHp9Pp", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all e : Event | ~(trans.e).(trans.e) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "oNiX8xi2A5zZTP35m", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:17:56"}
{"_id": "yhGzmEwCA5SthyQXF", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t one s:State | { Event.(s.trans) in Event.(State.trans) }\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tRFcJA34NHqnWP9gc", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 01:53:55"}
{"_id": "BdSddcgqWXAmvqDHq", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone trans.s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pvFCnz9CaF7LvHuBa", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 17:00:45"}
{"_id": "M2WSNesQg4LyPvD2c", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JP9W6qWvje7R7ky9R", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 09:17:46"}
{"_id": "xYKAQYMuEauR5LmG4", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet t = trans | iden in (trans.trans) :> State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FEsQjsXPa55JEsFbQ", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {univ->univ}\nRight type = {this/State->this/Event->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:33:40"}
{"_id": "ACZzFBiqeZDgBdP9t", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s:State, e:Event | s.trans -> lone trans.e\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fhdBnuf8YSxSXsg5M", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-15 16:30:24"}
{"_id": "3qiHycAoAG5Q72a6q", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit in Event\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9ubZFmohyCanv4Zfe", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-12 20:53:13"}
{"_id": "gZxBzHCyTH85pc7zH", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  \n  \tall s : State, e : Event | lone e.(s.trans)\n  \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\tEvent in State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sj85povS3b5S6kgKz", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 11:11:29"}
{"_id": "D6Sj9zFYYuE7qMWMZ", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall s:State,e:Event | lone s.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xJ3xS7tXmxPWWjiHx", "msg": "This cannot be a legal relational join where\nleft hand side is s (type = {this/State})\nright hand side is e (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 18:59:58"}
{"_id": "mNAwNQ2chWWibFw5J", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n  \t\t\t\t\t\t\t\n    all  s: State-Init |some e:Event |  some (trans.^(e->s) &Init)\n  \n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "egCwqrix2JCm2tMGN", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {none->none->none}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 11:10:01"}
{"_id": "LHiLPRn8sXLTCDfJK", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 17:04:29"}
{"_id": "sbHvtwZQXjQsKChud", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/ \npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | ~(s.trans).(s.trans) in iden \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | s.trans.State = s1.trans.State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Noe7sZeEwndjCFxGC", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-4 17:47:31"}
{"_id": "TQMqqAcjJGaM8aaPN", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "P6Qfc8ZwYF5suq6Cp", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 13:41:24"}
{"_id": "Shr45XnrgMPfQDybF", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n all e: Event | Init.trans.e\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "knNzbSM9tPR3bzBDG", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:07:49"}
{"_id": "tpizCGcfW5zCGpCgR", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some e : Event | x->e->State in trans implies y->e->State in trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "kAsx2PrKmtLiy8E6F", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:15:34"}
{"_id": "kE34DgPyYzwpZQYsg", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some e:Event | s in ^e.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pcwxy7vgBYn65nLDt", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-13 00:07:07"}
{"_id": "zoMbN9Tq234d77fFf", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s: State | s.^Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "it6wJfmJPWqAevLTx", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:50:42"}
{"_id": "fTKuiGweusmfDbqLC", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init in Init.(^trans2 + trans2)\n}", "derivationOf": "NPsmWviXpoFYPqj7p", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:57:45"}
{"_id": "2YBkc5LiQsFxLF8kr", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, e:Event | some e.(s.trans)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "daE8Q59sMzw3dMw5c", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 22:10:47"}
{"_id": "mBejRmSrPaW8jB7ks", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State| lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5K7sk2MuyT5LZmY6W", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:10:23"}
{"_id": "4BbCktBjSoF6HxXkj", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s,s1:State,e:Event | s->e in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MWnfdQA4eMJGHQfPa", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 21:08:40"}
{"_id": "XETykzj77LqJiFcc2", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in Init.^{x,y: State | some x.trans.y}\n}", "derivationOf": "sRWPsCcPWvjYMJkKc", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 01:15:02"}
{"_id": "gavvC95j73jPQ9guE", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "k7uMHyAFXTmqvPnqp", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-26 09:27:05"}
{"_id": "emz2FXJXjsvgjbPh3", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wPm2ANqt44mBR6jAR", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 12:15:49"}
{"_id": "MWnfdQA4eMJGHQfPa", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  some Init.trans.Event\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ha7tmx2oj7PHnB9FF", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 21:06:52"}
{"_id": "a8Day9amkffoBS7nc", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gGLdh3Pj3W4DutmQc", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 22:47:53"}
{"_id": "qdqSnQGizCZDBCyAg", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dwi94Zx3pEi3XWQ67", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 11:10:11"}
{"_id": "dMCxHWb8NckmFbtNd", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n trans.State.Event = State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n\n   all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n\nState in Event.(*(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  \n \n all x : State | x.trans in State.trans\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n\nEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n\nsome (Event.(State.trans))\n\n}\n\nrun {} for 3", "derivationOf": "ciYK2NRjQGhrbjWfL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-6-10 10:29:29"}
{"_id": "zGiQikcYNNMy6Mavm", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : Event | State in y.*(x.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mZxnwsWEgbzmxaEae", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:02:36"}
{"_id": "4dRPRhJ5PobxYD892", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State , e:Event| lone e->State & s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.trans.Event = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PAdQsNnJKbBxa6oqE", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 21:35:45"}
{"_id": "v95xsWhiKeT6PTJZr", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  {s1, s2: State | s1->Event->s2 in trans}\n}\n\n\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ghy5KQinBkomvG7ZP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 22:55:44"}
{"_id": "XemESeik62ZpsKCRA", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 18:10:33"}
{"_id": "bTTxNmB2vaBPjNmm5", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | some e : Event | s1->e->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.^tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | s1.trans = s2.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Gz724YNzhC5iw467H", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 16:12:51"}
{"_id": "wyrcwRSrwQxHRiNvB", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  all s : State | lone (trans&s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "T9kB9364wDTtFQ2jk", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 10:32:56"}
{"_id": "eT6jwBjwZq45MF6Kt", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State, all e:Event | lone e->s in s.trans\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EhtavR6tCDnoNnGB5", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 18:45:40"}
{"_id": "yttwfba58di2tHnJY", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\nState-Init in Init.(Init->(State-Init))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 13:40:54"}
{"_id": "Taji2HXKSNHWncE7H", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | all e: Event | Init.trans implies e->s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "foFqoG26biF3JGNwa", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:28:35"}
{"_id": "9gXkvZTWgqDRze2aK", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.Trans.Event\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ukE9qELMrYz9pt5Hy", "msg": "The name \"Trans\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 12:19:21"}
{"_id": "DRhTR8ncJN8PcL7oR", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wCmsuBnyzEgyxewn3", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-4 16:42:26"}
{"_id": "eGG7YXZYKWYYzNtHw", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  \ttrans.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "EZbYg457twcpYzGAx", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/Event->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-14 00:55:31"}
{"_id": "KgDqHE7jcmDeD99yr", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n \t\t\t\t\t\t\n   \tall s:State-Init |some e:Event | no (Init& tran^.(e->s))\n}\n \n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n  \n  \n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "SW3juxYXQ4xS8emar", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 11:34:07"}
{"_id": "iAFXybA5B8oA3SmxN", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | e in s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3JNkcHcq5fhvdLZHA", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:34:33"}
{"_id": "KY3GWvz9BYCzqAoaE", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s1,s2:State, e:Event | lone  (s1->e->s2) in trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vr6rCeiyDj7LXKvhP", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 14:03:37"}
{"_id": "qACyyrDCyCnjEExF8", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | s1->Event->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i : Init, s : State | s in i.*tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TzXKYAJNZBeJ3gPqp", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-8 15:54:45"}
{"_id": "DTdSnFe6W2gGEWN2A", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans.State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wNmGjQKJNBNq6NrRn", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-19 15:22:35"}
{"_id": "CqYR46i7v8H9XmDAc", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set State -> State {\n  { s1,s2: State | some e: Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "WSXrJubcgpJ7fhXgi", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:17:42"}
{"_id": "CwQaNFMWyitqpe4jR", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall State in Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gvfyo7rwLe7Le99Bf", "msg": "The \"all x\" construct is no longer supported. If you know the range of possible values of x, consider rewriting it as \"x == set_of_all_possible_values\".", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:05:32"}
{"_id": "ZpyiStEbDWj59KPCF", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State, e1,e2:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans\n  \tall s:State,e1,e2:Event | s->e1->s in trans implies s->e1->s in trans\n  \n  }", "derivationOf": "m8movEagEAvnAxq9M", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:46:13"}
{"_id": "XGTDHk2JDF93zBH9r", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "ZJMrB2EwX2oqJ2qQX", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 19:04:25"}
{"_id": "jbydPphmRgCBhFYHT", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State| some i:Init | s in i->Event->s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4f6pkkBz93wErqzKz", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:36:07"}
{"_id": "Q6mLuukLjXCHgAd9e", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 {all s:State | s in Init.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r :State | (r.trans).State = (s.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Kh3QptP5b9FdnRsxA", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-20 22:18:30"}
{"_id": "Z3xfe5EEuZyv5AwBY", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { all s:State | Init in s\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xgbwpDi74m37kZ2aW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-15 16:07:00"}
{"_id": "2j8N8zRkn2FjgJqeA", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : evento | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JGfw8cjXXBMBfz8LZ", "msg": "The name \"evento\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-26 09:29:11"}
{"_id": "WQgtkbAWuKdRoqaP9", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t State.~(State.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "N2ribbwdfCQY3TWht", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:32:45"}
{"_id": "pxjRwni2QyxFZeFT4", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n\tInit.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in State.(trans.State)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "coPw9eFGCC7wE87GX", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:38:36"}
{"_id": "D5beomCi7YPrY78um", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\nall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\ntrans in State -> Event -> lone State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\nall s: State | s in Init.^(trans[Event])\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\nall s1, s2: State, e: Event | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nall e: Event | some s: State | some s.trans[e]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ibNfjZkgyXQ2ciyfn", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-14 09:47:52"}
{"_id": "sgneQKvKHnJPrFSbp", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  some State.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BEWGypaTQQWh4MtkJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 02:37:12"}
{"_id": "Z3WZ3kKoxf9S4qvX8", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MMqqKMWEFjZoAxu5e", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-30 19:58:23"}
{"_id": "wGYuvEizfpkpRCNjM", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome s:State in s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 03:03:25"}
{"_id": "uZtAXwoLK2Z6dYzEi", "cmd_c": false, "cmd_i": 0, "cmd_n": "run$1", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\nrun {} for 5", "derivationOf": "kAoWjMxhNHAARrW58", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-11 01:20:39"}
{"_id": "w7s2GL4i2ZTFtNeqH", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State | (some ((Init.^trans) :> s)) implies (some ((s.^trans) :> Init))\n}", "derivationOf": "2g8uSxrFtADHtzCSS", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 04:03:27"}
{"_id": "HYW5v2K88Thep2Xro", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {lone trans.Event\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HmHxnSvgE4mTbBS7d", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-17 21:06:37"}
{"_id": "5CrpuGCs2aaL6Qq9v", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  all s,k : State |one s.trans.k\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bh44ZrfjEyo9YumCY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 10:20:15"}
{"_id": "aYzWRzr7oNu2pmoJr", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in (Event:>trans)\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "PjaEuLhq2BYirYyf5", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-23 08:22:58"}
{"_id": "TJ4CrTwz6haSTNi6P", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n  all x : Event | Init.^(~(trans.x)) \n}", "derivationOf": "F6E9HjMq36ae9xn34", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 12:21:04"}
{"_id": "mbQkibd73Eeczzjip", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init| some Init implies   no ((State-Init)  - (Event.^(i.trans)) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fqki4jyszeYkR4mkS", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 18:52:49"}
{"_id": "LuMquZre6E5jXLMPT", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tKtxbLDHexmy9gTwv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 02:43:58"}
{"_id": "rbpZNxxv73xqfDKXn", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "FwcYxaFBBx9rvwWsJ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-7 21:57:23"}
{"_id": "BwD6nn3KRb5jQSA7w", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {for all i : Initial | trans.Initial\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "w3qp7mXPbfdwC2rSe", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 21:24:40"}
{"_id": "JTSQxCDkHxwKDtJiR", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xTErDpNrnom4MEQvs", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:12:33"}
{"_id": "RaxLgHSeDvDgjv6Hp", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y : State | some e : Event | x->e->y in trans} | \n  \tall i : Init, s : State | i->s in *adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "W8WmLRDPZ47hieiLe", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:13:56"}
{"_id": "kPMeTtxb9cjQ8vmsq", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tall s:State | Init.trans :> s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6fg48p7yJ3ogP9FLc", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 19:37:13"}
{"_id": "mNN8YtroCFNgh3YNb", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | Event.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pvnzXGSGnb5hyu2vX", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:21:22"}
{"_id": "hE7NhN6MuhrXzBPau", "cmd_c": true, "cmd_i": 7, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2: State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s: State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\nfun getEventsOfState[s1: State] : Event {\n  \t{ e: Event | some s2: State | s1->e->s2 in trans }\n}\n\npred inv5 {\n\tall s1, s2: State | getEventsOfState[s1] = getEventsOfState[s2]\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e: Event | some s: State | e in getEventsOfState[s]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\n\npred isReachableFromState[s: State, i: State] {\n  \ts in i.*onlyStates\n}\n\npred inv7 {\n\tall s : State | some i: Init | s.isReachableFromState[i] implies i.isReachableFromState[s]\n}\n\nassert bla {\n  \tall i: Init | i.isReachableFromState[i]\n}\n\ncheck bla", "derivationOf": "9imN6Epr87R4Dk66y", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-2 18:20:21"}
{"_id": "KEWc8JYd7iC78cMbD", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in (State.trans)\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "EQRw8WEtfA2mwMCwn", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-23 08:21:37"}
{"_id": "f9kAqGC4jNZDXccj6", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "ya9LcgHjKgixmCLsi", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 11:58:27"}
{"_id": "6nnegJCx94GPKJo5j", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | e->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZCqgpgGGAs8NNPzmd", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 21:29:59"}
{"_id": "wJBTJzTgtzMvxFQnB", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall e:Event | State in e.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event| e in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "j49GChFYWDmpzGHm8", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 12:27:19"}
{"_id": "4YzQcEiT8KAjr9t9j", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Q7F9cg4nH9gkzK2is", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 09:10:43"}
{"_id": "6cYqmSuAML2cNvB89", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  some Init in (Init.^adj).^adj\n  \n\t\n}", "derivationOf": "BWhiaT7mXrdMp9Z57", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 10:49:00"}
{"_id": "PmFyZaFnNKrr2Dhij", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some e : Event | some x->e->y implies some y->e->y\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "4r42siHDsS7mAPAyM", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:27:37"}
{"_id": "bAAE2MKbfSjwbsaDw", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event| some s:State | e in s->trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "R7fHpGmy8sMrLe9r4", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/State->this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:48:16"}
{"_id": "ZzvK2M6yDBtvjak6S", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tState->Event in iden\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FXx2WMJ8p4NQdPt4r", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-24 11:08:44"}
{"_id": "ppotfPBk9iuQMgAdL", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | one s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jSX9xuPHPgckFHHS2", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-12 19:41:43"}
{"_id": "v6WkFo9MZxuWxAkWy", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some Init <: (Event.s)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "L4Wf7g8GSPMXYsDt3", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 21:35:58"}
{"_id": "JwuFWq7wFfzEFKcfh", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "r9YYzogaYRGugvemx", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-30 19:28:16"}
{"_id": "Azg6JnHtXceeroWvt", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  \ttrans.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "AaBxzWji4M5FBYjMG", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/Event->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-14 00:56:01"}
{"_id": "XePFmmukxvcYnhNe4", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5KTbGd2aX2B78ZJpi", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:57:52"}
{"_id": "rZ9Cpa8ByndHCid6y", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9tfSgd3y4cds8BxQx", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-8 15:46:41"}
{"_id": "ghLGGLtJDJdEXAjH8", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone Event.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kKaGba5Rdp9TREGbf", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:27:11"}
{"_id": "8Ln5Fx6mwcnT8Rbt4", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "ALStvEiPTZ8bTxpCF", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 02:55:02"}
{"_id": "kpG3C5nwLXqzQuToB", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i:Init, e:Event |  s in i.trans.e.s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KPenZMhW8LtttL494", "msg": "This cannot be a legal relational join where\nleft hand side is i . (this/State <: trans) . e (type = {none})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:39:06"}
{"_id": "TrhJp7ptX94BvsRpW", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sFsjEyWzxiRAaJrys", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:46:22"}
{"_id": "Q7F9cg4nH9gkzK2is", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 09:10:31"}
{"_id": "mSYW6MqrTixEwM2J7", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 :State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State-Init | Init in Event.~(s.trans)\n}", "derivationOf": "G7GYs3vfgxGmwCkRy", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:21:59"}
{"_id": "daE8Q59sMzw3dMw5c", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "dhR5oM7MegXhfjsBB", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 22:10:32"}
{"_id": "h5YpSQFe2cNEBLF2D", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some (Init.trans).s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "m8xbPTMb7QQsfRb4Z", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:20:53"}
{"_id": "gouPvsGxhdyNXW9jR", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | one i:Init | i in (s.^trans).Event\n}", "derivationOf": "zRtmLyPRQEQ4zwBG4", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:57:48"}
{"_id": "iAGbTQY32rkzanQAh", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init | State->State in ^(State->Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "FPXCZZGzDhCASW5PM", "msg": "^ this/State . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 15:12:11"}
{"_id": "8TedzuzDdYfX7Gqfn", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CuMWt53xsaKg7nAbx", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-4-21 20:47:01"}
{"_id": "ToTdaxYT7wGcMRQbD", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init <: trans | ^(s->(Event.(s.trans)))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "eiaFxB5pLyZ9j7yqp", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{none->none->none->none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:52:49"}
{"_id": "wY4h9aKFWmmxGZEpF", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | all s: State | Init.trans and e->s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YRoJFp2zu9QwBXNBm", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:16:31"}
{"_id": "hSZFycuW4gfcedQ7M", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State all e:Event | lone e->s in s.trans\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "eT6jwBjwZq45MF6Kt", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 18:45:48"}
{"_id": "ppPxQ3SaMjWeMCME3", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | Init in ~(^s<:trans)\n}", "derivationOf": "uZZdmy3hJRM9bhCNc", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:29:04"}
{"_id": "bTsPxRwFCiy2fwu22", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  all  s : (State - Init)  | some e:Event |  some ( Init & trans^.(e->s) )\n  \n  \n  \n \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5MoBgdao3Qxf9fDRS", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 19:13:06"}
{"_id": "xbCb6hD5vEzmgHrYN", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some s.trans :> Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4J5bb9FZg7iAGzF3D", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 20:16:22"}
{"_id": "jin9Z3xtHdSk65AL6", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  State in Event.(*(Init.trans)) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "xXsjAmkJykeXmecsd", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": [{"parent": "State", "type": "this/Init:State"}]}, "nodePositions": {"State0": {"x": 296, "y": 199}, "State1": {"x": 592, "y": 199}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2019-11-11 14:34:22"}
{"_id": "msHFbWmNx6EkEB2MW", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.(*trans.(State.Event)) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "T4eLekxsgZnJHE9DN", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:18:02"}
{"_id": "B4SvvGTwfi9gRmF9X", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tsome ^t implies some ^(~t).Init\n}", "derivationOf": "FEDsNtuo32KcJvhgo", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 07:39:13"}
{"_id": "iCrndpWGfmrkedjcH", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tState.trans.~trans in iden\n}", "derivationOf": "LyJoxxwMdZFmMFr2C", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 14:18:27"}
{"_id": "LW7YbJuSHKR36vXvT", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n\npred inv6 {\n\tsome s : State | Event in s.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cxksY238M74sBzRbm", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-11 00:23:11"}
{"_id": "EzhWAoswPi27fTuSL", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | State.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3KebtqvmF2r32pBDw", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 03:25:57"}
{"_id": "kQDXfEwCd67LuAYWL", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans}\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.*adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5voXyZo9YWpuuRSKa", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:47:01"}
{"_id": "EpmxyAXhRsyorwdbF", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YLjhajnjbWrGpRzmG", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 15:04:19"}
{"_id": "JyQktvEm8wHxGa7SZ", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | some e : Event | s1->e->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.^tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bTTxNmB2vaBPjNmm5", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-8 16:14:08"}
{"_id": "MJ6X8GyJYYTrW8c7P", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TuDYLJYNFg2sCYRWs", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-19 15:42:04"}
{"_id": "YRoJFp2zu9QwBXNBm", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | all s: State | s in Init.^trans.e\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ybd89nCYCi4BLWGAt", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:15:39"}
{"_id": "32PoMXtahfrKYrCWv", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState.(Event.trans) in Init.(Event.*trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tXbchyKWwdSNoCzRF", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 21:52:17"}
{"_id": "BhLcJLzZDP5nqaX8t", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\nall s: State | e : Event | lone n: State | e->n in s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wsHHo3QE5Hf5KNpuF", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:17:59"}
{"_id": "YxzbZ5Zga22QxjsXW", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some Init.*(s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "vNwFWWBTiTLwPuY42", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:42:26"}
{"_id": "8wqvYD7FomXhStRsp", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s,p:State , e:Event | s.trans in e & p.trans in e implies s=p\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "piAcF4qtYFJxLDMzp", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-15 16:53:30"}
{"_id": "EYzc7jamfafXBaPXc", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jqQ4XNyyeeDCfAMff", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 14:11:36"}
{"_id": "7KXGvRxp3Bcc5x7Zs", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj={x,y:State | some e:Event |x->e->y in trans}\n  \n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4B7H7eb3wCBfS8r5t", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 08:59:08"}
{"_id": "JrByHp62vAdBQesEN", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  let t = {x,y : State | some z : Event | x->z->y in trans} | State in ~(^t).Init\n}", "derivationOf": "Mws5Cp5LQpukApDEQ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:20:50"}
{"_id": "GxugYSiLPfvYGn36L", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all x : State, y : Init, z : Event | trans in y one -> one z one -> one x\n}", "derivationOf": "JrByHp62vAdBQesEN", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:21:30"}
{"_id": "2oMBfxZ4xZLKEfTvj", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State |one e: Event | lone s.trans->e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EXpeWHuPTChei9mYe", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 18:37:06"}
{"_id": "fYeoemZgL4D44Lgtn", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | i.trans.Event.trans.s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "Ge9anQtTNofL7Fo2Q", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-14 00:49:48"}
{"_id": "7vy8uN8SCqwvZPPQC", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlet k = trans.State | ~k.k in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4avdBNN5x2ouYwWER", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 13:57:05"}
{"_id": "Rc4bK6hF4WxzZv6cN", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, e:Event | some e.(s.trans)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "4fvquhL3grs6N9pTJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 22:09:05"}
{"_id": "SB7Jtern7C2T8Qfhm", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : Init.^adj | Init in s.*adj \n}", "derivationOf": "h8Rw8Q7BZqZycDsoQ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:31:17"}
{"_id": "siZnau666TMBamdQs", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.(^{ s, ns : State | s->Event->ns in trans }) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t((State - Init) -> State) in ^{ s, ns : State | s->Event->ns in trans }\n}", "derivationOf": "aEqM5kCT5KsyzqQe3", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:31:02"}
{"_id": "mr7kpBDxqocp5F29c", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | (iden & (Event->Event)) in (s.trans).~(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "TkA5AWwfMRifnQqn5", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:21:49"}
{"_id": "kmiXKTYbarKZbQ2Pb", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-5-23 09:08:43"}
{"_id": "JSaKgHrd93ibnYCZn", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | s in Event.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "QudyobGjn8jmYAjJK", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 03:00:43"}
{"_id": "mZxnwsWEgbzmxaEae", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : Event | State in y.(x.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CJJMSxesbf68KuLJf", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:02:07"}
{"_id": "5CnWu9WShyqWReQhz", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tsome State->Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nouSZ8cM6M7jvpccF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-24 11:08:16"}
{"_id": "RCYRaz7jRsSAkatLx", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init | State in (x.trans).Event\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "J4d5vN5FoWiKkFxYC", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 22:12:18"}
{"_id": "BEGhL9bgGMB4Hi2nS", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | s1.trans.Event = s2.trans.Event \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SWrdEz4upaG6QEkJP", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:41:13"}
{"_id": "ntSHSZYX88oquqAC8", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: Event.(State.trans) | s in ^{x, y: State | some (x.trans).y}.s\n}", "derivationOf": "evrR7RLQQh9hh9N5Q", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 21:51:34"}
{"_id": "MiW4QJxLjhtnvSxmS", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State, e : Event | some x->e->State \n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FF2aexP6YCNocbkmi", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:57:48"}
{"_id": "3HEktHPfwPfuz5kAB", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "siDgjtxe6k2sJCavg", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:06:37"}
{"_id": "trHc5RSsGPS9jjoF7", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "LojWD2wiZ5Md989vW", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:27:41"}
{"_id": "wyc5ZPc6nLAvr9uES", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e->s in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ikSpMSXdLuqPt8FeH", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 03:36:49"}
{"_id": "aipRjpbonzc6vBfHH", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XCTSkY5Ky6xd25m9R", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-7 20:55:02"}
{"_id": "Wkpc5WTkp99sEWdbC", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | one i:Init | i in Event.(s.^trans)\n}", "derivationOf": "trBwhudo7aB27Khu2", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:57:31"}
{"_id": "BbwrYfBpiMGnxujsJ", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tState in State.(trans<:Event)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "e2pQ4EEuYoW5AxLcE", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:13:56"}
{"_id": "yScXnMftW5rDiKAZ6", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | some (s.~(Init.^trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "qDkRF5eyCC2DsdCGB", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:06:46"}
{"_id": "NQrCKZEyD527G5k5z", "cmd_i": 2, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n   \t~trans.trans in trans->trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "6ef7HaseDCC529oXp", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:20:38"}
{"_id": "uBtKk66kSb84fqe24", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  some trans.State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:54:18"}
{"_id": "tvJah4CCZzqZNXT6H", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit in State.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "feuH3iYTMPpep7Di2", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 18:10:15"}
{"_id": "cHrwdMpyELrzkS2aW", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "CYbqvnqTfBDmdeTJT", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:44:11"}
{"_id": "hoTR4AJ4ZCDMKBHHg", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State | Init in Event.^(s.trans)\n}", "derivationOf": "4omCSPSuJgy6AmPzj", "msg": "^ s . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 18:06:14"}
{"_id": "cZhaTNKibfBWNGc2c", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SpjqAywf8LYhXEJcB", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:42:30"}
{"_id": "h8vgo6FF6Zsnk8sJo", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone (e.(s.trans))\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1, s2 : State | (s1 in Init) implies (s2 in (s1.^trans)) \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Sd9mPz8A8436vHtb2", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:16:47"}
{"_id": "fr7uo7tMEXu7ruLaW", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event:>(x.trans) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qwSxzFha6A3e2A2bt", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:47:39"}
{"_id": "kffYWtm5CaNFtakW9", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "or7fxyPczmi3czmjz", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:24:23"}
{"_id": "Kn2PkdiFsdzsCgZNh", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State , e:Event | some e->s\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qxihADXPq8gJR2Pdh", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 11:52:55"}
{"_id": "87b4jTDNAhgKuZkJ2", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "tpmWTnMQr5RdFqzYj", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:25:48"}
{"_id": "db5PnYzBzcefthRvu", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tall s:State | s :>(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Kj9Mt55sh6WLYazXq", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 19:35:14"}
{"_id": "CaQdZw66d4i6eZJF7", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6NDnzZYowd3kwCKRb", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:18:46"}
{"_id": "EfYzkvLayN5EfriZP", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tState.trans in Event -> lone State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y: State | some (x.trans).y} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s,t:State | s.trans.State = t.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\n\npred inv6 {\n\tall e:Event | some (State.trans.State & e)\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet adj = {x,y: State | some (x.trans).y} | all s:Init.^adj | Init in s.^adj\n}", "derivationOf": "pFRiiWL2j7nv4Jbbg", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:26:56"}
{"_id": "q5gxoa5CvXJjPiFN8", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | Init.trans in trans implies trans.e->s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nMDAqfWwvZKSoYLag", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:27:00"}
{"_id": "F2tFYCW8r9YrQqqMM", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall e : Event | trans.e\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qLcrMjYfv5py8zeRX", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:37:28"}
{"_id": "XjDhSmpkDGKpbdHRs", "cmd_c": true, "cmd_i": 0, "cmd_n": "bla", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2: State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s: State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\nfun getEventsOfState[s1: State] : Event {\n  \t{ e: Event | some s2: State | s1->e->s2 in trans }\n}\n\npred inv5 {\n\tall s1, s2: State | getEventsOfState[s1] = getEventsOfState[s2]\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e: Event | some s: State | e in getEventsOfState[s]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\n\npred isReachableFromState[s: State, i: State] {\n  \ts in i.^onlyStates\n}\n\npred inv7 {\n\tall s : State | some i: Init | s.isReachableFromState[i] implies i.isReachableFromState[s]\n}\n\nassert bla {\n  \tall i: Init | i.isReachableFromState[i]\n}\n\ncheck bla", "derivationOf": "6WwKsu3nEWf9squ2Q", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-2 18:19:37"}
{"_id": "B8ZjnkLtZ7Mrt8PL7", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-4-15 07:29:10"}
{"_id": "a9ktHqteAK7iPabgJ", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all x : Event | (trans.x) in State one -> one State\n}", "derivationOf": "EZinDW5qskSNTAH55", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:25:29"}
{"_id": "c49XEq7RzWokvc9yT", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tState in Init.^rel\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2: State | s1.trans.State = s2.trans.State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  \tall e: Event | some s: State | e in s.trans.State\n\n}\n\n\npred reachable[from, to: State] {\n   \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tto in from.^rel\n}\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all to: State | one Init and reachable[Init, to] => reachable[to, Init]\n\t\n}", "derivationOf": "qn37NybvWcdreatPF", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-9-12 10:05:05"}
{"_id": "g3KusqYfCYondk2FB", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.*trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LpkpoL2xnpzMvpetb", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 21:46:17"}
{"_id": "ezvKLrG8QBitskcHR", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  all x : Event | some Init.(*(~(trans.x))) \n}", "derivationOf": "HQzgGowCDXHdDZmP8", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:27:01"}
{"_id": "qZ8HgnXgKXoG4atsi", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s: State | s.trans.s\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BpeR39ELpi48bYubJ", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:19:14"}
{"_id": "TwbKun99AgPjbcpfm", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { one trans.State\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dD9qGFrnPrycM4xvt", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-9 17:34:51"}
{"_id": "q2Fi8uWEL8rK7QrzG", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FtJ5i3PJJNHJkto3k", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": []}, "nodePositions": {"State": {"x": 523.9921875, "y": 199}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2019-10-17 10:44:04"}
{"_id": "swd5SSJqTrvzFKaxZ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans} |\n  all s:State | s in  Init.(^t)\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "viZeRLo7kTSfXQ6zE", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:55:02"}
{"_id": "NsnKGufMsxrztMLwy", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1,s2:State, e1,e2,e3,e4:Event  | s1->e1->s2 in trans implies s2->e2->s1 in trans\n  \n  }", "derivationOf": "EWg8GugSryt2zxyvf", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:45:05"}
{"_id": "ScnwumQE9nS2T9wAd", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone trans.s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GP5dKC7LR9RvNxG4k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 18:12:21"}
{"_id": "dWrg8h7JbwWCHx3cz", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n\tlet adj =  ({x,y:State | some e:Event | x->e->y in trans})\n}\n\n/*\nAll the states have the same events available.\n*/ \npred inv5 {\n\tall disj s1,s2 :State |  no ((s1.trans).State) -((s2.trans).State) and no ((s2.trans).State) - ((s1.trans).State)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "6oxrcRXjq3D5DcPdB", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:02:48"}
{"_id": "pFXfm5W4z2FhYpZtx", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone x.trans.y\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dPZeNPftighGaysCa", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 21:51:42"}
{"_id": "YwaXE8pewny24CK9J", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in (trans.Event)\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "evqknFkMCmzn828rR", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-23 08:22:32"}
{"_id": "tt5Pn7zMusbAHMMHx", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some ss:State | e:Event | e->ss in s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4Rig4BqiCd72GB5Kf", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:26:03"}
{"_id": "e57tyEX748KbHAnZp", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CdcZekJirhLmfv8YR", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-14 00:09:12"}
{"_id": "McCRBJdWBv6bo2fHG", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\tall s:State, e:Event | lone s.trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qD5SsYeYT8vbpMJmg", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:09:11"}
{"_id": "r5THPBtZ5S5CPs6wM", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some Init <: trans.(Event.s)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "v6WkFo9MZxuWxAkWy", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 21:39:27"}
{"_id": "bdASSHTNf2gGh4ERw", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  \n  \n  \n State in Event. (Init.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LQHJST9EYKLhpMFD9", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 18:56:31"}
{"_id": "LcYSHBMQbgZfNDeCH", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in ^Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YXdw55uKK27ZFDEyi", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 03:19:21"}
{"_id": "r5GRChPE6wPZzgXEz", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State -> lone s.trans.Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^trans.Event = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "y9Poip8qbfosrhY8v", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:04:04"}
{"_id": "eEL6ddgZTGM6Qotaj", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | s.trans in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "27JYnT6faL3guYvTi", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-30 19:57:27"}
{"_id": "nNB6rwwdNYp6fAnm4", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 {all s:State | s in Init.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r :State | (r.trans).State = (s.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { all e: Event | some (trans.State).e\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WzbKHz3TphmwaQfPj", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-20 22:24:02"}
{"_id": "MXuxYFBdRND5B7Nif", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aXJpwX3kLejyQzkMj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 01:43:31"}
{"_id": "X38nLSSsBn727wTfk", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone (e.(s.trans))\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1, s2 : State , e : Event | (s1 in Init) implies (s2 in (s1.e.^trans)) \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "h8vgo6FF6Zsnk8sJo", "msg": "This cannot be a legal relational join where\nleft hand side is s1 (type = {this/State})\nright hand side is e (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:17:44"}
{"_id": "aXJpwX3kLejyQzkMj", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlone State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "goDJrqg28pgdLPxvR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 01:43:19"}
{"_id": "J9kkF6x8bLyBzWszs", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | some e : Event | lone (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  State.trans = Event->State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bbNwHEKfuot4Gd8Yn", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:23:09"}
{"_id": "PnZHcbxyDxz9cMNqn", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t all s : State | Event in s.(trans.Event)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "u3QNgMo3LQPfnCWx5", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-20 08:27:21"}
{"_id": "2v7LDZ55DN76XK243", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some x->Event implies some y->Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "d8eXEpakgffpuqMsf", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:00:28"}
{"_id": "XH2b63yvFSxG9tfRF", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "97aAZ5DTR5SoCNCEz", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 23:44:09"}
{"_id": "Wg6u7ZiojwqyBL6fj", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone s.e.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dgEDvcxFaPTip8A6Y", "msg": "This cannot be a legal relational join where\nleft hand side is s (type = {this/State})\nright hand side is e (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-12-30 17:23:53"}
{"_id": "ExSqsanBi58afnwaG", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NLJHaK6QRDXHmpQDw", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-21 11:53:29"}
{"_id": "roGvSpeEs6BZXWWL2", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 09:36:03"}
{"_id": "WZRtQCr5Np75coRff", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    all i : Init | i.^{s1, s2 : State | s1->Event->s2 in trans} = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "3SSLmtfiD2qytTFgK", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:35:34"}
{"_id": "9gejYBkav9tLKtQHL", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e.(State.trans)\n  \n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall r : (Init.^function) | lone Init in r.^function\n}", "derivationOf": "fwi3rB4eFmX7Tpk2y", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:21:26"}
{"_id": "cLRsR9jHtBinjK2rE", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s'=s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DMNNaauMTgc3BQyHE", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {PrimitiveBoolean}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 18:52:02"}
{"_id": "T9X33owwKZyWKBrZm", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State |  e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kvdXYdn5ifyCYg97K", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 03:44:15"}
{"_id": "QDH7jws3AkyLmjtYZ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n  all u : Init | State in (u.*{ x : State, y : State | some e : Event | x->e->y in trans}) + u\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iKKLCqW6hnH42DheJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:39:19"}
{"_id": "FtRbd7voLo2Cm8puo", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in k.~k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TQMqqAcjJGaM8aaPN", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 13:41:31"}
{"_id": "XGuNpKWtks5hb2a3Y", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State |some e: Event | s.trans implies lone trans.e->s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TqFP89Ga8usQTfegh", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 20:44:40"}
{"_id": "nJd9n4QPgQqrSFLbc", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone s.trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "f3DhJizKrWCuJnhEy", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-21 18:44:46"}
{"_id": "pRyMf6RYwzJwhWTbP", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4chD9fjQ7pqNTK82F", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 23:33:14"}
{"_id": "tnQemRP2LRh6pGmYz", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall e:Event,s1,s2:State |some e1:Event| s1->e->s2 in trans implies s2->e1->s1 in trans\n}", "derivationOf": "2siJTBziNkBxCzkcP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 21:14:01"}
{"_id": "42mKL9ao3GX7nyMmQ", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.~(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QRR4KXHeWqHLDCGcY", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 22:48:56"}
{"_id": "NPsf9Ra7APmFjrMHc", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.(*trans) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rLMvybYZPMGP5iLbd", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:16:26"}
{"_id": "GP5dKC7LR9RvNxG4k", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "q2Fi8uWEL8rK7QrzG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 18:10:34"}
{"_id": "idSe9haLrAJJfiQfW", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    iden in ^trans_bin . ^trans_bin\n}", "derivationOf": "QCbo6EntygkTTL7ho", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:47:51"}
{"_id": "aCipkR9izCF8wa25o", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 09:31:47"}
{"_id": "tntaShQEPPR5y5QXs", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  all i:Init |(State) in i.^adj\n\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HoBzqJpQGzSGdFvJo", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:03:10"}
{"_id": "PAdQsNnJKbBxa6oqE", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State , e:Event| lone e->State & s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.trans.^Event = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QXjSKFxxg2iCNAGn5", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 21:34:50"}
{"_id": "ukbYddWzhNiwNjok7", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cTHFxd5vpQB67pM5d", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:26:17"}
{"_id": "4f6pkkBz93wErqzKz", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, some i:Init | s in i->Event->s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nD4cPFePWg6HQzdfL", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:35:56"}
{"_id": "3Hpc75YM57AvdaABY", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet adj = { s1, s2 : State | some e : Event | s1->e->s2 in trans} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some (trans.State).e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "g6ZHJGvcT4JhXFzTF", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-3 11:18:17"}
{"_id": "5sga5ZkKpLaAei8hz", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event:>(trans.x) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "H3Yijp3hSbsruB2zx", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:51:23"}
{"_id": "4Rig4BqiCd72GB5Kf", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "onxDAdZTRGzPvHKHW", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-23 03:24:29"}
{"_id": "qwwyPBmkHaihh6z44", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | lone s.trans.Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "deZLxoDSF4beTYLE3", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:31:07"}
{"_id": "susmRdc25Dig9sQZZ", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KxCMRQ6mZ85RcTj9B", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:58:01"}
{"_id": "dBtuXpkocGzmb4Bzt", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | State.(s1.trans) = State.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "y7Zic98iTC6SvSvor", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:43:07"}
{"_id": "C8XxRJLpWacDESDH9", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init in ((^trans_bin).State + Init)\n}", "derivationOf": "7sQqrJ4NJ2m2c6tDc", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-24 09:24:00"}
{"_id": "jK8EW9rARxgWBPNEy", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in Init.^{x,y: State | some x.trans.y}\n}", "derivationOf": "XETykzj77LqJiFcc2", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 01:15:03"}
{"_id": "vRFDow3KQLe7dHLZe", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.transition\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RHThJFizX2Wbz8btE", "msg": "The name \"transition\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-9-12 09:47:57"}
{"_id": "iHoXdePvc2X8ZPpgN", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tsome Event.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "agz7ntiGEKCQ6oaXH", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:29:31"}
{"_id": "mdKTgvMZcJvkwL296", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { some State.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EesnDRRanh2YJnyTs", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-9 17:21:25"}
{"_id": "vPWSBzt9QcxW4NhS5", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { s2, s1 : State | some e : Event | s1->e->s2 in trans } | State in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "QAA23dygEJs3zdtkq", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:16:09"}
{"_id": "vrwWtFvGh6X98Bpj9", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some (x->Event->State)\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SFMA3Y9eEk9uDFnSQ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:53:45"}
{"_id": "CPHAaSphpCKxg7pQe", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, e : Event| State in e.^(s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GbNd2MQePbZteZrn7", "msg": "^ s . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 18:50:40"}
{"_id": "nehDBDdmw4snfNxyy", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.*adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : Init.^adj | Init in s.^adj \n}", "derivationOf": "QkA336hreXuFck3Tq", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:16:36"}
{"_id": "dGsFy6iNyzgHkjo3x", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n   State->State in ~(State.trans).(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "ZRdpwj3jr8QEQLps9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:21:52"}
{"_id": "MhyhjHfPNeAkWqDHf", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | s1->Event->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i : Init, s : State | s in i.*tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TzXKYAJNZBeJ3gPqp", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 15:54:45"}
{"_id": "rTaEbi26ctYSRfEjY", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State|e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9RatmxnN4c225bnHD", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 14:16:05"}
{"_id": "TRrebTpmxk7SZ2MGR", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | State.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4axg4fMSFThdqGgrg", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 03:26:09"}
{"_id": "Ww7YMdockbgS4i5cd", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GWS6enDDxMrkGwQzv", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:06:38"}
{"_id": "tbymttEjfs3x9Wbej", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tiden in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "idvLimzm3KhNpL9ZA", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {univ->univ}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:42:01"}
{"_id": "XnWWCFSEzd2uYufma", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dbYuQyes9TReXLWkG", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-20 22:12:00"}
{"_id": "qieM9ZiTCknHGNyLP", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tno trans[Event]\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ii7RTEFCT5tR4vk9g", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-2 17:56:00"}
{"_id": "ybFsfMpkCb42SmWDf", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n\t\n}\n\n/*\nAll the states have the same events available.\n*/ \npred inv5 {\n\tall disj s1,s2 :State |  no ((s1.trans).State) -((s2.trans).State) and no ((s2.trans).State) - ((s1.trans).State)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n\tall s:State | some trans.s implies ^((s.trans).Event) :> Init\n}", "derivationOf": "gnAjh2k39bxuyDxk6", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:10:42"}
{"_id": "b743RYiXMhwbSYLCY", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MXuxYFBdRND5B7Nif", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-20 01:43:52"}
{"_id": "QCbo6EntygkTTL7ho", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    all s : State | s in (Init.^trans_bin) implies Init in s.^trans_bin\n}", "derivationOf": "NfNXXH7cNTfCBmms4", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:47:22"}
{"_id": "7pjeb2dDXQKi55eo9", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t some e:Event| State in e.^(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "muQEim5SLGm9kjPrm", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 14:58:03"}
{"_id": "pQWSMx9BKYeFCwsMD", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 21:28:43"}
{"_id": "MeMdWzfbjwbC4xDCW", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NBwBk8HFczHFGDo2F", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-12 20:52:44"}
{"_id": "oAgetGXYY9PTegcRs", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State |one e: Event : lone e->s in trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vfrEPqSHqChSY7ANc", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 20:41:53"}
{"_id": "uAFtPrdHn7TQqSMeE", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  all x : Event | some (*(~(trans.x))).Init\n}", "derivationOf": "ezvKLrG8QBitskcHR", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:27:43"}
{"_id": "mfyALXrLqpemRWWp5", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | (s.trans).^State = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6Xe2kwLy3zskPNwun", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 12:12:43"}
{"_id": "qiYY3by7aXead4ucM", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    all i : Init | i.(^{s1, s2 : State | s1->Event->s2 in trans}) in State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "Ahz7CZtJNR5Gg5isY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:39:06"}
{"_id": "gGAiTiTaLkobdHaxf", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s:State | Event->(s.trans)\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HXCj9dMT4GefLcKW7", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:09:57"}
{"_id": "WSXrJubcgpJ7fhXgi", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.(^onlyStates)\n}\n\nfun onlyStates : set State -> State {\n  { s1,s2: State | some e: Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "xQjkE9GxLKccW9FiQ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:17:34"}
{"_id": "BbKwjkMeRBGHFBNQt", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "f52Dm6MKsZuDZK8tk", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-9-12 09:48:16"}
{"_id": "kCtTEme6H9tKh3rHg", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, all e:Event | lone s.trans.Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AELg8FmBdc7FFGv8e", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 12:05:16"}
{"_id": "L3qh8WLEtmBQaMH2d", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | all e->ns : s.trans | no s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | one s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AD8rxjeuoHocosk8W", "msg": "The \"all x\" construct is no longer supported. If you know the range of possible values of x, consider rewriting it as \"x == set_of_all_possible_values\".", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 09:36:50"}
{"_id": "RwpJwZbHTcoiQdTK7", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  some Init and all i:Init|  no ((State-Init)  - (Event.^(i.trans)) )\n  \n  \n  \n  \n \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bdASSHTNf2gGh4ERw", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 18:59:25"}
{"_id": "RkKikr4CH75HAfbpH", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2Z5Pjjr85gPcTvHkY", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": [{"parent": "State", "type": "this/Init:State"}]}, "nodePositions": {"State": {"x": 131.5, "y": 199}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2020-2-18 15:58:55"}
{"_id": "wfveNbfx9vCGLD5ME", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zfcWYmYAmQCaRG2No", "msg": "The name \"event\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:48:34"}
{"_id": "N4d24oogpwsZDnm4G", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some Event.(s.trans)\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ceeECS3b9haYpaoam", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:27:30"}
{"_id": "pujR3tfLBTrWe4iJH", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  all i:Init | some Init implies (State) in i.*adj\n\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nDCcKRpAifpafFeEb", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:05:26"}
{"_id": "KzDHvwr4huw4irbQZ", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\ttrans in State.trans -> State.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BYyrTAzgKjRFMn949", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event->this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:21:34"}
{"_id": "8D8yauxy7QgYFajww", "cmd_c": false, "cmd_i": 0, "cmd_n": "run$1", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n    trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    all s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n    \n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all s: State, e: Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let ts = { s1, s2: State | some e:Event | s1->e->s2 in trans } |\n        all s: State | some i: Init | s in i.^ts\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s1, s2: State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    all e: Event | some s: State | e in s.trans.State\n    \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let ts = { s1, s2: State | some e:Event | s1->e->s2 in trans } |\n        some i: Init | all s: State | i in s.^ts\n}\n\nrun  {}", "derivationOf": "yxzkG9P9pWXbhtKAf", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-11 15:51:50"}
{"_id": "sAw6obAHu2rwDbqdo", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n  all x : Init | (x.trans) in Event one -> one State \n}", "derivationOf": "onBsX5XZMCx6TMFtQ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:09:51"}
{"_id": "tinMdG2o36bYP7G4v", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some (Init <: trans).s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "C4Bwr8CANGtxv6aPi", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:12:16"}
{"_id": "mMKtaLiCv7TmWAxax", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  some Init.^trans\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "urMks6Thoqb8Eu4y6", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 21:05:36"}
{"_id": "Seu5zaTTCK4TTMB7w", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "uKXZk8tarQGbge2nN", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:50:14"}
{"_id": "zawPfEu7NN6j4T8sn", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | iden in ~s.s\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pGnGWAN3WANKrdj3n", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 09:15:20"}
{"_id": "5ze9nmhKFoEheSC3n", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    all i : Init, s : State | s in i.(^{s1, s2 : State | s1->Event->s2 in trans})\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "rBX5QCD3WPBBLfokZ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:37:20"}
{"_id": "JcSM6n6TKz7cfJzAB", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | State in s->Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "HvoET4qZxyr2rRGKT", "msg": "The name \"s\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-23 08:19:14"}
{"_id": "66jCTsPL7ZByyimvS", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "5TaKtAEM4aqQpqfDe", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:56:10"}
{"_id": "agz7ntiGEKCQ6oaXH", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | s in Init.*(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "We67v3acFZ5Ap9H45", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:28:35"}
{"_id": "72MXomtJWXxxnT25v", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s:State, e:Event | trans.e lone ->  s.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4rsgCxnPnqRPX8mH5", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-15 16:30:49"}
{"_id": "5MoBgdao3Qxf9fDRS", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  all  s : (State - Init)  | some e:Event |  some ( Init & trans^.(e->s) \n  \n  \n  \n \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TpKNqjFvaYFD6oRdi", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 19:06:48"}
{"_id": "wY83dTpfaszTpWWzX", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CZKo29Q4vTxkMCzBv", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 20:14:41"}
{"_id": "iDYW3BBvXk3vycWxX", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, disj e, e1 : Event | s->e in trans.State and s->e1 in trans.State => e = e1\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | s.trans.State in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HcayhfyPNGg32ywjT", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 02:56:34"}
{"_id": "96oexFkHy36mRm3mT", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sJiHzjbBbDW332RSR", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-16 21:45:17"}
{"_id": "HBkpCfW4RgPDfgCZk", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in ^{x,y: State | some x.trans.y}.s\n}", "derivationOf": "jetgMQeqiH98fgzG8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 01:14:10"}
{"_id": "s7MLnLgbKuYxYZQkQ", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n \n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n\npred inv6 {\n\tsome s:State | all e:Event | some  trans.(e->s)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "3AbKxKS5BMDFr77ez", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 09:24:29"}
{"_id": "ECNt7XFoXYz82Zbbg", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone s:State | s in Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1, s2:State, e:Event | s1->e->s1 in trans implies ~e\n}", "derivationOf": "p6iMKP68LN2WpDobA", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 00:33:03"}
{"_id": "sv7P2CyD5MKbLn9Re", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all x : State, y : Init, z : Event | trans in y one -> one z one -> one x and z != y\n}", "derivationOf": "rZmg9ngXnRkbTJvi8", "msg": "== is redundant, because the left and right expressions are always disjoint.\nLeft type = {this/Event}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:27:12"}
{"_id": "dv5Sa8eLPBtJwFSP4", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init <: trans | State in ^(Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "ipt7eDrHw5972WE3r", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:46:35"}
{"_id": "or7fxyPczmi3czmjz", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "bvcvCMDGBsjSKLMwJ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:23:33"}
{"_id": "o7BX34uR9hgqTbJKL", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  ~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "kffYWtm5CaNFtakW9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:25:27"}
{"_id": "tW8WZsihiMjQMsj2i", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | some e : Event | s1->e->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.^tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e : Event | some s : State | some s.trans[e]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : Init.^tr | Init in s.^tr\n}", "derivationOf": "wDL78Ymv4k5dqLSr6", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 16:16:26"}
{"_id": "dAT2awTxH8aqJ3GF7", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  lone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | some e : Event | lone (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  trans:>State = Event<:trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "There are 28 possible tokens that can appear here:\n( * @ Int NAME NUMBER STRING String Time ^ all disj fun iden int let lone no none one pred seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:21:37"}
{"_id": "HcQMzGjguz6tHpmmQ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "JSaKgHrd93ibnYCZn", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 03:00:58"}
{"_id": "NkxoyHwS2psgNjPQ2", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans} |\n  all u : State | some Init in u.(^t)\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RAiMDqxFkyWGXwKkw", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:46:14"}
{"_id": "fhdBnuf8YSxSXsg5M", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s:State, e:Event | lone s.trans.e\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3RyrmaC4cdnS4ZS6p", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-15 16:19:46"}
{"_id": "NTgGb4y5XHZo5APcm", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState.trans in Init.*trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ypKHbYbhgYui7FyEh", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 21:53:49"}
{"_id": "pTGEJPBCGa9B6D8ek", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n  \tall s:State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \t\n  \tEvent = State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wjdBFcKSqcJDsuwnA", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:27:32"}
{"_id": "TDgt2EvcHhy7Cv89b", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4xn4BaJnvdygS5vcW", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-11 00:52:04"}
{"_id": "qvcPsduJyHvsNwHe8", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event.(x.trans) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TrhJp7ptX94BvsRpW", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:46:52"}
{"_id": "e5ZGCmBpkPbYR26KY", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans}\n}\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vqmv9w6TeCWCbktcJ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 10:34:50"}
{"_id": "GMJrCLGpbpwsYMyZy", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some i:Init | s in trans.i\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JpuLDi3m79Lpk2bSW", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:33:37"}
{"_id": "GFvz7iiQaMBikNEFr", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ujEgv72Gy2w84WXh6", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:30:34"}
{"_id": "jetgMQeqiH98fgzG8", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    State = trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t{state: State, event: Event | some event.(state.trans)}.~{state: State, event: Event | some event.(state.trans)} = univ->univ\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dC4xaQ84yQeBMaHWM", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 00:58:28"}
{"_id": "8MCP7xeqJNcfXf4qd", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.trans :> State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qXAsnmzk5x3E7hyuB", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 21:09:36"}
{"_id": "4omCSPSuJgy6AmPzj", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  Init in Event.^(Init.trans)\n}", "derivationOf": "XPyhBFSgutNnFKT8C", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 18:05:35"}
{"_id": "tpYSWJWygfKZcqhZP", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n trans.State.Event = State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n\n   all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n\nState in Event.(*(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  \n \n all x : State | x.trans in State.trans\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n\nEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n\nsome (Event.(State.trans))\n\n}", "derivationOf": "BfJdZb3pxkqst6wK8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-6-10 10:31:29"}
{"_id": "gXWvGbHufkzDwqdPz", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | Init in ^{x,y: State | some x.trans.y}.s\n}", "derivationOf": "StCSjPhZaP8k9PjmP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:44:00"}
{"_id": "q35xd75MsCe7T98QE", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.trans\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {for all i : Initial | trans.Initial\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Y9BXXoNjsw4JZ9QPG", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 21:34:06"}
{"_id": "FtJ5i3PJJNHJkto3k", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8Mg2ZnEtrEeF8m3my", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:43:43"}
{"_id": "cXtHv4oecPLYKFdKq", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    no State.trans2\n}", "derivationOf": "aW2ePoPconevuPg6K", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:54:42"}
{"_id": "iYBbdsRwqzkxkApAH", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : Event | State in y.^(x.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zGiQikcYNNMy6Mavm", "msg": "^ x . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:02:48"}
{"_id": "QZwb7hPHNu8ear5F4", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : State | State in Event.*(x.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Bcca54qoM79L8S7r8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:06:33"}
{"_id": "asNidowAafY5ALgNR", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  {s1, s2: State | s1->Event->s2 in trans}\n}\n\n\npred inv4 {\n\tall s: State | Init^.function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cwKtvigZxa6RjsX2N", "msg": "There are 25 possible tokens that can appear here:\n( * @ Int NAME NUMBER STRING String Time ^ all fun iden let lone no none one seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:56:32"}
{"_id": "y58Zuaf5qna7WdP7K", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:(State-Init) | s in Init.(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TSskvLKzjsDWJFopF", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:53:15"}
{"_id": "Zob4cAH94t6e5oCdt", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | Init.trans in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9Seh4nB8oN8TxwtMH", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-30 18:47:27"}
{"_id": "itmpFrC2gZ7cickNa", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some trans.s \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NW6fDDSoTwJE7BDHx", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:06:21"}
{"_id": "P9CkpYDWJhNzAauMx", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  all x : State | some Init.(*(~(x.trans)))\n}", "derivationOf": "WmoLLJtzBKpK3DNiG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:29:28"}
{"_id": "K2ZN8ryhAvhBSQM2Y", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | s in Init && State in ^(s->Event.(n.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "QACtwTRjFmYgv9wmr", "msg": "The name \"n\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 15:08:28"}
{"_id": "D6a3Amz3rT9jHxTNk", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : Init.*adj | Init in s.*adj \n}", "derivationOf": "SB7Jtern7C2T8Qfhm", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:31:23"}
{"_id": "7ec9HzauAh7aNMFhx", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj={x,y:State | some e:Event |x->e->y in trans}\n  \n  all i:Init |(State-Init) in i.^adj\n \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XEuu6HgZQqJvEFQMe", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:00:09"}
{"_id": "7dQmwkvta8YHe5SiH", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all e : Event | lone trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "yF7cQPYCXtD5JRMWP", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:16:30"}
{"_id": "CQfDerzdZbuS2fNG6", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vDDicDwQ4SNgA4gQH", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 13:57:01"}
{"_id": "BxCZPno6JNEBKgzgE", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.~(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:57:35"}
{"_id": "yMyPagxzy8mLNJztk", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = ^(Init.trans).State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "MowBjTPyGN6MwwkX2", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 02:46:41"}
{"_id": "xKFMeXw7bznfv2rfC", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init | s in i.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KGZw2HY8eaK4qJGbP", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:49:29"}
{"_id": "rz24azpKBBbeZDmcD", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State, e: Event | lone e.(s.trans)\n  \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\npred inv4 { all s : State | some i: Init | s in i.^adj \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r:State | (s.trans).State = (r.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { \nall e: Event | some s: State| e in (s.trans).State \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { all s: Init.*adj | some s.*adj & Init\n\n}", "derivationOf": "5rpfiHHbcP5vPgr3r", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-18 12:18:01"}
{"_id": "chqEPQBmHH6QFjqbP", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dBtuXpkocGzmb4Bzt", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-25 20:43:27"}
{"_id": "FEsupZBc2gQdN5BCK", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3ifH4Cvnj876xK8Bk", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 14:26:11"}
{"_id": "WZzgojj8mv7otPyr3", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in Init.^{x,y: State | some x.trans.y}\n}", "derivationOf": "Q9NLsdAgM3CTivtRq", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 01:14:59"}
{"_id": "fcS536EScYk8D6vML", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State, e : Event | x->e->y in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7wbc2NJygPsFRfgek", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:42:10"}
{"_id": "eKYfXRbnahMyg6QMh", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "3LWt2xJ3LKt9Y3Jh5", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:31:28"}
{"_id": "AjjATR6nvRjNF2dmn", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in Event.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BihKWymDqmdAdEbg8", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is this/State (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-20 08:25:19"}
{"_id": "v7Etx632DLGyoQCQS", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "f9kAqGC4jNZDXccj6", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:02:01"}
{"_id": "suaTkr9sbQmsMoi5p", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y, z : State | some e : Event | x->e->y in trans implies y->e->x in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LQcoNFGKmwTJr88ja", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:40:28"}
{"_id": "ngzdhGHgKceDydZgY", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JyqDJnKJudEpTXcYC", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-8 21:30:18"}
{"_id": "jumvivq2S8p8KcvJC", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s,s1:State,e:Event | s->e->s1 in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4BbCktBjSoF6HxXkj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 21:09:01"}
{"_id": "hWwdmmYuzoGwq7Grf", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { one State -> lone Event\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JS3FXgmmmKmmzi7ii", "msg": "Multiplicity expression not allowed here.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-17 21:22:30"}
{"_id": "QngQF7aFXxMdRKine", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "N4d24oogpwsZDnm4G", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:27:41"}
{"_id": "87Fmw9xecQ8Wz4ZQE", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "oz8ep7PsAPZn5hWKr", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-10 18:50:31"}
{"_id": "Wwa6ki7swP6fnmxyD", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\nfun onlyStates : set (State->State) {\n\t{ aux : Event.(Init.trans) | Init -> aux }\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mNSqzvEnggFxY593Y", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 01:05:05"}
{"_id": "gdvyTNcDaqNwSwiE6", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone s.trans <: e \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4YzQcEiT8KAjr9t9j", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:11:51"}
{"_id": "5Kv5uuavFAHnmFZ7F", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans = State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "Bu82Pgc35pvT2sPHW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:18:01"}
{"_id": "roA7Fnf7mRMFdREP9", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : State | State in Event.*(x.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QZwb7hPHNu8ear5F4", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:06:53"}
{"_id": "iwtCkJHryc85mcxph", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s1 : State | some s2 : State | s1 -> s2 in trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Z6TK8Sn8uHDiJLrpX", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-19 15:43:22"}
{"_id": "yrweq5Y6WAWduoH7S", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans} |\n  all u : Init | State in u.^t\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dWv2yab2Ae5SAAkmx", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:44:03"}
{"_id": "igaKZbMxNrNYhNu4L", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s,s1:State|  no( s.trans  - s1.trans )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TcNyLt2oytzcYt25Y", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 18:36:41"}
{"_id": "iWGj6LdYp8kqZhG4G", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e->State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "ZXRwzwi7J4peuiPz8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 21:52:26"}
{"_id": "HcayhfyPNGg32ywjT", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, disj e, e1 : Event | s->e in trans.State and s->e1 in trans.State => e = e1\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | s in Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yARNH7ZvXdDEaZjTi", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 02:54:57"}
{"_id": "ERkuQ8NwH7DLurhmd", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\nfun onlyStates : set (State->State) {\n\t{ s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t(all s : State.^onlyStates | Init in s.^onlyStates)\n}", "derivationOf": "EQZFfH3QATYbbJqWX", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 01:18:46"}
{"_id": "ed3JdhyytSauaGsK4", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | e.(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "D5FjfX7gBgzfTW54Z", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-14 09:20:15"}
{"_id": "nD4cPFePWg6HQzdfL", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in s->Event->s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nHm8km3jgCEHyLwjy", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:35:36"}
{"_id": "xmaMNDzpQsFjfsm7B", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | Init in ~(^s.trans)\n}", "derivationOf": "sjHobfkSEDrgrRp7p", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:29:19"}
{"_id": "qo3DTD56zyBXdQzKk", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State, e: Event | lone e.(s.trans)\n  \n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\npred inv4 { all s : State | some i: Init | s in i.^adj \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r:State | (s.trans).State = (r.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6R9kM54GsaoCirmgQ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-18 12:09:47"}
{"_id": "FF2aexP6YCNocbkmi", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some x->Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xLcf4DFczgnGdJaNk", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:57:29"}
{"_id": "CamdFvkFjZBA8yD6q", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-4-3 13:18:13"}
{"_id": "DKpDz4ZvhE4enyp5n", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State| some i:Init | i->Event->s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pj56EceCvNwZnjgrJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:36:31"}
{"_id": "a7rPte2P3M9D5ktyM", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s,s1:State,e:Event|some s2,s3:State | s->e->s2 in trans implies s1->e->s3 in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jumvivq2S8p8KcvJC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 21:10:25"}
{"_id": "sdCz3dJkPaiDKGT2H", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cpc43bLCgdAERtz8S", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:28:32"}
{"_id": "qD5SsYeYT8vbpMJmg", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone s.trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7MKTZ9fNcS6HrQuoM", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:09:03"}
{"_id": "CZKo29Q4vTxkMCzBv", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "oEdTotozGZENZ9M2s", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 20:14:08"}
{"_id": "7Ybo9s8KYRmezQJYQ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.*adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : Init.^adj | Init in s.^adj \n}", "derivationOf": "nehDBDdmw4snfNxyy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:30:04"}
{"_id": "Y482K6CNJAWZHPndu", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LcYSHBMQbgZfNDeCH", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 03:20:12"}
{"_id": "ncJEondTzX6NKfcrL", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | some e.(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "MDkhLPJABbMqHcxFX", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 11:55:57"}
{"_id": "qn37NybvWcdreatPF", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tState in Init.^rel\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2: State | s1.trans.State = s2.trans.State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  \tall e: Event | some s: State | e in s.trans.State\n\n}\n\n\npred reachable[from, to: State] {\n   \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tto in from.^rel\n}\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all to: State | reachable[Init, to] => reachable[to, Init]\n\t\n}", "derivationOf": "P2RwTjX9gDia5xbsG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-9-12 10:04:44"}
{"_id": "nkNWZojAieuc6bcXv", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-4-16 00:57:14"}
{"_id": "DkpxirR9To8HBNX4w", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9XvJToxeeBugsZMu4", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-12-30 17:24:46"}
{"_id": "FcX5aDeerYaDTgu4d", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "k4Xagp49HtMuMWsRx", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:35:39"}
{"_id": "6EPZsmH33Z3teYzBb", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tlet s = State <: trans.Event | s.~s in iden \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "k7YEyvHnfkiYoYZRw", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:16:48"}
{"_id": "NfNXXH7cNTfCBmms4", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init in Init.*trans_bin.*trans_bin\n}", "derivationOf": "RKBFgmGx5HunWecjR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:45:51"}
{"_id": "4D7mRnuBP8zPGGZBP", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YAve6RgCTq6jT7Twc", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-9 03:23:37"}
{"_id": "cgucDDLKnhkYGt6GK", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.*(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "87b4jTDNAhgKuZkJ2", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:25:52"}
{"_id": "9vmkYGbrmudbgRx3B", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n   some (Init.^adj) implies lone ( (Init.^adj).^adj & Init )\n  \n\t\n}", "derivationOf": "NjsjAiSt7EAywCLSu", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 16:35:18"}
{"_id": "cu4Y7rZLzakCpg6yn", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans  \n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "sdCz3dJkPaiDKGT2H", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-23 03:29:01"}
{"_id": "PuvvgmjxmAwkL2AWg", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rcfr9eSt72w5utfd3", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 14:22:43"}
{"_id": "kjo6uXwNJcEPqqLok", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:22:03"}
{"_id": "gedphdX5bD4ZQjY3y", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tlet s = State <: Event.trans | s.~s in iden \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6EPZsmH33Z3teYzBb", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:16:58"}
{"_id": "KEzSfqwERRy8HFDCs", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4Q28hGwMx2nuPJXN8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 19:07:42"}
{"_id": "q4rzHC7g87RWpqpf4", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\nall s: State | all e : Event | lone n: State | e->n in s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\nall s1, s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CJ9jGwbAceSzAaHp5", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-7 21:37:59"}
{"_id": "ctjtkp2HXC9LvbXwG", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | one Intit\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DbGMCrmHREz55LZGS", "msg": "The name \"Intit\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-12 20:52:09"}
{"_id": "QCf9fKofawNvrJd8Q", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some s.(Init<:trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QC3YjHvkf4uGbXkiC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:10:51"}
{"_id": "ikkc9r8vgeRHPFSww", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tState in Init.*rel\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NsMCfLB8kmYGZobit", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-9-12 10:01:17"}
{"_id": "KZRpBcygnZmZNBu4c", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State , e:Event| lone e->State & s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, s1:State | s.trans.State = s1.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Mv7MoQSo2STeZSW8D", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-8 21:38:30"}
{"_id": "ZJMrB2EwX2oqJ2qQX", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "Zqtjy4sLvYhSspzBA", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 19:04:22"}
{"_id": "XqtySiyoxYtTbeMQJ", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-6-30 14:47:47"}
{"_id": "AksJv3fyZ6ynXAAxY", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall s:State,e:Event | lone s.trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3nu4iQ2jvgt5WizL5", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 19:03:21"}
{"_id": "d27Rf3x8bch7Bnfcs", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans = State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "3e4r4zYQc8wnB2Lwn", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:16:55"}
{"_id": "RWzR2xynGT7Qjv42g", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in s.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dWGYBauPffkpuq49i", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-21 12:22:25"}
{"_id": "gc6jZkEguJkg8Dejj", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone State.Trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "The name \"Trans\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-20 01:04:43"}
{"_id": "9oFtSC8vQDhgMQL8B", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s: State.trans.Event | s.^{y,x: State | some e : Event | x->e->y in trans} = Init\n} \n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6upMQnkPWKZHhBWZG", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:10:20"}
{"_id": "rJgkLMfheB29Kbbix", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "susmRdc25Dig9sQZZ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:58:04"}
{"_id": "sXYMhtcjahwgLgNuQ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tsome Event.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GrBjYYqZR685mN5i5", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:21:42"}
{"_id": "TSskvLKzjsDWJFopF", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:(State-Init) | s in Event.(Init.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kTkdnrWg2nmjftKC5", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:52:33"}
{"_id": "Sx4jX3NL34KQL3Nro", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | s in Init.^(trans.State)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "phHMyFjzPwxutCQ6d", "msg": "^ (this/State <: trans) . this/State is redundant since its domain and range are disjoint: {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 03:43:39"}
{"_id": "Tvsj7EwBmtDydpwmD", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | e->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s1, s2: State | all e: Event |some n: State| e->n in s1.trans and e->n in s2.trans implies e=e\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "jgJ2n7ioYpmcCvypc", "msg": "== is redundant, because the left and right expressions always have the same value.\nLeft type = {this/Event}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 21:38:51"}
{"_id": "tWC2BZ3f9CteWGQny", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.(^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ShodfFhCBbAKdE65Y", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 23:37:44"}
{"_id": "jx68W5SvdNmrygoZu", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlet k = trans.State | ~k.k in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NrSyhqXwScZxHnCF4", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:00:01"}
{"_id": "ECdAMiL2GiXGvzFWg", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.^(State.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "eyMWpGnirT9tj454H", "msg": "^ this/State . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 03:47:05"}
{"_id": "BTNfdDXT83e64TPak", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.*adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : Init.*adj | Init in s.*adj\n}", "derivationOf": "NovJMBPhYX8LtvDMj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:11:50"}
{"_id": "Ppj8zjBDjARaD8Kwh", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:29:46"}
{"_id": "M3Bahvmg6DLLEj2Bc", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\talways (all s: State | some s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\talways (all s: State, e: Event | lone s.trans.e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZwvGcfxJb9dyzdH6j", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 20:04:09"}
{"_id": "xLcf4DFczgnGdJaNk", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State, e : Event | some x->e\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2TDHcXTHqoegbXPaA", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:57:06"}
{"_id": "u5o934mLeahPYZmcZ", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WXynMgoRBQNyNbsQm", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-2 17:58:00"}
{"_id": "aosXYxKyvrNnFCnKA", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | some Event(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "66jCTsPL7ZByyimvS", "msg": "The name \"s\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 11:54:33"}
{"_id": "dykZPYxv5XdBD4598", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | iden in ~s.Event.s\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zawPfEu7NN6j4T8sn", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 09:15:28"}
{"_id": "Xf6R8NQhRNbtYhHg2", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5PPFtuXsAnKFupAky", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 17:07:21"}
{"_id": "iNtXq44Tpygv2L6SM", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State,\n  \t\tsucc : set State\n}\nsig Init in State {}\nsig Event {}\n\npred x {\n\tall s1,s2:State | s1->s2 in succ iff some y:Event | s1->y->s2 in trans\n}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\nfact {\n  x\n  }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t (all s:State | some i:Init | s in i.^succ)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ovTX4ufwtvcQPdvWY", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-8 16:05:52"}
{"_id": "MsdH2RKL6FKubYhGp", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x->Event->State in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cXzPJQNGduxpaeYoy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:43:52"}
{"_id": "ZacSbwjae5ThrcvEm", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.{s1 : State, s2 : State | some e : Event | s1->e->s2 in trans} = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "JoeYhRJPKxQT24eo7", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:42:03"}
{"_id": "Hsyd6ASi7hsfeknYq", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | some (s.trans).e\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "nrHstFNwcYE3Bb2R9", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 11:55:33"}
{"_id": "mksY4rSDaDfGQLWoS", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State |  e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "T9X33owwKZyWKBrZm", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 03:44:47"}
{"_id": "Pgp6BuenPmRSNXJ3L", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | s.(State.~trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HJeWuR2nSeSBmvwNh", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 22:04:09"}
{"_id": "JrqrkDz5brK2HT7Ls", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in ^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "H7cDhA4kzdWrZZWfM", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 23:48:30"}
{"_id": "k4KPmYufukRhHsCyL", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    (Init.*{s1, s2 : State | s1->Event->s2 in trans}) = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "uj3fXkwCJoybhxQWY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:34:14"}
{"_id": "Fgc7uqSprE48smf72", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, all y : Event | State in *(x.trans).y\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bdripsgPjmbjQLGLe", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:25:25"}
{"_id": "d7RehKuXGN55FjTdX", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-30 14:48:20"}
{"_id": "NYhvXmiPRCs7iN5FQ", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  Init.^adj & adj^.Init\n  \n\t\n}", "derivationOf": "DKyGgEruKNwGWGEXc", "msg": "There are 25 possible tokens that can appear here:\n( * @ Int NAME NUMBER STRING String Time ^ all fun iden let lone no none one seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 10:47:41"}
{"_id": "uK6HuNz9FBovWKWDz", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some e : Event | x->Event->y in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xhJvMEg5SvMxGF4eR", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:41:14"}
{"_id": "YAve6RgCTq6jT7Twc", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tlone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "x3SAdosJ8yfhq6Fdw", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-9 03:23:19"}
{"_id": "d75QkQERzu6hHAhBp", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5PvAi9GJRhRxXCdK9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 21:29:34"}
{"_id": "CRqTqyw6sJjTxxBv7", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event |some s:State | lone e.s.trans in State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KZjRQ6mMgRJTsCNAs", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 14:19:08"}
{"_id": "Y4vt3252tCD3XXTMD", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some x->Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "z4yXQ3QY5trHThzqu", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:02:34"}
{"_id": "enorfAfA8swr4xtoS", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\talways some State.trans.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 19:57:50"}
{"_id": "onBsX5XZMCx6TMFtQ", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n  all x : Init | (x.trans) in Event one -> one State\n}", "derivationOf": "nCz92eiGjW82MYcE5", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 11:55:03"}
{"_id": "QjysAxXLP9AZomQBA", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall x : State, y : Event | lone y.(x.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nGWZ5w6oK9zDtFACy", "msg": "This name is ambiguous due to multiple matches:\npred this/inv3\npred this/inv3", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 09:59:18"}
{"_id": "6AKnhaGwc7nLsn3KE", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n    trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    all s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n    \n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all s: State, e: Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let ts = { s1, s2: State | some e:Event | s1->e->s2 in trans } |\n        all s: State | some i: Init | s in i.^ts\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s1, s2: State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    all e: Event | some s: State | e in s.trans.State\n    \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let ts = { s1, s2: State | some e:Event | s1->e->s2 in trans } |\n        some i: Init | all s: State | i in s.^ts\n}\n\nrun inv7 {}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-11 15:51:37"}
{"_id": "BihKWymDqmdAdEbg8", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in State.Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "uuzLqqDiEWLLD58X9", "msg": "This cannot be a legal relational join where\nleft hand side is this/State (type = {this/State})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-20 08:25:09"}
{"_id": "yJ35qDzYda5DHsDwz", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tsome ^t implies some Init.(^t)\n}", "derivationOf": "MESMzrZzfeEvZQ2sW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 07:37:53"}
{"_id": "Rh4nHoorD8T4dfXsa", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone s.trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kCtTEme6H9tKh3rHg", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:05:27"}
{"_id": "uaT8D6bR4cggT63hk", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | State in x:>Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "fon5PLvTmiwZeAFxM", "msg": ":> is irrelevant because the result is always empty.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:19:51"}
{"_id": "k4Xagp49HtMuMWsRx", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "DAntKePWHhK5kESLn", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:35:36"}
{"_id": "yTeG2tnQkYuXDgGB9", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RC944SzogggsJ2pYg", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 21:59:18"}
{"_id": "CuMWt53xsaKg7nAbx", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\nall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-4-21 20:46:14"}
{"_id": "tXbchyKWwdSNoCzRF", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ma5K3aabGaiBL9m4M", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 21:47:46"}
{"_id": "mgkT3Nb8Ay2Jq6jiD", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event | \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iJL2pbwwLYNbCfn6h", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 02:47:32"}
{"_id": "XYdH6GRzzBpuZD2YK", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    iden in *trans_bin . *trans_bin\n}", "derivationOf": "idSe9haLrAJJfiQfW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:47:59"}
{"_id": "4HWond3ZM2t5gL7ri", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | one e.(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RKj6vZuQPs9QMpYJp", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:29:30"}
{"_id": "k4NLwWpmp9YNpJmoc", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State|some e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rTaEbi26ctYSRfEjY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:16:15"}
{"_id": "AQ3r8uQYPdSit8g3S", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some Init <: (trans.Event.s)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "r5THPBtZ5S5CPs6wM", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 21:39:42"}
{"_id": "Zh5trwKdnKiMunjBy", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some s.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "vhKgTKA8yZFfNSSTF", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:35:04"}
{"_id": "8qmskt9fcmStreH3h", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in ^(Event.(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "S5DEudAP4HFSyfNk5", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-23 03:44:37"}
{"_id": "RvqjfMeQr4dmPmB4M", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init in State.^trans_bin\n}", "derivationOf": "QqkkC8g7qaTcjxEem", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:51:32"}
{"_id": "X6rkQ3ci5Sr4hn9Hc", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t \n}", "derivationOf": "CufQz2XfWvfa6p2QP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 11:54:57"}
{"_id": "mvopyqSzF56RxoRKQ", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State | (s in Init.(^onlyStates)) implies (Init in s.(^onlyStates))\n}", "derivationOf": "d8QFG2oyBXtvjiP9m", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:30:14"}
{"_id": "pmsdD3wnE87su5rCZ", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tState in Init.^rel\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kwC7ms5JiibiisQM5", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-9-12 10:02:04"}
{"_id": "2TDHcXTHqoegbXPaA", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State, e : Event | some x->Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4qZ257YoWcNx2aWuu", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:56:52"}
{"_id": "RpeePbrvZeeLsojsN", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in {x:State | some ^(Init.trans).x}\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WQ86ww2iFq3BEc3Bv", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:53:36"}
{"_id": "GJmbx5xdXw5zQe8cw", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init |  some (i.^trans :> s )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "b7Mbs9drd4zWFmqXC", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:52:15"}
{"_id": "oSc4BAAP3M9wRksmg", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TDgt2EvcHhy7Cv89b", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-11 01:03:50"}
{"_id": "LhNmScJLrfwHBHmiZ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JwuFWq7wFfzEFKcfh", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-30 19:38:05"}
{"_id": "2ibu8XqNNtnSeQcew", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is this/Init (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:01:53"}
{"_id": "5K7sk2MuyT5LZmY6W", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "eKT7oNd75GTeHBYWp", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:07:46"}
{"_id": "95Z5p8BfLzpFZdubs", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e->State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "CW98Yr9ttKYCsCoBu", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 21:53:16"}
{"_id": "mp3rR4WeXzdT7xakF", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 { Init in ^adj.State\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "teiMM7nrjoJDryyR8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 22:15:25"}
{"_id": "Cdv3ah6uGmQYkSHAR", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "t3ojga3xjHgDDdPqo", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:27:39"}
{"_id": "gp8butzrniyCQjW4A", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | all s: State | Init.trans implies e->s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xfDNaYkKwDFMdjooz", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:14:45"}
{"_id": "wxiAZHA7LCnGqkZ6x", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans)) . ~trans\n}", "derivationOf": "KNNaxdDhzt9ESAo5k", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 14:22:58"}
{"_id": "8TF8sSEZat5w7Dv7m", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.*{s1, s2 : State | s1->Event->s2 in trans} = State\n}\n\nfun trans_bin : State -> State {\n    \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "vswc7uLTHNSi9BnYa", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:32:23"}
{"_id": "jiMuw3GnGDP2N3wMd", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:(State-Init) | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "27hdF3av9iaTME2FH", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:52:12"}
{"_id": "33qkKpn4KiBewkGHy", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall e : Event | trans.State.e\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vkdWagFfgfvCC7vhT", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:38:44"}
{"_id": "2w39iizvknC2B6jP8", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlet st = trans.State | ~st.st in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SCihc4brbrm9F6c7c", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-11 00:04:23"}
{"_id": "6TGFHHfwLyvNFcshN", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s: State | s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-12-31 18:23:01"}
{"_id": "Ky7SbHvpaNhADabAJ", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  all s,s' : State |lone s.trans.s'\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "tosB7AFwoahb49GAE", "msg": "The \"all x\" construct is no longer supported. If you know the range of possible values of x, consider rewriting it as \"x == set_of_all_possible_values\".", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 10:19:40"}
{"_id": "sAAX3PG9Z3uzvw3LK", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-2 17:31:53"}
{"_id": "yF7cQPYCXtD5JRMWP", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "3HEktHPfwPfuz5kAB", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:07:17"}
{"_id": "2Ecg6c3ZbteAMPqoq", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ECiLJ8p4f9R8vPKYD", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-17 20:51:27"}
{"_id": "LYRu3dMJRFP7rRPNS", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init in Init.^trans2\n}", "derivationOf": "fTKuiGweusmfDbqLC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:58:00"}
{"_id": "NjZ7JLWdTBFKQAHYb", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState-Init in Event.Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kE34DgPyYzwpZQYsg", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is this/Init (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-13 00:11:13"}
{"_id": "49ZJY2oyeWr5dHm3t", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | all e1, e2 : Event | some e1.(s1.trans) and some e2.(s2.trans) implies e1 = e2\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "F79bwqgsP6gZ29ke4", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:31:13"}
{"_id": "gugzAq9sNQ6SFai2X", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State , e:Event | some e->s in trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 11:52:02"}
{"_id": "xbxbk5TRtv7HejSys", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hiBEfhh6pkYCQzugt", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 11:13:17"}
{"_id": "QgmmhPrFwm6naMTAv", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in ^Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5vwLJgxgSQ8CWPEs7", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 23:43:51"}
{"_id": "CpWLpXDtonxLbLXbJ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | all e: Event | Init.trans implies e->s in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Taji2HXKSNHWncE7H", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:28:42"}
{"_id": "5ufv3osHxq4v9BHu6", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall e : Event | State in Init.*(e.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "mq2cTJ6sXc6vxudL6", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:26:53"}
{"_id": "myy4Ez2gexuw2ZQqg", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some (Init.trans).s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "h5YpSQFe2cNEBLF2D", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:23:23"}
{"_id": "3niTLsBfSv4i3M5yn", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans}\n}\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i : Init | State in i.*adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FBJ6qtuP9RYh7fmfC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:36:35"}
{"_id": "N7S67DKoxY3qGrfdg", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tone Event.(State.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fZ55HaAJndNrbiLDh", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:24:08"}
{"_id": "W8vEw6Adcg99d642q", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | all s: State | e->s.~trans in Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qhoHYGg5niD9H2bmE", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:12:20"}
{"_id": "t6qkG7GwjmFNHjsHw", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-10-17 19:21:46"}
{"_id": "Sjm9eppMBpeAJ4KeT", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rA6Thnhn5rG66Xob3", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 03:28:32"}
{"_id": "x7y7GAkykeZdY6W83", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s:State | Event.(s.trans)\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AxXoZcJ6vXKguhgzj", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:09:29"}
{"_id": "rGRMeZ3iFMagdYYT3", "cmd_i": 2, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all e : Event | State in trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "fHDmrk4RyBsKNoKqT", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:15:09"}
{"_id": "ii7RTEFCT5tR4vk9g", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ch8DQeoPoZn92Rihe", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-2 17:38:19"}
{"_id": "r2SswEEbbswAaW5sL", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | all e: Event | Init.trans in trans implies e->s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wmmYwgKnyWFe9gEXC", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:24:37"}
{"_id": "aJmLAzTcFSrFxexQ8", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "oKaiowMjpjD2nL3uE", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 22:17:16"}
{"_id": "Bg9r4Mxyo7PcH9vqh", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some x->Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rb8DYx7rSZmNanZPW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:03:39"}
{"_id": "9MYamBzXX45kcjnau", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7XP9t2kDDgsvpyHpa", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-30 19:58:10"}
{"_id": "tycwrC9YqaZeEk6uj", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t~(State.trans).(State.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Lcz62K52ugyFpt3vL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 02:40:17"}
{"_id": "uGwy8cs2L9rSv6JWe", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State | lone s.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 22:10:50"}
{"_id": "J4ywXfdFjudtfRDZS", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event  | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jcm2So63sE7PHf552", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-16 22:08:42"}
{"_id": "jtyMf2ykdm6K5rSBR", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\nall s:State | s.trans != none\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "!= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {this/Event->this/State}\nRight type = {none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-6-10 10:02:02"}
{"_id": "KmyBPB8HAdL77danB", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State | lone x.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EQDWwARZDXG7WDQfj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 22:04:08"}
{"_id": "ZwvGcfxJb9dyzdH6j", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\talways (all s: State | some s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\talways (all s: State | lone s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Mu2zxfJQXvBcmPQQo", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 20:03:37"}
{"_id": "j8uet94sMhpWav3rh", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FrhGTvj9va8M8QeFP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:11:47"}
{"_id": "SpjqAywf8LYhXEJcB", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FbQaY2BLQsoB46cW5", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:42:21"}
{"_id": "jjy3h3t7Fu432QWBq", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s1 : State | e1 in s1.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "y94wCwFpTe43vyk3k", "msg": "The name \"e1\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:15:48"}
{"_id": "BQg5K83RZkKWk6mnb", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "vHTkCiv3FBteBYn9K", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:35:36"}
{"_id": "piCSxRRcrZrzd5d82", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone (e.(s.trans))\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2 : State | no ((s1.Event)-(s2.Event))\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "This cannot be a legal relational join where\nleft hand side is s1 (type = {this/State})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:12:48"}
{"_id": "TcNyLt2oytzcYt25Y", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s,s1:State|  s.trans in s1.trans and s1.trans in s.trans\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "g7cr3v7ZMGG4GZgnG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 18:07:27"}
{"_id": "aP7SMS4ooxCPjqpSt", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some s.Event.^~trans :> Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SnWB67BurvJm3ssFy", "msg": "This cannot be a legal relational join where\nleft hand side is s (type = {this/State})\nright hand side is this/Event (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 20:17:02"}
{"_id": "tafc9rzMLoZkS4qHL", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in s.^{x,y: State | some y.trans.x}\n}", "derivationOf": "AwmACdjtu8CeKdamM", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:41:57"}
{"_id": "QQuMxy7WcLwLczsjk", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans in State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "7q2PWDpcPDyePzcr8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:15:57"}
{"_id": "CH4FBphJpEhZi3bnD", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-5-7 10:22:43"}
{"_id": "uL7HXbawRFBbDuMbb", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall x : State, y : Event | lone (y.trans).x    \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QdfMz9aGGx8jDWNof", "msg": "\"State\" is already the name of a sig/parameter in this module.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 09:58:41"}
{"_id": "xgbwpDi74m37kZ2aW", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "A84YFkPtvw2m7Qm73", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-15 16:04:38"}
{"_id": "393AxgCnhDqJ9858F", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PXdQyjtvPeoPDEiPX", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-16 17:27:36"}
{"_id": "DgedwD4vkxjGPXf6h", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event.x in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rC4z5qcbRyng9BrZE", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is x (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 13:48:31"}
{"_id": "9AYBiiPStJ9xcp822", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some trans.e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "w665TxMj4iByJcBeD", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:46:00"}
{"_id": "nCz92eiGjW82MYcE5", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n  all x : State | (x.trans) in Event one -> one State\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 11:54:44"}
{"_id": "jhEe5eSLf4MtgsvSE", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : Event | State in y.*(x.trans)\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hvLYSgHuJBCxgfcMH", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 22:15:34"}
{"_id": "d2vSLNpLa23zwbf7P", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | Event->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "foSvqn2hhA4js7HmG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:15:45"}
{"_id": "fHDmrk4RyBsKNoKqT", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  trans.State.Event = State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "ydxqD4us37ftGxQdn", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:14:19"}
{"_id": "iy5Y6vfwD3FXNmfGS", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  \n  State.trans.State = Event\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "acWpra5fJpQr5roRH", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 23:15:54"}
{"_id": "bN4Scnn7Rf6acCfYA", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tno Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7HQmWGyDX5bXWkX7z", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-30 18:39:03"}
{"_id": "noMLo8NNAxsLAnvx3", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.trans.State\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yKCMh6HwBnyDSKaq4", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-9 17:32:20"}
{"_id": "h9QoSCDRPzywx6bXP", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | s in Event.(trans.State) implies s in Event.(^trans.State)\n}", "derivationOf": "Rc3HkhZbrRTKcpFim", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:55:57"}
{"_id": "c6jJoHwbJAPmD8a5N", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {all x,y : State | some z : Event | x->z->y in trans} |\n\tall s : State | some i : Init | s in i.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "Hfx98jbiESPcmZihL", "msg": "This expression failed to be typechecked line 39, column 42, filename=/tmp/alloy_heredoc7358489189625110263.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:54:54"}
{"_id": "hqqcQrMPuZtwHtp9P", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  let trans2 = {s1, s2 : State | some s1.trans.s2} |\\n    no State.trans2\n}", "derivationOf": "aS9PoaWGQ2mePP8M3", "msg": "Syntax error at the \\ character. HEX: \\u5c)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-23 04:26:20"}
{"_id": "fqTM6F2gojafRrBeZ", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event| some s:State | s in trans.e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "uzutxuu6BYDbXRPws", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:46:39"}
{"_id": "gsEQqzFubdxW6CDii", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | e : Event | some x->e implies some y->e\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YKcDCeoAztifFGkNX", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 14:01:16"}
{"_id": "CCMu2hSd4omqnrDE7", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  all s : State | one s\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LDHy4R6REgEfMz6E9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 01:39:41"}
{"_id": "h8Rw8Q7BZqZycDsoQ", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : Init.^adj | Init in s.^adj \n}", "derivationOf": "uv3ikC2ZfPtrii9kb", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:31:10"}
{"_id": "xFG33KaXruKxsCX4Y", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State| lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s,ss: State | (s.trans).State = (ss.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NfKLor3Zux6CDNkNq", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:39:47"}
{"_id": "mpYEsDBmA8QCH3ASC", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i:Init, e:Event |  s in trans.e.i\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kpG3C5nwLXqzQuToB", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:39:12"}
{"_id": "kgRHJvKi7okGfrm2W", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, e : Event | s in Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2z6irypG94BXZjmGN", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-12-30 17:34:49"}
{"_id": "BEWGypaTQQWh4MtkJ", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 02:36:50"}
{"_id": "sSsgDdn3kmkQx7P4f", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 02:09:37"}
{"_id": "joLgiR5LXDvptQ9zt", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-3 12:18:47"}
{"_id": "De886eNr957TvF4uH", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e : Event | lone e.(s.trans) \n\n}\n\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { all s: State | some i: Init | s in i.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r : State | (s.trans).State = (r.trans).State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 { all e : Event | some State(trans.e)\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GouR3xZZmnvLZRna7", "msg": "The name \"e\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-9 18:30:27"}
{"_id": "4pppPP2LoAherGeT3", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.^trans_bin = State\n}\n\nfun trans_bin : State -> State {\n    {s1, s2 : State | s1->Event->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "T33MYoZ8tkwsfmQFK", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:31:42"}
{"_id": "fMDDeQuxrJGR5TStR", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tall s:State | one s { Event.(s.trans) in Event.(State.trans) }\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "b743RYiXMhwbSYLCY", "msg": "The name \"s\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 01:53:07"}
{"_id": "McGZef49Qi4HqwMSy", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "s5WbNPscMrREpi6bJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 23:52:13"}
{"_id": "fHeDRhApHsvWT7Rd6", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.^trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9ATcPdTCME5JapEj4", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:08:07"}
{"_id": "CvvzzcJ5iGtXQwgtZ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit in State.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3qQLNTKuvqPHNH2fz", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 18:08:57"}
{"_id": "SxjCD9nWcuhpymTLK", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "upYaovicXDaQcpksa", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:26:49"}
{"_id": "dDNPaQWusLrsfGZWs", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e : Event | lone e.(s.trans) \n\n}\n\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n  }\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { all s: State | some i: Init |some i.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "R8dbexM7cQFnnoi2D", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-9 18:01:32"}
{"_id": "rs3GDTWigWjpTaFvL", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | some ~s.trans\n}", "derivationOf": "wWPckeoSjZ3579cyG", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:30:19"}
{"_id": "DMNNaauMTgc3BQyHE", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s'\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "87Fmw9xecQ8Wz4ZQE", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 18:51:15"}
{"_id": "coPw9eFGCC7wE87GX", "cmd_i": 4, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n\tInit.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t{x,y: State | Event in Event<:x.(trans.y)} \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "qwEFL6Jw27d636dEz", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:37:13"}
{"_id": "6ef7HaseDCC529oXp", "cmd_i": 2, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n   \t~trans.trans in State->State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "QEA3GaFGEHBdbkmGk", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:19:58"}
{"_id": "g6ZHJGvcT4JhXFzTF", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet adj = { s1, s2 : State | some e : Event | s1->e->s2 in trans} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some (trans.State).e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "e5K7DuACRF7SMfGr2", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-3 11:18:14"}
{"_id": "i8GL97gyJNk778bgf", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone s:State | s in Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s1, s2:State, e:Event | s1->e->s2 in trans implies s2->e->s1 in trans\n}", "derivationOf": "FWpc9E98bBDv8Xa67", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 00:34:00"}
{"_id": "yPmJcRitYiKH6hi9q", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | lone e:Event {  e->s in State.trans }\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bHvxfvySrv2rn2i5W", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 18:53:37"}
{"_id": "EyFGMkgHoWC729LXC", "cmd_c": false, "cmd_i": 0, "cmd_n": "run$1", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\nrun {}", "derivationOf": "EcHNqzTwjRHPEHGEC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-11 01:20:02"}
{"_id": "2ZDDsewq9FbP4v7b8", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s1, s2:State | some e:Event | (s1->e->s2 in trans and s1 not s2) \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9WWcAfNcGNo7AhenK", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 00:16:49"}
{"_id": "4avdBNN5x2ouYwWER", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlet k = trans.State | k.~k in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ipfzsdmpb5gbhPTnP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 13:56:57"}
{"_id": "os2knvrkCSkYDdCkt", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8WXGFB2Dhzv2JzDiq", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-21 18:43:16"}
{"_id": "TXm5TaS8aJdZT5yrv", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (~(s.trans) <: e) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YkMXk74WdaBmBZsGy", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:14:23"}
{"_id": "Kh3QptP5b9FdnRsxA", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun adj: State -> State {\n{ x,y : State | some (x.trans).y }  \n}\n\npred inv4 {all s:State | s in Init.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 { all s,r :State | (r.trans).s = (s.trans).r\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Z2KkegJjW9gp8uini", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 22:18:15"}
{"_id": "DyXafJdLvfugsEWTf", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init| some State implies some Init and    no ((State-Init)  - (Event.^(i.trans)) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DPwgMpyabHZPCNpAa", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 18:53:16"}
{"_id": "Q3yvKYynSC5Pa5WzF", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    all i : Init | i.(^{s1, s2 : State |s1->Event->s2 in trans}) = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "bSjzWCrfvATtzCfAj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:38:32"}
{"_id": "MRBtNPFJyhJpKhyed", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj={x,y:State | some e:Event |x->e->y in trans}\n  \n  all i:Init |(State-Init) in i.^adj\n\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7ec9HzauAh7aNMFhx", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:02:50"}
{"_id": "mLBJo7S765JcqsgE4", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some (^(Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ws4kqz9BHqKbXgDuM", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:07:54"}
{"_id": "AoupH3FgAr7tdyAjQ", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some State.e.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8MCP7xeqJNcfXf4qd", "msg": "This cannot be a legal relational join where\nleft hand side is this/State (type = {this/State})\nright hand side is e (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 21:09:54"}
{"_id": "iBpwieENXEGisK8Fv", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ppj8zjBDjARaD8Kwh", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:31:11"}
{"_id": "JrKFfpugMcxkpm9qJ", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | x.trans = y.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-18 22:11:53"}
{"_id": "4LJzqMMahYQ8aiRyi", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^(~t))\n}", "derivationOf": "2wLPS7SWaYjsx4ccN", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:13:32"}
{"_id": "KfLhft5cB8i7yZHsJ", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 :State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tsome (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DKQZNc9dYdysjM7gy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:20:15"}
{"_id": "HJeWuR2nSeSBmvwNh", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t Init.(Event.*trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8CmhPzMgTZ9iYPAYL", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 22:01:42"}
{"_id": "Fz3fPdK6Qp6TLS2To", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  {s1, s2: State | s1->Event->s2 in trans}\n}\n\n\npred inv4 {\n\tState = Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KqFHbvCZi7poS64pa", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 22:57:14"}
{"_id": "q5gHN2s7dACdRPyH9", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall e:Event | Event->State in State.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Gu2KhPue8wpTvBM39", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:18:22"}
{"_id": "XeHof4JHfg37ZvPKC", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | Init.trans in trans implies e->s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "r2SswEEbbswAaW5sL", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:25:35"}
{"_id": "rF75WDTCjfvXBLoey", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall e : Event | trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "s5XmMyaosbGHaK8eM", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:37:46"}
{"_id": "izmGT8TZ5FtjNAXXF", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  let trans2 = {s1, s2 : State | some s1.trans.s2} | no State.trans2\n}", "derivationOf": "hqqcQrMPuZtwHtp9P", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 04:26:25"}
{"_id": "NM3x3oDiJGf5ZXKZB", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qeZrRgmTJEpWa5jLY", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 09:59:00"}
{"_id": "xTErDpNrnom4MEQvs", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in e.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wCvdjsSMCnDNZJYhD", "msg": "The name \"e\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 14:12:23"}
{"_id": "BQev54SNdhCJyiwnc", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n\tlet adj = ( all x,y:State | some e:Event | x->e->y in trans )\n  \t^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1,s2 :State |  no ((s1.trans).State) -((s2.trans).State) and no ((s2.trans).State) - ((s1.trans).State)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "q6gYp2Nxk6argvnKJ", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:01:20"}
{"_id": "Sv3a7L2NhZwWMbsb3", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | (iden & (Event->Event)) in (s.trans).~(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "fasDPdQQ4Zmzm3rTy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:22:27"}
{"_id": "7wbc2NJygPsFRfgek", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | x->Event->y in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "uK6HuNz9FBovWKWDz", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:41:21"}
{"_id": "x98qaJ42dJDRFAv6C", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\talways (all s: State | some s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\talways (all s: State | lone s.trans.State)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mSDBnnoTR6XoaQ3g7", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 20:08:24"}
{"_id": "LAPFeNn7tRjRbwcGR", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState  in Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6jhHrnn2hNtWiwfXp", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:03:16"}
{"_id": "bLymDBLdfWr2fJrmj", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LihA4odjN2e2tCdjm", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-9 17:21:59"}
{"_id": "zHsB3xvSus5PAFHkW", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  State in Init.trans\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "B3cJ4vc5cfwvddBZ2", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 19:13:32"}
{"_id": "knRBxxJf93yv6skvJ", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone Event.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xymXGkHKqZqMABpdG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:27:14"}
{"_id": "BRFRuuuXz56PwdgY6", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | s1->Event->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.*tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qYsJ23Bn9fHLBNMv2", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 15:55:27"}
{"_id": "ERvgXZ2GTThxtTnQS", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ftKjs7Ndk38ckud7n", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 12:28:27"}
{"_id": "6gNFFDsocvqq4QMfF", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8FGe3r8EmFS4rqMF3", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-30 18:40:53"}
{"_id": "SaK62FbANpS3fFtpj", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates : set State -> State {\n  \t{ s1,s2: State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n  \t\tall s: State | s in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\nfun getEventsOfState[s1: State] : Event {\n  \t{ e: Event | some s2: State | s1->e->s2 in trans }\n}\n\npred inv5 {\n\tall s1, s2: State | getEventsOfState[s1] = getEventsOfState[s2]\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e: Event, some s: State | e in getEventsOfState[s]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LtzuoaazqdxGnCr9t", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-2 18:13:16"}
{"_id": "zKcqSyrkGnRb22aer", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState-Init in Event.(Init.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "A8ja2X8mEaDLxbt2b", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-13 00:13:09"}
{"_id": "D593Q42Qjmi6qCw24", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  all s : State |all (a,b),(x,y) : s.trans | b!=y\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5CrpuGCs2aaL6Qq9v", "msg": "There are 1 possible tokens that can appear here:\n)", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 10:26:57"}
{"_id": "2FmmKXkmg4y9FEiEi", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tState.trans = trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | e->s in State.trans \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "T8BsbGR7WaMgPMhJD", "msg": "== is redundant, because the left and right expressions are always disjoint.\nLeft type = {this/Event->this/State}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-14 00:12:56"}
{"_id": "qeaP365mJcspgMi8d", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in ^((Event.(Init.trans)).trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some s:State | e in State.~(s.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "bCm7mvtqYzmBq6h4K", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-13 00:05:24"}
{"_id": "BX8GPGzCmd9PqA7Fe", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Tj7uHYRaNNXfCtZGD", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 09:49:03"}
{"_id": "r4PL7mRnKrEeRFa4J", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MJ6X8GyJYYTrW8c7P", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-19 15:42:19"}
{"_id": "KmpH8EWPkpZmpLhzM", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in ^{x,y: State | some x.trans.y}.s\n}", "derivationOf": "2xZ6wj2tvF6Gkp7pm", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:09:59"}
{"_id": "sZ57ZgzFpA3ePz8Pd", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  some ^(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "R9gnew9AnPKtw5nTy", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:25:48"}
{"_id": "Hs3nTtkQ3JNac4tQ5", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s:State | lone trans.s\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gBGdfELzCiKFwR38Y", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-15 16:17:23"}
{"_id": "bZdNykzA3GBbLw9Nu", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some (Init.trans).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zrj9xHRnkG2ZkrQHY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:04:52"}
{"_id": "AdayqGPYxgvBvGWZi", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n  \ttrans.Event.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "Azg6JnHtXceeroWvt", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-14 00:56:14"}
{"_id": "Jjiy87maXr8XrxCPG", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.trans.Event\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9gXkvZTWgqDRze2aK", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:19:26"}
{"_id": "aNbwx88jATjvgBQWd", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pP7yDv7hPFZ2aWxQx", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-25 20:50:34"}
{"_id": "z8CvNxBt4yWbm2dT3", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init | s in i.^trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xKFMeXw7bznfv2rfC", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:49:38"}
{"_id": "F7tkZLZmgy7FTevDs", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.trans.Event\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Emwpn5CetMnv4f5Wy", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 11:18:26"}
{"_id": "p6iMKP68LN2WpDobA", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone s:State | s in Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, e:Event | s->e->s in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7KXnsiubfHdNnGYFB", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 00:31:28"}
{"_id": "wqvHaGsyPCvK6zbSv", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | lone e:Event {  e->s in s.trans }\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "idvX5gg7ppM73jXnD", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 18:52:25"}
{"_id": "BsxSur9s7W7Z8twhH", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome trans.(Event.(State.trans))\n}", "derivationOf": "wxiAZHA7LCnGqkZ6x", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:23:18"}
{"_id": "2SzS84ymg3pb8hxuy", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State , e:Event| lone e->State & s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, s1:State | s.trans.State = s1.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | Init.trans in s.~^trans\n}", "derivationOf": "uEwJQSqrpjHqgxqzP", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 21:40:36"}
{"_id": "zGKeY3mp9zjKDpQTL", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\nno Init  implies no State and  all i :Init|(State-Init).^~(i.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YqTHeGWSSAGqdLcGd", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 14:06:27"}
{"_id": "AWv3Xj44MexiMGG3r", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall x : State, y : Event | lone x.(trans.e)    \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "\"State\" is already the name of a sig/parameter in this module.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 09:57:34"}
{"_id": "NEQWJXA7G2HGYraLR", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init | some e:Event | State in e.(i.*tras) \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "393AxgCnhDqJ9858F", "msg": "The name \"tras\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 17:30:49"}
{"_id": "2ScAY54DuHc4x4P52", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState.(Event.trans) in Init.*(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NTgGb4y5XHZo5APcm", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 21:57:49"}
{"_id": "mGpPSxoyL3cwRu7wJ", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s1,s2:State, all e:Event | lone s1->e->s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PW7NCTCBwbyxvzBs3", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 00:14:30"}
{"_id": "iavxwjjpWatLWZr5w", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  all x : State, y : Init, z : Event | (trans in y one -> one z one -> one x) implies x != y\n}", "derivationOf": "yjaukujkj3ioyciig", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:45:13"}
{"_id": "Qqr9rGvSRoJEGX4P8", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some (trans.State).e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "q6N8pvtMy6cm9pRxp", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-2 18:12:39"}
{"_id": "wD9AjnRaFrWqzehcW", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "4sAeHPMgh5RZs8z5v", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-17 19:10:53"}
{"_id": "AY45GRyA2nizj2RcP", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n (State) in Init.^adj\n\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  \tlet adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n  \t\n  \t\n\tall  s1,s2 :State |some e:Event |  one State or (s1->e->s2) in trans implies ( Init in s2.*adj  ) \n\n  \n}", "derivationOf": "RxW9ankJEgfbK6qHo", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:12:25"}
{"_id": "umR5zwHB8mnFoggbb", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n trans.State.Event = State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n\n   all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n\nState in Event.(*(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  \n \n all x : State | x.trans in State.trans\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n\nEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n\nsome (Event.(State.trans))\n\n}\n\nrun {} for 3", "derivationOf": "dMCxHWb8NckmFbtNd", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-6-10 10:29:41"}
{"_id": "qLcrMjYfv5py8zeRX", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall e : Event | trans.e.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YM8hM9oY4CXb8zGEv", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:37:15"}
{"_id": "Mu2zxfJQXvBcmPQQo", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\talways (all s: State | some s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cFwd2DcgTMbcixBBF", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 20:02:36"}
{"_id": "S5DEudAP4HFSyfNk5", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WQksmWvLGAkFHPzBz", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:43:42"}
{"_id": "GmKcB2nNHJCRdM6X2", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone s:State | s in Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s1, s2:State, e:Event | lone s1->e->s2  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RrGrhtBdp5rHxb8en", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 00:25:40"}
{"_id": "RQs86WA2SzMuY7uE7", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t all s : State | Event in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CXoEXhJK2yAoXpYYu", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-20 08:26:28"}
{"_id": "nHm8km3jgCEHyLwjy", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in s.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GMJrCLGpbpwsYMyZy", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:34:01"}
{"_id": "NfKLor3Zux6CDNkNq", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State| lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s,ss: State | (s.trans).State = (ss.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wa2DGfX7tKTd4ERy6", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:37:14"}
{"_id": "oEdTotozGZENZ9M2s", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wsfBpj6itTYrnCKXH", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 20:12:16"}
{"_id": "yxzkG9P9pWXbhtKAf", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n    trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    all s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n    \n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all s: State, e: Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let ts = { s1, s2: State | some e:Event | s1->e->s2 in trans } |\n        all s: State | some i: Init | s in i.^ts\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s1, s2: State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    all e: Event | some s: State | e in s.trans.State\n    \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let ts = { s1, s2: State | some e:Event | s1->e->s2 in trans } |\n        some i: Init | all s: State | i in s.^ts\n}\n\nrun  {}", "derivationOf": "6AKnhaGwc7nLsn3KE", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-11 15:51:44"}
{"_id": "rHtt9Qf7HpJr5jXxr", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : Event | State in y.*(x.trans) \n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dcS969NLLybm9MYLo", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:26:32"}
{"_id": "fznh5jcqEdphXGc5P", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | s in *{x,y: State | some x.trans.y}.s\n}", "derivationOf": "iQ49iBneyE8jFMnZi", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:43:18"}
{"_id": "BwxMtTRukco5TYakd", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State |one e: Event | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ykphe4t2iqsDZxZba", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 20:43:22"}
{"_id": "gKtYebFZ2RmNKboX4", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n  \n (State) in Init.^adj\n\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  \tlet adj ={x,y:State | some e:Event |x->e->y in trans} |\n\tall  s1,s2 :State |some e:Event |  (s1->e->s2) in trans implies ( Init in s2.^adj  ) \n\n  \n}", "derivationOf": "vQck9dHSRqzCD9WpY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:11:20"}
{"_id": "p8hguY54XsnmSNeRr", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in (Event:>State.trans)\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "aYzWRzr7oNu2pmoJr", "msg": "This must be a unary set, but instead it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-23 08:23:11"}
{"_id": "EHnuNrowyshdeXS4A", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s:State | lone s.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nasB3wepJ3LAwRmKZ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-15 16:09:50"}
{"_id": "EemnNxBe7yZ5fJgXR", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init | Node in (*(x.trans)).Event\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LhySwXAuDXnw6iB5k", "msg": "The name \"Node\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:24:25"}
{"_id": "qKgyGQaj9Aq4YZWQN", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | one (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YuCuZnfCw3Zo3CcAy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:36:16"}
{"_id": "922y24tDXo3pH6Dny", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    all i : Init | i.*{s1, s2 : State | s1->Event->s2 in trans} = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "k4KPmYufukRhHsCyL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:35:04"}
{"_id": "aEbnEnJLcmMDZ6L3a", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    iden in ^trans_bin\n}", "derivationOf": "zbXnStkdRWk3YH3hj", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:48:36"}
{"_id": "ExxaXPtp8ipPheLX3", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tState in Init.^rel\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2: State | s1.trans.State = s2.trans.State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  \tall e: Event | some s: State | e in s.trans.State\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "t5SHeyp3zYNzwTRhh", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-9-12 10:03:19"}
{"_id": "4EeeEcFRo35q346WF", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i:Init | s in i.trans.Event\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "trrLcquDvCNFf3zkB", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:37:34"}
{"_id": "PuzeRyyxPQtE5rEXj", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 22:45:18"}
{"_id": "73YeuJzwfDsN8PL87", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some s.(Init . trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xrwDWdtzp64N3SoZr", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:13:50"}
{"_id": "nZm9RmSSMPW9osTri", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans}\n}\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | s in Init.*adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AW3hi7t7jRyARt6i6", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:38:52"}
{"_id": "LFbZ4dCW7pWqYkfoL", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EqGEufwAAbkkWfwwC", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 23:05:29"}
{"_id": "DKyGgEruKNwGWGEXc", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n  let adj ={x,y:State | some e:Event |x->e->y in trans} |\n\tall disj s1,s2 :State |some e:Event |  (s1->e->s2) in trans implies ( Init in s2.^adj ) \n}", "derivationOf": "MnxDQz85F9rFxo6Kn", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:42:55"}
{"_id": "WnSF9AfwyED39aA63", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x  : Event | State in *(Init.trans).x\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Kwwc6hNtkc9KbWvg4", "msg": "The value of this expression does not contribute to the value of the parent.\nParent's relevant type = {this/State->this/Event}\nThis expression's type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 22:27:28"}
{"_id": "EbnyQBjJgf463Juf6", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | State in Init.^(s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "BWTEizEF7w8vixzo6", "msg": "^ s . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:43:32"}
{"_id": "D9wX8xrtjhnC3kkEd", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tsome Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "puNhrfjj6NyZD5izp", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:19:42"}
{"_id": "ya8CMHQupZ43pE5pE", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | one i:Init | i in Event.(^trans.s)\n}", "derivationOf": "T9ctabavXieA8GuHD", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:56:42"}
{"_id": "J97hsPXvw8tyEuYmz", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all e : Event | trans.e in State->State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "Bmohca9Tuot8ma64x", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 23:15:32"}
{"_id": "nKkEYsJhZ4o9ieaso", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone t:Trans | t in e->s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aNbwx88jATjvgBQWd", "msg": "The name \"Trans\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:53:45"}
{"_id": "XKSEgMptxRhBknTyW", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tsome Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MiW4QJxLjhtnvSxmS", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:58:21"}
{"_id": "SebgJ2h799Cp5MKSJ", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\nall s:State | s.trans = some\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WWeAmm4Ddq9vW2KTi", "msg": "There are 29 possible tokens that can appear here:\n# ( * @ Int NAME NUMBER STRING String Time ^ all disj fun iden int let lone no none one pred seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-6-10 10:05:51"}
{"_id": "5TFZru2bC4A8tjnjD", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 { \n  \n  all x : State | (no iden & (x.trans)) and some ((*(~(x.trans))).Init)\n}", "derivationOf": "jc2cFkmjqGLEc5kmN", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 12:32:39"}
{"_id": "WMPxheBdmkHihMW5J", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 \n  all i:Init | some e:Event | i+State in e.^(i.trans) \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xuxMtzJf6ypgDe3p2", "msg": "There are 1 possible tokens that can appear here:\n.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 17:41:08"}
{"_id": "7iSp2a64KF5NXhXMP", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.(^t)\n}", "derivationOf": "22f94SL8WHbaSfwPN", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 07:35:23"}
{"_id": "DnT8rEby2wZMixLDL", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | e.(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "G6LvdYP99a6MvxLBZ", "msg": "The name \"e\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-14 09:19:24"}
{"_id": "TzXKYAJNZBeJ3gPqp", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | s1->Event->s2 in trans }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i : Init, s : State | s in i.*tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ucA8zyEKXHspDqk6G", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-8 15:53:10"}
{"_id": "LC8M9QPJZHyo8SRTy", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans} \n}\n\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tState in Init.^adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tInit in Init.^adj.*adj \n}", "derivationOf": "gn7LqvJQmAzA9dC6g", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 11:32:28"}
{"_id": "Bb7pQGtyt4RXiZPcJ", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SuBBjGvtaK8bbRfLf", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-12 19:38:09"}
{"_id": "Efftp5efx36AN6fCS", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.*{s1, s2 : State | s1->Event->s2 in trans} = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "8TF8sSEZat5w7Dv7m", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:32:30"}
{"_id": "knNzbSM9tPR3bzBDG", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n all e: Event | e.Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Zp8cPzryKTnwFSTeh", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:07:32"}
{"_id": "Kwwc6hNtkc9KbWvg4", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x  : Event | State in Init.(*(trans.x))\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "uCByiFT35t4dGEKv4", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 22:25:22"}
{"_id": "H3MdAu262osgFYEyR", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans2 = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans2 = {s1, s2 : State | some s1.trans.s2} |\n    Init in Init.^trans2\n}", "derivationOf": "95ESA7FLEp4coqQpE", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:56:47"}
{"_id": "cxksY238M74sBzRbm", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tsome s : State | Event in s.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Fvq4n3r9zghJ6MWCo", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-11 00:23:08"}
{"_id": "TMq4tbcxWk8JpfzXs", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2ibu8XqNNtnSeQcew", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is this/Init (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:07:08"}
{"_id": "CkzJ5pdfy42rBieRT", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.^(trans[Event])\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ek59wir9uPMcqKQG9", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-9-12 09:49:30"}
{"_id": "48FyGrExvpnhAsZBy", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | s in (Init.trans).State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "oiguL2nJfrP9DtJFQ", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 02:57:45"}
{"_id": "wvbsTZ5CvxG5TPbdr", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DRhTR8ncJN8PcL7oR", "msg": "There are 29 possible tokens that can appear here:\n# ( * @ Int NAME NUMBER STRING String Time ^ all disj fun iden int let lone no none one pred seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-4 16:45:29"}
{"_id": "tESaeAgvuweaN3T7L", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n\npred inv6 {\n\tall e:Event | some (State.trans).e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "87K6tbXQ24bmf45J5", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 21:17:49"}
{"_id": "b6xth6LtCwMi4jz3N", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RufbxbJwpWtxSdvRQ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:25:45"}
{"_id": "D5FjfX7gBgzfTW54Z", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | Event.(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DnT8rEby2wZMixLDL", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-14 09:19:37"}
{"_id": "KqFHbvCZi7poS64pa", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  {s1, s2: State | s1->Event->s2 in trans}\n}\n\n\npred inv4 {\n\tInit.^function in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5DC8xKEp3ueQpTidN", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 22:56:51"}
{"_id": "2g8uSxrFtADHtzCSS", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State | (some ((Init.^trans) :> s)) implies (some ((s.^trans) :> Init))\n}", "derivationOf": "cmmLL8motm4bj3kuR", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 04:03:03"}
{"_id": "XBgW4gWbhqkp8mq9Y", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | all e:Event | lone s->e in s.(State.~trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "z8bvPoFwkEg3j5cox", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 02:53:15"}
{"_id": "dGqKPRDGxqJwWThaF", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | State.trans in x.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "QirEphkEz5aJRsxz7", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:11:22"}
{"_id": "mj3AQhuHc837RM3Bh", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init| no trans implies one State or     no ((State-Init)  - (Event.^(i.trans)) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8WGNLYj78XoFtFXBZ", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 18:55:33"}
{"_id": "PhNv4SvDb8tsfNS5o", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1,s2:State,e:Event | s->e->s1 in trans and s->e->s2 in trans implies s1=s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  State in Init.trans.Event\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zHsB3xvSus5PAFHkW", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 19:13:41"}
{"_id": "E8RSquQF5GFozADhG", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s: State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fMHyacRWrRiy2pWXu", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-20 01:05:16"}
{"_id": "TupoX8aecBNk25KLa", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | Init->Event->s in trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e<:State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YrcDLoqwDSdqcjFWY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 20:10:02"}
{"_id": "CdcZekJirhLmfv8YR", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone Event.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WfzS7jLcsRmXCenyA", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-14 00:08:43"}
{"_id": "fF5fkLHbJF7tHzTAe", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some Init <: Event.(trans.s)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cdkYhCxgvNuBc8h3L", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 21:34:07"}
{"_id": "R5NMSw68o4bnACfrd", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JkSMThyAs2gK5WTuk", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 19:09:40"}
{"_id": "RJBSFmyqh36vSRRZr", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init | some e:Event | State in e.*(i.trans)\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2uJPk9kfieGTRZnRR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 17:34:02"}
{"_id": "T4eLekxsgZnJHE9DN", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.(*trans) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NPsf9Ra7APmFjrMHc", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:17:41"}
{"_id": "2xZ6wj2tvF6Gkp7pm", "cmd_i": 6, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | trans.(Event.State) in ^{x,y: State | some x.trans.y}.s\n}", "derivationOf": "6v2chMHJRbd35rgkL", "msg": "This cannot be a legal relational join where\nleft hand side is this/Event (type = {this/Event})\nright hand side is this/State (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:09:45"}
{"_id": "Js5jccctBd9J8zMb6", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | all e:Event | e in s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9CkTQKBZeSAFXxyjs", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 21:34:05"}
{"_id": "idvLimzm3KhNpL9ZA", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tiden[State] \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Fh9JffCarEZgkNEgB", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{univ}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:41:52"}
{"_id": "4B7H7eb3wCBfS8r5t", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event |some s,s1:State |  (s1->e->s) in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vcZ24XWMtb66tWoJg", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 14:53:49"}
{"_id": "zrj9xHRnkG2ZkrQHY", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pkCBcNzr4MgvuJtW4", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-13 23:04:16"}
{"_id": "ifS5opueNuNKtRA9Q", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | some e : Event | s1->e->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init->State in *tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MZWGXtYQ6LokxYwSy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 15:57:12"}
{"_id": "BnE3w8sEW5jPv64re", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { All s:State | s.^Init\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "syyQ6mpocu3qZFyGJ", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-12-15 16:57:46"}
{"_id": "GKHRsZuW8sDgY4hYR", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wY36GtXCcHfpPx8Jw", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:31:04"}
{"_id": "ZCqgpgGGAs8NNPzmd", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | all e: Event | e->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CpWLpXDtonxLbLXbJ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 21:29:26"}
{"_id": "WFo5tp7Yd2tSPRYW8", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {lone Event.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "HYW5v2K88Thep2Xro", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-17 21:06:47"}
{"_id": "JAPwRdMpGtah2EDRn", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "knRBxxJf93yv6skvJ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:29:36"}
{"_id": "xnGDtL97tEcc6PfoK", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some (State.trans).Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wyc5ZPc6nLAvr9uES", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 03:41:14"}
{"_id": "BfJdZb3pxkqst6wK8", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n trans.State.Event = State\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\none Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n\n   all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n\nState in Event.(*(Init.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n  \n \n all x : State | x.trans in State.trans\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n\nEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n\nsome (Event.(State.trans))\n\n}", "derivationOf": "NbdA4LJSKXoS9PMuH", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-6-10 10:31:26"}
{"_id": "Wp5iWevcxovxu5XNB", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "r4PL7mRnKrEeRFa4J", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-19 15:42:30"}
{"_id": "8ab6witx2nqahMWDa", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 :State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5fYd3d7FbtCS39KRx", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:19:23"}
{"_id": "gtPRwWAGTsaFN7yzP", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans} |\n  all u : State | Init in u.(^t)\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NkxoyHwS2psgNjPQ2", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:46:24"}
{"_id": "JGfw8cjXXBMBfz8LZ", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XJKKM3XSNKTqqkRGS", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-26 09:27:55"}
{"_id": "R8dbexM7cQFnnoi2D", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e : Event | lone e.(s.trans) \n\n}\n\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { all s: State | some i: Init |some i.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pvEzzmGzBq4cD9qS9", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-9 18:01:24"}
{"_id": "t5SHeyp3zYNzwTRhh", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tlet rel = { s1, s2: State | some s1 -> Event -> s2 & trans } |\n  \t\tState in Init.^rel\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2: State | s1.trans.State = s2.trans.State\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  \tall e: Event | some s: State | e in s.trans.State\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aNkAcuNXN4R2GGDkg", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-9-12 10:03:15"}
{"_id": "JN9c9cF8KsFfqABGw", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tsome ^t implies some (^t).Init\n}", "derivationOf": "yJ35qDzYda5DHsDwz", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 07:38:38"}
{"_id": "RKj6vZuQPs9QMpYJp", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cgxqqWjX5JbmitGSe", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:29:00"}
{"_id": "7MKTZ9fNcS6HrQuoM", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "EgYXqKd7zHGopzQYE", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:08:35"}
{"_id": "D23eAJc76BtkikdYo", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State| some s2:State | no ((s.trans).s2) - Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jj6Hu75EyD6wqozNo", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 14:07:21"}
{"_id": "bHvxfvySrv2rn2i5W", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | lone e:Event {  e->s in s.trans }\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dFr7AJau2XrfS67cy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 18:52:49"}
{"_id": "CW98Yr9ttKYCsCoBu", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e->State in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "fWJovHxBTzZjsZ5tg", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:52:53"}
{"_id": "mKkmnH9FiJaE7SXAT", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event.(x.trans) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SnhREjyhooNnyQ2E7", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:50:39"}
{"_id": "6e5HfPSNt4doSohQP", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | all e:Event | e in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4RmofT5FBRkBDFDAW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 03:30:55"}
{"_id": "P4dyHR72CyaKgX3of", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | some (s.~(Init.^trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "tWbhs5egz84y8ksDJ", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:07:05"}
{"_id": "Mw7eePY8GmRTAnWwb", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone s.e.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "o9nnzKLMwiYhrRDRi", "msg": "This cannot be a legal relational join where\nleft hand side is s (type = {this/State})\nright hand side is e (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:19:40"}
{"_id": "Kbh7WGQa3oGaXwdme", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | one i:Init | i in (s.^trans)\n}", "derivationOf": "Sh2xma8XsHEyj4jqr", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:58:08"}
{"_id": "GbNd2MQePbZteZrn7", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, e : Event| State in e.(s.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "u2J4neBByHrwNaHHp", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 18:50:23"}
{"_id": "ALStvEiPTZ8bTxpCF", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s : State | State.(~(s.trans)) = Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "rpQ3xvYCcJWpKpxCA", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 02:52:04"}
{"_id": "Cgnk6C76ndcvgypXu", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | e->s in State.trans \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "2FmmKXkmg4y9FEiEi", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-14 00:14:12"}
{"_id": "vsWM9mY27Q6xBegNk", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState.^trans in State \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\nD\u00favidas\ninv1\ninv3\ninv4\ninv5\ninv6\ninv7", "derivationOf": "3DxtaZqJ6insJCYp2", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": []}, "nodePositions": {"State": {"x": 349.4140625, "y": 199}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2020-1-19 15:50:09"}
{"_id": "fd37sfuYKd9tQfLq4", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event.(x.trans) in Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qvcPsduJyHvsNwHe8", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:47:01"}
{"_id": "fMAeQ37NP7xnqpcDn", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "L66iukRzBzKuofRJL", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-30 18:42:50"}
{"_id": "dtMk5M8sAmcND56Lj", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, s1:State, e:Event | e->s1 in s.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "okWCEXhrfSWLavMms", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:14:51"}
{"_id": "GHTSXE4RPvkRKNxPS", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {all x,y : State | some z : Event | x->z->y in trans} |\n\tall s : State | some Init<:(s.^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "RxgjAbTvJyw6bC3WH", "msg": "This expression failed to be typechecked line 39, column 32, filename=/tmp/alloy_heredoc9494908166034063138.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:52:15"}
{"_id": "oisAKr7T4ouApLuwW", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tState.trans in Event -> lone State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet adj = {x,y: State | some (x.trans).y} | State in Init.^adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s,t:State | s.trans.State = t.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\n\npred inv6 {\n\tall e:Event | some (State.trans.State & e)\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet adj = {x,y: State | some (x.trans).y} | all s:Init.^adj | Init in s.^adj\n}", "derivationOf": "v5ECM2zEtsQNdXhpa", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:26:48"}
{"_id": "NahrHAG2FPqi7ue6x", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Cpqr5md9QPJwGxe2Q", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:25:17"}
{"_id": "MAdpijpQ5yC9CiHnK", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    some iden & trans_bin\n}", "derivationOf": "aXwCSxCa5oHw9uN2j", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:49:00"}
{"_id": "YKxCju284hcRkwp4M", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tlet t = { all s1,s2 : State | some e : Event | s1->e->s2  in trans } |\n  \tState in Init.(^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gg5gzD5kZAKKffHCt", "msg": "This expression failed to be typechecked line 39, column 19, filename=/tmp/alloy_heredoc16912455750237245250.als", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 11:02:25"}
{"_id": "4yXZMDhRGRaFRLuBA", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nall e:Event|some s:State | some trans.(e->s)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Ni3FMkW8unC6kwE3v", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 14:45:24"}
{"_id": "Ja4ikmA4ph7nE8iGB", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { Init.State\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Eyry6rYvkQHDDiJzX", "msg": "This cannot be a legal relational join where\nleft hand side is this/Init (type = {this/State})\nright hand side is this/State (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:16:20"}
{"_id": "g8MJun74aqeyJoq9f", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = State.trans | iden in k.~k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FtRbd7voLo2Cm8puo", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 13:42:47"}
{"_id": "Wq7oCYTfGzK7739pN", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-16 17:27:30"}
{"_id": "QmTNKsgu5c7dAZnhN", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    {s1 : State, s2 : State | s1->Event->s2 in trans}\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "qiYY3by7aXead4ucM", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:41:09"}
{"_id": "RCpMYz47uBkA8F2Gi", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some e : Event | x.trans = State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "t2RnDbD2Y5o2foWYk", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:19:10"}
{"_id": "3FANo9apJfBb9HYJb", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "FcX5aDeerYaDTgu4d", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:38:01"}
{"_id": "fon5PLvTmiwZeAFxM", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | Event in x<:Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "QgjEWhXcbd2jcdHrf", "msg": "<: is irrelevant because the result is always empty.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:19:39"}
{"_id": "LYcNPQy8JgYuqEBjB", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | all e : Event | x->e->y in trans implies y->e->y in trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "HzDhtmSwzcmwvkTu8", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:29:36"}
{"_id": "ZChiSvSxCt6aWmsXB", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | e->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s1, s2: State | all e1, e2: Event |some n: State| e1->n in s1.trans and e2->n in s2.trans implies e1=e2\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some trans.e in State.trans \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "8nWS8schSaJTGqZCD", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:41:18"}
{"_id": "RcC3w4M5AXS5GmMvs", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: State | s in s.^{x, y: State | some (x.trans).y}}\n}", "derivationOf": "3XKE6PwrwJEytvSEe", "msg": "There are 5 possible tokens that can appear here:\nenum fun let open pred", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-12 20:17:00"}
{"_id": "eCCmbB5dGbghvDYmx", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i:Init | s in i.trans.State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4EeeEcFRo35q346WF", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:37:41"}
{"_id": "bQ72WdJsYMZuknkni", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | s.trans in e\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iAFXybA5B8oA3SmxN", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:34:48"}
{"_id": "MruhkW6cdqeeHRWjx", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State |some e:Event |some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  all e:Event | some s1,s2:State | s1->e->s2 in trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LugomxT79kzFsWxF9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 12:37:25"}
{"_id": "rb8DYx7rSZmNanZPW", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some x->Event implies some y->Event\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Y8Psxj6dipgfW3NXL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:03:03"}
{"_id": "XYYeELLyMZRbYQgAn", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone s.e.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DkpxirR9To8HBNX4w", "msg": "This cannot be a legal relational join where\nleft hand side is s (type = {this/State})\nright hand side is e (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-12-30 17:25:38"}
{"_id": "xhJvMEg5SvMxGF4eR", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | some e : Event | x->e->y in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MqHDhQLzT9QpAahnG", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:41:06"}
{"_id": "3mpivZS7ddpQviHSi", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {  \n\tall s:State | Init <: s.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "BjHTkBmQGYzLpXZYQ", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 19:38:27"}
{"_id": "5yvqu5J2HbcoGi7qo", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tState in Init.~(^t)\n}", "derivationOf": "7iSp2a64KF5NXhXMP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 07:35:33"}
{"_id": "ftyXGG7JNNiopJPez", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState.(Event.trans) in Init.*(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2ScAY54DuHc4x4P52", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 21:58:05"}
{"_id": "GkyJizCKRxNh4oRrW", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s1 : State |  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "yaTqagSpRsATsBEr4", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:56:12"}
{"_id": "6QKchCMHyhakP5pxp", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  lone Init.State\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gEgpSceChQefjtsao", "msg": "This cannot be a legal relational join where\nleft hand side is this/Init (type = {this/State})\nright hand side is this/State (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 19:07:58"}
{"_id": "pch67N9vunJqAFmv6", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | Init in s.^{x,y : State | some (x.trans).y} \n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 09:12:16"}
{"_id": "EHKgg5Kqnx9wJCpFZ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Event.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "jTGcdCvvRHjDP4Z4B", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 03:49:43"}
{"_id": "hKRu6ibzwkhMyhqPh", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\nno Init  implies no State and  all i :Init |  i.trans & State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rDGk2ChxbTxFr6h9H", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {this/Event->this/State}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 14:04:39"}
{"_id": "RKBFgmGx5HunWecjR", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init.^trans_bin = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init in Init.^trans_bin.^trans_bin\n}", "derivationOf": "cHrwdMpyELrzkS2aW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:45:41"}
{"_id": "oNiX8xi2A5zZTP35m", "cmd_i": 2, "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  ~trans.trans in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "CCLFLtSejh6FbdjdJ", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:17:09"}
{"_id": "Ybd89nCYCi4BLWGAt", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | all s: State | s in Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aBA79cdubsuRdkSKg", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:15:28"}
{"_id": "2uJPk9kfieGTRZnRR", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all i:Init | some e:Event | State in e.(i.*trans)\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "CPPNRKtxSdikEoDLY", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 17:31:15"}
{"_id": "7YZcsudRwjH6mZAxr", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | Init.trans:>s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e<:State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "R2ZWco5MTdCE7jA6F", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 20:12:28"}
{"_id": "uQ39cvsuuXcoBBtW8", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | i->s in ^(i.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | e->s in State.trans \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "g5Yam28ce8hpwX5MS", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-14 00:18:02"}
{"_id": "Yiuo9HmJ5S3cdEYo9", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    let trans_bin = {s1, s2 : State | some s1.trans.s2} |\n    Init in ~(*trans_bin).State\n}", "derivationOf": "8KZDGfJXoAPXC9HBW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-24 09:22:57"}
{"_id": "x2GTxERh5EkankXyu", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n \t\t\t\t\t\t\n    all  s:State |some e:Event |  some (trans.(e->s) & Init )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "A4no2EW2Yjm8Bm7xk", "msg": "& can be used only between 2 expressions of the same arity.\nLeft type = {none->none->none}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 11:22:02"}
{"_id": "fpp89MiRmZLHHK44y", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | s in Init && State in ^(s->Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "K2ZN8ryhAvhBSQM2Y", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 15:08:34"}
{"_id": "xJLpvz6oLFSB4MrWL", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\nfun onlyStates[] : set State -> State {\n  \t{ s1,s2 : State | some e: Event | s1->e->s2 in trans } \n  \n}\npred inv4 {\n\tlet ts : onlyStates[] |\n  \t\tall s : State | s in Init.^ts\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qieM9ZiTCknHGNyLP", "msg": "There are 1 possible tokens that can appear here:\n=", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-2 18:02:28"}
{"_id": "pkCBcNzr4MgvuJtW4", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s1 : State |  s1.(Init->Event) in s1.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "99EbgjpqmqHWLzis7", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:02:45"}
{"_id": "yGwGJYqnrYodh7W5r", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event| lone e.~State.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Bifc9f49Hkq8tqmtr", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:47:34"}
{"_id": "2zwXYmMk975xjQfq7", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3et53fXYPBk2v3PgB", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-23 03:29:37"}
{"_id": "MMqqKMWEFjZoAxu5e", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "9MYamBzXX45kcjnau", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-30 19:58:14"}
{"_id": "LTRMkE4ZcSHRtHbtr", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-8 15:43:36"}
{"_id": "iyw9wX7dumrLZEAbj", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some trans.s\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one s : State | no trans.s\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XTqfi7cubkBCW6adC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-8 15:44:57"}
{"_id": "pJhyhx5Bex8vwwccf", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some (Init.trans).s\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | s.*(trans + ~trans)\n}", "derivationOf": "myy4Ez2gexuw2ZQqg", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:25:12"}
{"_id": "YkPAPKWegRFg8Ay8c", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | s.trans.State = Event \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qF3PdB2HQvz2LQi8E", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:32:27"}
{"_id": "MowBjTPyGN6MwwkX2", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = ^(Init.trans).State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "eixJfXuKyWtByui3d", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 02:46:11"}
{"_id": "dhrcsqgeMJfi8XgvA", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in s.~(State.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "vQ9yLqrrqQpwKpDm2", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 22:06:24"}
{"_id": "GmnFc7zKSY4b3eEp5", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | Event.(s.trans) \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "548XeAaAwYnd99Ywe", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-18 22:17:26"}
{"_id": "uuzLqqDiEWLLD58X9", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in State<:Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LYqkNTGW4xPF6SXJW", "msg": "<: is irrelevant because the result is always empty.\nLeft type = {this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-20 08:24:59"}
{"_id": "sAmcrfZ7PE3eH2wE3", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State, e: Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ELxiD2AJKFahaibD9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-20 22:11:15"}
{"_id": "vkdWagFfgfvCC7vhT", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall e : Event | trans.State \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NzEaGyt3Bz2QYJAzE", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:38:32"}
{"_id": "9eZNKC5rNGq9X9jGe", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\talways (all s: State | some s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qDga8fo9C8S8nbisz", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-12 19:59:30"}
{"_id": "FWpdGJicAuiCqLGqX", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-7 06:45:50"}
{"_id": "JB9Yr5iybWfrGxZim", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "r4u98pnDQtyXX9Y7S", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 00:46:44"}
{"_id": "crC5S7MR7ceHZfERH", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x, z, v : State, y : Event | x->y->z in trans and x->y->v in trans implies z=v\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init, y : Event | State in x.*(trans.y)\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jhEe5eSLf4MtgsvSE", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 22:18:42"}
{"_id": "pdDnESWPuHJbDYzB9", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nall e:Event|some s:(State-Init) | some trans.(e->s)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "k8CvBLxEAYJ7qNH4y", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State->this/Event->this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 14:47:08"}
{"_id": "ne5Ra3es7znRdPoT9", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "P5aaXxJZ3sBSTfjse", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-21 11:57:56"}
{"_id": "NW6fDDSoTwJE7BDHx", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 23:05:35"}
{"_id": "KZjRQ6mMgRJTsCNAs", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event |some s:State | lone e.s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "n2iPr8T7jdnNmWSAm", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 14:18:38"}
{"_id": "vWNA3EfK6FpkWW7nH", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\nfun onlyStates : set (State->State) {\n\t{ s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Wwa6ki7swP6fnmxyD", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 01:06:12"}
{"_id": "XAr6y6W46YbW4p7Dk", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2zwXYmMk975xjQfq7", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-23 03:30:42"}
{"_id": "YZsng3uEfiegfsAfW", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, e:Event | some e.(s.trans)\n}\n\n\npred inv6 {\n\tall e:Event | lone e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "Rc4bK6hF4WxzZv6cN", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 22:09:44"}
{"_id": "wbzLSnjN43GNvYQk9", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s : State | some ~s<:trans\n}", "derivationOf": "rs3GDTWigWjpTaFvL", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 07:30:27"}
{"_id": "HSoSgcW6Rbaz5qLSo", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s:State | (s.trans).Event\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8dHtTj4ZX8adp7L7K", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 23:10:25"}
{"_id": "FvHdESyZvs74TkiCa", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  s.trans in State\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "peqf5AR36fxcPczDK", "msg": "The name \"s\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 20:46:47"}
{"_id": "eQAwctCpwT8EX9soi", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  let t = { x : State, y : State | some e : Event | x->e->y in trans} |\n  all u : State | some e : Init | e in u.(^t)\n}\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gtPRwWAGTsaFN7yzP", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:46:35"}
{"_id": "CFCcRGzHLc5FZGrX5", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i :Init | some e:Event| State in e.^(i.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "szahvBTToerPtNqSE", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 14:27:55"}
{"_id": "aeNNSk9sY6gzpHNtP", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | State.~(s.trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "McGZef49Qi4HqwMSy", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 23:52:55"}
{"_id": "gBGdfELzCiKFwR38Y", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { all s:State | some s.trans\n  \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s:State | lone s.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QmqCgE9BehhY3iTdR", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-12-15 16:10:20"}
{"_id": "xWtgxrGJhfFcCh5nJ", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall  s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | some e : Event | e.(s.trans) in State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6GmWCSKZoHBonmp5i", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-1 12:09:13"}
{"_id": "2km3rqSd4vQ5kJYrM", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/ \npred inv5 {\n\tall disj s1,s2 :State |  no ((s1.trans).State) -((s2.trans).State) and no ((s2.trans).State) - ((s1.trans).State)\n}\n\n\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "YepwTkvQkWpvZJEMG", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": []}, "nodePositions": {}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2020-11-19 10:43:59"}
{"_id": "M4iprMBMqJ7s7WcsL", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome Init.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 23:27:39"}
{"_id": "kMiYWwR5fJNkaK2XM", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall s:State,e:Event | lone s.e in trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "D6Sj9zFYYuE7qMWMZ", "msg": "This cannot be a legal relational join where\nleft hand side is s (type = {this/State})\nright hand side is e (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 19:00:09"}
{"_id": "uAXLWGmH9fi9ERSd4", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init <: trans | State in *(s->Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "pnpNh8FMXLNXRY7iC", "msg": "* can be used only with a binary relation.\nInstead, its possible type(s) are:\n{none->none->none->none->none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:51:08"}
{"_id": "TvvrvYcteFE2dZtj3", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tlone Event.(State.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "N7S67DKoxY3qGrfdg", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:24:25"}
{"_id": "JqtxAdD3zSHkK8aAh", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall s:State,e:Event | lone s->e in trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GY3NYzN2vqekgLEcH", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-10 19:01:04"}
{"_id": "9HNLhoByuff5CiscN", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall e:Event | State in e.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event| e in (State.Trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QoDb3kqWqCrHZQ4YZ", "msg": "The name \"Trans\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-11 12:27:00"}
{"_id": "rv9cS9uqpD2gFHZm2", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall e : Event | trans.e\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rF75WDTCjfvXBLoey", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:37:52"}
{"_id": "YNK5ctDjXvzXMPn6i", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init.trans\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "hpCji23viLJZpJR7C", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 23:29:02"}
{"_id": "7Zed4fmD7Tv3pJxAB", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall e : Event | e.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rv9cS9uqpD2gFHZm2", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:37:58"}
{"_id": "2PJcKSkPf96Tiwmek", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \n  \t\n  \tEvent = State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3Jmf7WoaENZKwMmjM", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-21 12:24:01"}
{"_id": "LDHy4R6REgEfMz6E9", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one State\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "gvB2Du37xSP4HCnQW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 01:39:07"}
{"_id": "qQKbkPPpimfyfpHwD", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s: State | s^.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ejvnJZdiHqRQ3FP8F", "msg": "There are 25 possible tokens that can appear here:\n( * @ Int NAME NUMBER STRING String Time ^ all fun iden let lone no none one seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 18:38:47"}
{"_id": "2z6irypG94BXZjmGN", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, e : Event | s in e.(Init.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zbLdqA3q6LkKaXiwk", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-12-30 17:34:33"}
{"_id": "KNNaxdDhzt9ESAo5k", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "uhWXjxy9sT2yXg67W", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:22:16"}
{"_id": "75ohiGiMN3HEp9qDk", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | x.trans in State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "qKPWf4kbXR4EjWimM", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:12:26"}
{"_id": "XtStHJyofFiqScFDs", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n   all i:Init | some e:Event | some  Init and no  (State  - (e.*(i.trans) ))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "RPBz3BoQNFMWRD955", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 17:56:41"}
{"_id": "nkkAsDmpX93HLQ6op", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "os2knvrkCSkYDdCkt", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-21 18:43:57"}
{"_id": "jRyPaT7JrwYeN85YL", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2021-1-14 00:09:18"}
{"_id": "ZTryZEmCphMYHayy4", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "83Lib5yiK5RG6LWxi", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-14 00:10:12"}
{"_id": "MqQEngxxw8d86A4sw", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tsome State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pmCPoXEgwsPPoi5PW", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 03:03:54"}
{"_id": "ocBsCZJQehn5WGCrW", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s1, s2 : State | lone (s1.trans.s2)  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  States = (Init.^trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5BNJ28GLySGWuexyX", "msg": "The name \"States\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 03:52:13"}
{"_id": "XLuRGxEaDJYf9HHAA", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tno s:State | no s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  \tall s1,s2:State | s1 in Init and s2 in Init implies s1=s2 \n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Aw2Xm8ZaHzqXZibZq", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 15:41:03"}
{"_id": "d4aBK5xS68KCmmuEm", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  (State.trans.State & Event) = Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zMbcgtp9ZQQwDdGCX", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:34:34"}
{"_id": "j69MdxbzD2QLcPiy6", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | Event->s in Init.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "d2vSLNpLa23zwbf7P", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 00:15:50"}
{"_id": "g3X8nQDtmTaXhnbia", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s1, s2:State | some e:Event | s1->e->s2 in trans implies s1!=s2\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4o64K7HceCcS6AaWh", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 00:21:00"}
{"_id": "KEb4jRGTHXByheBnp", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some e : Event | x.e->State = State.e->State\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "9ma37exsFHs2duBXa", "msg": "This cannot be a legal relational join where\nleft hand side is x (type = {this/State})\nright hand side is e (type = {this/Event})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-22 14:19:01"}
{"_id": "HCvn5JfLXfmj5sLTH", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone s.trans[e]\n}\n\nfun tr : State -> State { { s1, s2 : State | some e : Event | s1->e->s2 in trans } }\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State in Init.^tr\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e : Event | some s : State | some s.trans[e]\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JyQktvEm8wHxGa7SZ", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-8 16:14:43"}
{"_id": "bz46kpZpL8LnSMz54", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s,s1:State|  no( (s.trans).State  -  (s1.trans).State   )\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "igaKZbMxNrNYhNu4L", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-16 18:48:48"}
{"_id": "xY6iXgeFbaNGtcP7g", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) | State in ^{x,y: State | some x.trans.y}.s\n}", "derivationOf": "aLT9B5j4Pfct2g7i7", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:46:57"}
{"_id": "zhkHp8dPqRxg29uFx", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in State.^trans.n\n}", "derivationOf": "Z2n4QYzmYdWC9pEpP", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-11 13:09:40"}
{"_id": "dw7mocEiJf3jvtiXq", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n \t\t\t\t\t\t\n   \tall s:State-Init |some e:Event |  no s.trans\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n  \n  \n}\n\n\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "Cd29v73EQEcJ2ca4T", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-18 11:31:27"}
{"_id": "dw9pqph6JWDwWiQ6H", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MqQEngxxw8d86A4sw", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 03:04:14"}
{"_id": "FEsQjsXPa55JEsFbQ", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet t = trans | iden in (trans.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4KqGymSs5W7pc9ykd", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {univ->univ}\nRight type = {this/State->this/Event->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:33:24"}
{"_id": "ozavwd3KpRnkxrKSo", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "2xXZsZ3FkYeZkNHGd", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:18:50"}
{"_id": "wCmsuBnyzEgyxewn3", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tState in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nMW6aSfjNWYKQCKq4", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-4 16:41:39"}
{"_id": "JZKgDm6Bc55curtM5", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone (s.trans).Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "AJAAGvn5xxEeL2qF4", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:01:31"}
{"_id": "jgJ2n7ioYpmcCvypc", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | e->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all disj s1, s2: State | all e: Event |some n: State| e->n in s1.trans and e->n in s2.trans implies n.~trans.s1 = n.~trans.s2\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "eXp88jP74mqj2veBv", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:38:23"}
{"_id": "ZC2AYi59pSBdqqM5h", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State, e: Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "oNheSkZPiMPSGNmnp", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-12-20 22:11:44"}
{"_id": "hJHp7fgXANo5RoZsq", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "DTdSnFe6W2gGEWN2A", "msg": "The \"all x\" construct is no longer supported. If you know the range of possible values of x, consider rewriting it as \"x == set_of_all_possible_values\".", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-19 15:22:50"}
{"_id": "AKTGPa7kq6D6WdddW", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State, e : Event | one (e.s).trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ShYciu7xpTR8qpT5j", "msg": "This cannot be a legal relational join where\nleft hand side is e (type = {this/Event})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 11:35:17"}
{"_id": "cvPtsZmn4aAhei4YC", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rXLpMQR3Q7mvNG9kD", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-25 16:58:22"}
{"_id": "L9Q3A4JLqoGedKP9Q", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { lone trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.Init\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7sZiTppNadah3kqRw", "msg": "This cannot be a legal relational join where\nleft hand side is this/State (type = {this/State})\nright hand side is this/Init (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 11:15:29"}
{"_id": "qya6ZGRfGDyhENbED", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | s.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e<:State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ZvyK2NW5fRrejr8TR", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 20:07:53"}
{"_id": "3SSLmtfiD2qytTFgK", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    all i : Init | i.^{s1, s2 : State | s1->Event->s2 in trans} = State\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "922y24tDXo3pH6Dny", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:35:21"}
{"_id": "eCnxjJi2ko6CmGHFk", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (State-s).trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "otLCnDexmaShWFNMx", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 02:59:02"}
{"_id": "uRxJ3oxGWJ6PY9Yss", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t(State.trans).~(State.trans) in iden\n}", "derivationOf": "iCrndpWGfmrkedjcH", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-11 14:18:51"}
{"_id": "y9Poip8qbfosrhY8v", "cmd_i": 1, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State -> lone s.trans.Event\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^trans.Event = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SKBZRDTpqP5z8NBfP", "msg": "There are 3 possible tokens that can appear here:\n,  { |", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 10:03:40"}
{"_id": "fsWYMiGwJXtNX38WR", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tlet s = State <: State.trans | s.~s in iden \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "FxDeib4FiuakwkabA", "msg": "<: is irrelevant because the result is always empty.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:16:17"}
{"_id": "jxotuLphtasz3iZrC", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | State.trans in x.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "C7rwP3kHwGJwCBkC9", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:16:18"}
{"_id": "Cf4Rt8x2yQftJwuni", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State | s in trans.State implies s in ^trans.State\n}", "derivationOf": "siENELY8eTJNJQ3zm", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/State->this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:54:55"}
{"_id": "KbSyMPKeWpLGBAvXC", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State |some e: Event | s.trans implies lone e in trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "XGuNpKWtks5hb2a3Y", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 20:45:24"}
{"_id": "7q2PWDpcPDyePzcr8", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | x.trans in State.trans\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "9LdF6aCQiMRTGQwnR", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 14:15:48"}
{"_id": "JP9W6qWvje7R7ky9R", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some s.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "cgZwuepgtoFkwzrKF", "msg": "The name \"s\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-19 09:17:15"}
{"_id": "qkrx2AZpMbyKbuNNA", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    all i : Init, s : State | some i.*{s1, s2 : State | s1->Event->s2 in trans}.s\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "9m9MtnBjT2X5BFtaJ", "msg": "This cannot be a legal relational join where\nleft hand side is i . * {s1,s2 | s1 -> this/Event -> s2 in (this/State <: trans)} (type = {univ})\nright hand side is s (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:36:43"}
{"_id": "LYqkNTGW4xPF6SXJW", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tEvent in State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "msg": "Subset operator is redundant, because the left and right subexpressions are always disjoint.\nLeft type = {this/Event}\nRight type = {this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-20 08:24:44"}
{"_id": "rukEnAWMDYk2JsApq", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : Init | State in State.^(s->Event.(s.trans))\n}\n\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s, s1 : State | (s.trans).State = (s1.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall n : State-Init | Init in ^(State.trans).n\n}", "derivationOf": "znsySdq62KhsRGq3H", "msg": "^ this/State . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 15:09:38"}
{"_id": "BSMrzw93zgYTRcKqp", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "NFuPnLBaGsmFTWtjz", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:35:42"}
{"_id": "zXumZKYYmJfvXQ67u", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "TNHtdGZL3ixZm2kM9", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-9-12 09:48:43"}
{"_id": "4r42siHDsS7mAPAyM", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x, y : State | all e : Event | some x->e->y implies some y->e->y\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "mwZtWSg3hjo97sPK3", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-23 08:27:27"}
{"_id": "aRFAuP7FqWdMr2jaY", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | one (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "G7MJgu5TgfTAN9voo", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-16 03:48:07"}
{"_id": "K4mGS8F5NQBoXWkLD", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init | s in State.(i.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "izADnr3Qin2Knzzt2", "msg": "The join operation here always yields an empty set.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 22:50:41"}
{"_id": "97aAZ5DTR5SoCNCEz", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "QgmmhPrFwm6naMTAv", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 23:44:01"}
{"_id": "KNbHSaP9A9pcAbzoZ", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {lone trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WFo5tp7Yd2tSPRYW8", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-17 21:08:45"}
{"_id": "JS3FXgmmmKmmzi7ii", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { lone State.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7ogDPFmFHjx62CAHa", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-17 21:15:53"}
{"_id": "pvEzzmGzBq4cD9qS9", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { all s : State , e : Event | lone e.(s.trans) \n\n}\n\nfun adj: State -> State {\n  {x,y : State | some (x.trans).y }\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { all s: State | some i: Init | i.^adj\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "up4HdAn7KA2vZys8d", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-9 18:01:16"}
{"_id": "NovJMBPhYX8LtvDMj", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans}\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.*adj \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kQDXfEwCd67LuAYWL", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:47:41"}
{"_id": "yiuN5su4uued23Paf", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | one (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aRFAuP7FqWdMr2jaY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-16 03:48:10"}
{"_id": "bZBgCnWwjDaMB9vEh", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone x.trans.y.State\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "rCFhw8XqrcXsF3Ryf", "msg": "This cannot be a legal relational join where\nleft hand side is x . (this/State <: trans) . y (type = {none})\nright hand side is this/State (type = {this/State})", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-16 21:56:49"}
{"_id": "NDbav4v9jxif8Lns3", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome (Event.(State.trans))\n}", "derivationOf": "EiBXAr6CHBDigRRre", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 14:24:15"}
{"_id": "JpuLDi3m79Lpk2bSW", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | some i:Init | s in i.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3fLcPeqFMjwKLW3Sq", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-25 20:33:21"}
{"_id": "f3DhJizKrWCuJnhEy", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nkkAsDmpX93HLQ6op", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-21 18:44:07"}
{"_id": "s8Kw3LsvS6MBbvmHe", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "JwJbbRrXnQ8NRTF7h", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-12 19:57:54"}
{"_id": "m7Agk3F8Tdj7c7YkM", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 : State, e : Event | e.(s1.trans) = e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ed3JdhyytSauaGsK4", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-14 09:20:54"}
{"_id": "KBa2WXG9sCtxaBfT5", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tiden[State] in trans.State.Event\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "ce38Aw9yGXHbbwmZp", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-10 23:48:30"}
{"_id": "dhBDxrdKeMpryPzt2", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \tlet t = {x,y : State | some z : Event | x->z->y in trans} |\n\tall s : State | Init in s.~t\n}", "derivationOf": "BwN6ec5F6Shi9Qygr", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 07:32:22"}
{"_id": "yaTqagSpRsATsBEr4", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init |  some (Event.^(i.trans))\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "58DPtNbPepv3EGKnz", "msg": "^ i . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 22:55:05"}
{"_id": "q5sh6eEjWhDiSr9Xi", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone s.trans.State \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2KL5MpfP3bY2xAEDE", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 12:03:50"}
{"_id": "4sAeHPMgh5RZs8z5v", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\n\npred inv4 {\n \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}\n\n\ncheck {inv4} for   4", "derivationOf": "Yo7pxpsFHc7gkSLxh", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-17 19:10:50"}
{"_id": "oCXZSEqNnn6XwwLwX", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, i:Init |  some i.^(s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qWDGtc6fMsSy7iXaB", "msg": "^ s . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 22:53:50"}
{"_id": "GMydmv9ByM4uzR7Yy", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State,e:Event | lone e.(s.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Event.(Init.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State,e:Event | some e.(s1.trans) implies some e.(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "k4NLwWpmp9YNpJmoc", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 14:16:22"}
{"_id": "xJ3xS7tXmxPWWjiHx", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kDjDbmGX58XtXbxEX", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-10 18:58:21"}
{"_id": "n2iPr8T7jdnNmWSAm", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State| some s2:State | no (((s.trans).s2) - Event)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "D23eAJc76BtkikdYo", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-9 14:08:04"}
{"_id": "w9Tsd4HugF2wddy4q", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State, e: Event | lone s.trans[e]\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \tState in Init <: ^(trans[Event])\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4n6aq9bn7hEbRz8TX", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {none->none}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-9-12 09:57:47"}
{"_id": "PG8cnCfGFBjfreYGe", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tall s:State | no s.trans\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "5og8aFLFgNrEXABHT", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-21 11:55:41"}
{"_id": "5voXyZo9YWpuuRSKa", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans}\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.*adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "fgzd75eR2NGdSykJS", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:41:21"}
{"_id": "4o64K7HceCcS6AaWh", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s1, s2:State | some e:Event | s1->e->s2 in trans \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "dsdBpCRTc53qbRrZY", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-1-8 00:20:31"}
{"_id": "wvsjSGR7cwsumHswZ", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | s in ^(Init.trans).State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "48FyGrExvpnhAsZBy", "msg": "^ this/Init . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-23 02:58:23"}
{"_id": "WFRwc3szp5x2Kx2vv", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i : Init | Event.(i.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xHroz9GtXaWSzhnMp", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:08:15"}
{"_id": "LaDN8c8ps5b587FJK", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MRpRSsbHkGGwCfWyC", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-12 20:02:43"}
{"_id": "NKGfFbnMi86zCF2mK", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some y : State | some x->Event->y\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Fx6nS7Yie27xTsdJ3", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:44:45"}
{"_id": "yKxuCysauLBb6ptAh", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State, e: Event | lone e.(s.trans)\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\n\nfun function: State->State {\n  \n  {s1, s2: State | some (s1.trans).s2}\n}\n\n\npred inv4 {\n  State in Init.^function\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1,s2: State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | some e.(State.trans)\n  \n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tsome i: Init, r : (i.^function) | i in r.^function\n}", "derivationOf": "feCXvNyQq4cFvnSy6", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:23:50"}
{"_id": "eNcsHgDWCoxii4LBB", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)  \n}\n\nfun adj : State -> State {\n\t{x, y : State | some e : Event | x -> e -> y in trans}\n}\n\n\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.*adj\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n  \tall e : Event | some State.trans.State <: e\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nZm9RmSSMPW9osTri", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 10:39:56"}
{"_id": "YLjhajnjbWrGpRzmG", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tlone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kceKivWetAiKF6WRC", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-18 15:04:10"}
{"_id": "aDDTyHxvBSauDAMfA", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\nall s: state | f : Event | lone n: State | f->n in s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aipRjpbonzc6vBfHH", "msg": "There are 38 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { } ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:16:26"}
{"_id": "rJPtqFiHsbCzBgCAu", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tno s:State | no s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8uTw54mmMHWM6qj3L", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-11-11 15:39:39"}
{"_id": "aEqM5kCT5KsyzqQe3", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.(^{ s, ns : State | s->Event->ns in trans }) = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:25:44"}
{"_id": "Tn5J944khh5yQmcud", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  \n  some (State.trans & (Event->State))\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | ~(State.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n\tInit.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s : State | (State.trans).State = (s.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n\npred inv7 {\n\n}", "derivationOf": "RDWuEpJxEpPfjkKHM", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 23:41:15"}
{"_id": "wYTKjDpwoLjJSCFab", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State |one e: Event | lone s.trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pshyqtWJpDRfRwXaN", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-7 18:36:40"}
{"_id": "bbNwHEKfuot4Gd8Yn", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | some e : Event | lone (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  State.trans = Event->State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nDeCNwS9BkRmkMim7", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:22:58"}
{"_id": "FxDeib4FiuakwkabA", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\t\n  \tlet s = State <: trans | s.~s in iden \n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "GQ4ts7q8PvwjqCejS", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 14:15:51"}
{"_id": "HmHxnSvgE4mTbBS7d", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 { one Init\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2Ecg6c3ZbteAMPqoq", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-17 20:52:19"}
{"_id": "v2atha5YJjTgkbWjE", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State, i : Init | i->s in ^(s.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, s1 : State | (s.trans).State = (s1.trans).State \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | e->s in State.trans \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "uQ39cvsuuXcoBBtW8", "msg": "^ s . (this/State <: trans) is redundant since its domain and range are disjoint: {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-14 00:18:47"}
{"_id": "szahvBTToerPtNqSE", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall i :Init | State in ^(i.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4YYXkyt5YbqRz4zTm", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-9 14:27:01"}
{"_id": "4qHrY2nfudoyc4rDB", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \t\n  \tall s,s1:State,e:Event | s->e->s1 in trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n \n  \n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Pww9H2wHb6k6hjyke", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 19:10:13"}
{"_id": "ppPGfBw94sXXppuxS", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans:>State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State, e:Event | lone e <: s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "M8RxHsB7kw4YJ6JxM", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 15:46:31"}
{"_id": "yFihBE86oNTCvQynn", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {all x,y : State, some z : Event | x->z->y in trans}\n\tall s : State | some Init.(s.^t)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "3x7pt5pHn6ykjwHCK", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:49:07"}
{"_id": "DqRFTpw2CBhhKgc2T", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | some e : Event | one (s->e)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  State.trans = Event->State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "J9kkF6x8bLyBzWszs", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 11:23:35"}
{"_id": "yLpFvhAPGELvhAGZx", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "PsYewngzku5RTsRWL", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 03:34:47"}
{"_id": "seqtTySQNuX2zwXpT", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s1 : State , some s2 : State | s1 -> s2 in trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "iwtCkJHryc85mcxph", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-19 15:43:29"}
{"_id": "pybpBamcKhoHtAgT9", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall s:State,e:Event | lone s.trans.e \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "kMiYWwR5fJNkaK2XM", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-10 19:00:23"}
{"_id": "biFRb2BNALLaXD4JF", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  }\n\t\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2:State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall s:State | some (s.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2FFGDYKaxfaWrbijQ", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-25 20:49:40"}
{"_id": "83Lib5yiK5RG6LWxi", "cmd_i": 5, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tEvent in State.trans\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "e57tyEX748KbHAnZp", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/Event}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-14 00:10:00"}
{"_id": "PTqivmF6vcuu3Ad5H", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s:State | lone e:Event |  e->s in s.trans\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "aizYWpcR2CXWu6g8f", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-11-20 18:46:17"}
{"_id": "BpeR39ELpi48bYubJ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s: State | s.trans.s\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "m5LcLoxndSsEMmvPR", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:19:02"}
{"_id": "QCiggZ2nWMKwAecmb", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s1, s2 : State, e1, e2 : Event | (s1->e1->s2 in trans) implies ((s2->e2->s1 in trans) and (s1 in s1.trans))\n}", "derivationOf": "oNpdsu2e9XeCvM9MC", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-23 04:23:09"}
{"_id": "xCfF5sug5a9PZG9Yi", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\talways one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State | lone s.trans.State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^{x, y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s: Event.(State.trans) | s in ^{x, y: State | some (x.trans).y}.s\n}", "derivationOf": "ntSHSZYX88oquqAC8", "original": "zoEADeCW2b2suJB2k", "theme": {"currentFramePosition": {}, "currentlyProjectedSigs": [], "generalSettings": {"currentLayout": "breadthfirst", "metaPrimSigs": [{"parent": null, "type": "univ"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}, {"parent": "univ", "type": "Event"}, {"parent": "univ", "type": "Int"}, {"parent": "univ", "type": "State"}, {"parent": "univ", "type": "String"}, {"parent": "null", "type": "univ"}, {"parent": "Int", "type": "seq/Int"}], "metaSubsetSigs": []}, "nodePositions": {"State0": {"x": 598.9921875, "y": 265.3333333333333}, "State1": {"x": 598.9921875, "y": 132.66666666666666}}, "relationSettings": {"edgeColors": [{"color": "#0074D9", "relation": "trans"}], "edgeStyles": [{"edgeStyle": "solid", "relation": "trans"}], "showAsArcs": [{"relation": "general", "showAsArcs": true}, {"relation": "trans", "showAsArcs": true}, {"relation": "State", "showAsArcs": true}, {"relation": "this/Init:State", "showAsArcs": true}, {"relation": "Event", "showAsArcs": true}], "showAsAttributes": [{"relation": "trans", "showAsAttributes": false}]}, "sigSettings": {"nodeBorders": [{"border": "solid", "type": "univ"}, {"border": "inherit", "type": "Event"}, {"border": "inherit", "type": "Int"}, {"border": "double", "type": "this/Init:State"}, {"border": "inherit", "type": "State"}, {"border": "inherit", "type": "seq/Int"}, {"border": "inherit", "type": "general"}], "nodeColors": [{"color": "#2ECC40", "type": "univ"}, {"color": "inherit", "type": "Event"}, {"color": "inherit", "type": "Int"}, {"color": "inherit", "type": "this/Init:State"}, {"color": "inherit", "type": "State"}, {"color": "inherit", "type": "seq/Int"}, {"color": "inherit", "type": "general"}], "nodeShapes": [{"shape": "ellipse", "type": "univ"}, {"shape": "inherit", "type": "Event"}, {"shape": "inherit", "type": "Int"}, {"shape": "inherit", "type": "this/Init:State"}, {"shape": "inherit", "type": "State"}, {"shape": "inherit", "type": "seq/Int"}, {"shape": "inherit", "type": "general"}], "nodeVisibility": [{"type": "univ", "visibility": false}, {"type": "Int", "visibility": true}, {"type": "seq/Int", "visibility": true}, {"type": "general", "visibility": false}, {"type": "Event", "visibility": true}, {"type": "this/Init:State", "visibility": false}, {"type": "State", "visibility": false}]}}, "time": "2021-1-12 21:52:01"}
{"_id": "nxoRaLfFZgZJGQJwt", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone s.trans.e\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "mnSikkKTQrs2CmRBB", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event->this/State}\nRight type = {this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 14:19:17"}
{"_id": "fj9iNv23ovtsT9QMj", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s: State | ~(s.trans).(s.trans) in iden\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s, ss: State | s.trans.State = ss.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event in State.trans.State\n}\n\n\npred inv7 {\n  all s: Event.(State.trans) - Init | Init in ^{x,y: State | some x.trans.y}.s\n}", "derivationOf": "gXWvGbHufkzDwqdPz", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-19 08:44:38"}
{"_id": "spQQGv48FjstTfgWM", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall x : State | some (x.trans)\n}\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3t86GerjQ3BaRGMsh", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-22 13:49:13"}
{"_id": "db8YJeiYcZXSutMNc", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | s.(State.~trans) in Event\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Pgp6BuenPmRSNXJ3L", "msg": "~ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-11-20 22:05:08"}
{"_id": "LjS53b9SSaf2aCa35", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n  \t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State , e:Event| lone e->State & s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State, s1:State | s.trans.State = s1.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tState.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "KZRpBcygnZmZNBu4c", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-8 21:39:31"}
{"_id": "sYSTjKMnRydgTWAn4", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tInit.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "SYBBmboM9dWep7Tp2", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 18:40:09"}
{"_id": "9F5cq8h56ScctxTqW", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all x : State, y : Event | lone y.(x.trans)\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all x : Init | State in lone Event.*(x.trans) \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "PswcNRP8G6HvFQAYD", "msg": "There are 29 possible tokens that can appear here:\n# ( * @ Int NAME NUMBER STRING String Time ^ all disj fun iden int let lone no none one pred seq some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:13:53"}
{"_id": "6QSXdhRZAERD9gRf7", "cmd_c": true, "cmd_i": 4, "cmd_n": "inv5Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s1 : State |  some ((Init.trans)).s1\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\nEvent = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "x7y7GAkykeZdY6W83", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-13 23:09:42"}
{"_id": "tmSn2s59o2vpMWLXQ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n all s:State | some s. trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall e:Event, s:State| lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s1 : State |  ^(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "M4YBsDHGQrsbGrost", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-13 22:58:00"}
{"_id": "8Mg2ZnEtrEeF8m3my", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone trans.s\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "geoQP7b8ymvZZ6nTc", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:34:31"}
{"_id": "JXYaRG4arypHoi8nT", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \t\n\tall s:State, e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | s in Event.(Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s:State | Event in State.~(s.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\t\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "Sjm9eppMBpeAJ4KeT", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-18 03:28:35"}
{"_id": "QQBfpv6kWdWrHekoa", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 10:30:42"}
{"_id": "nWdeoDaoeuJntSDKC", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 \n  all i:Init | some e:Event | no  (State  - e.*(i.trans) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "7FSyKeL6Yj7GujK8S", "msg": "There are 1 possible tokens that can appear here:\n.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 17:54:30"}
{"_id": "i9YZvasXZuqGpBAcE", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s : State, e : Event | s->e in trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "nS97m7XM7awPpsSnd", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 03:55:35"}
{"_id": "7WGctuZADGtsayTtZ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State | lone (s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 { \n\tall s:State | s in (Init.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "4QiLT296NhEketr3s", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-1-8 19:35:01"}
{"_id": "vswc7uLTHNSi9BnYa", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n    trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n    one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n    all e : Event, s : State | lone e<:s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n    Init.*trans_bin = State\n}\n\nfun trans_bin : State -> State {\n    {s1, s2 : State | s1->Event->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n    all s : State | s.trans.State = State.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n    State.trans.State = Event\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n    \n}", "derivationOf": "4pppPP2LoAherGeT3", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:31:49"}
{"_id": "XhiAk9c8ob8epjFJr", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some Event.(s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "LHiLPRn8sXLTCDfJK", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-12 17:05:17"}
{"_id": "h4gXg4Y3djvxK8gNE", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  all s : State | (s in Init.(^onlyStates)) implies (Init in s.~(^onlyStates))\n}", "derivationOf": "ozavwd3KpRnkxrKSo", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:19:59"}
{"_id": "PW7NCTCBwbyxvzBs3", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s1,s2:State | all e:Event | lone s1->e->s2\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xjGprvcZzctXBsh9o", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 00:14:15"}
{"_id": "m7L4Le2u2WrsB35s7", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | Init.^{x,y : State | some x.trans.y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pCqCRTpQrBxRfQETM", "msg": "This variable is unused.", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 13:17:09"}
{"_id": "zoEPq3JRAhrb9aGKw", "cmd_i": 0, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tlet k = trans.State | iden(State) in ~k.k\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "3FqgMFt3ArtaaSRPD", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{univ->univ}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 13:44:01"}
{"_id": "5MfhKu9rifcPbmXKt", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one State\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-5 01:38:21"}
{"_id": "NskXL4RA63WcFdojN", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n some e: Event | all s: State | s in s.^trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  all e: Event | \n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "W8vEw6Adcg99d642q", "msg": "There are 37 possible tokens that can appear here:\n! # ( * @ Int NAME NUMBER STRING String Time ^ after all always before disj eventually fun historically iden int let lone no none once one pred seq set some sum this univ { ~", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:13:00"}
{"_id": "EQZFfH3QATYbbJqWX", "cmd_c": true, "cmd_i": 6, "cmd_n": "inv7Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone (e <: s.trans)\n}\n\nfun onlyStates : set (State->State) {\n\t{ s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in Init.^onlyStates\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall disj s1, s2 : State | State.~(s1.trans) = State.~(s2.trans)\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s : State | some (e.(s.trans))\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t(all s : (State.^onlyStates - Init) | Init in s.^onlyStates)\n}", "derivationOf": "DCn64uDPKRsBwhxos", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-14 01:16:37"}
{"_id": "bJA4xudpu8L5rvYYj", "cmd_i": 4, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s: State | some e: Event | e->s in Init.trans\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2: State | all e: Event |some n: State| e->n in s1.trans = e->n in s2.trans\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n}", "derivationOf": "Dg5dcAJCjxYubJ4nk", "msg": "= can be used only between 2 expressions of the same arity, or between 2 integer expressions.\nLeft type = {PrimitiveBoolean}\nRight type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 21:35:30"}
{"_id": "zxHg2Et857Yb3RGG3", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-1-9 03:22:24"}
{"_id": "gkm2p3mAmiaGASX4x", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s: State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s: State |one e: Event | lone s->e in State\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "2oMBfxZ4xZLKEfTvj", "msg": "This must be a set or relation.\nInstead, it has the following possible type(s):\n{PrimitiveBoolean}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-7 18:37:30"}
{"_id": "C4mzmxyuPGqK6MNyD", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | s in Init.^(Event.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "B9G4zDJrrXdJD7Aex", "msg": "The join operation here always yields an empty set.\nLeft type = {this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-12-30 20:30:38"}
{"_id": "EesnDRRanh2YJnyTs", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 { some trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "zoEADeCW2b2suJB2k", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-9 17:21:09"}
{"_id": "9SJsYDq6LMZzeJXwy", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 { \n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State, s1:State,e:Event, t:trans | s->e in trans \n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "t67TwGBaQSRJdDH3e", "msg": "in can be used only between 2 expressions of the same arity.\nLeft type = {this/State->this/Event}\nRight type = {this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-21 12:17:52"}
{"_id": "Cpqr5md9QPJwGxe2Q", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State | lone s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  Init.^{x,y: State | some (x.trans).y} = State\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  \n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "MMvEoKRAotySmK8ip", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-5 11:25:15"}
{"_id": "AJAAGvn5xxEeL2qF4", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "NM3x3oDiJGf5ZXKZB", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2019-10-17 09:59:32"}
{"_id": "k7uMHyAFXTmqvPnqp", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "w3HyFPdSDBCoAwLbN", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-26 09:24:05"}
{"_id": "6rtKGfaywynzb5GAo", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  \tlet t = {all x,y : State, some z : Event | x->z->y in trans}\n\tall s : State | State in Init.*(s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "FWwF66DT9RZEpP4wd", "msg": "There are 8 possible tokens that can appear here:\nNAME disj exh part private seq this var", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:48:29"}
{"_id": "dStAm2fTogjf4XykS", "cmd_i": 6, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\t\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1,s2 :State | (s1.trans).State = (s2.trans).State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e:Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\tall s:State-Init | Init in e.^(s.trans)\n}", "derivationOf": "yEYWyXTeEnDNLHD4n", "msg": "The name \"e\" cannot be found.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 00:21:28"}
{"_id": "sjgCKpDB3nNMoHHja", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \tall s:State | some s.trans \n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n  \tall e:Event, s:State | lone e.(s.trans) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 \n  all i:Init | some e:Event |  State in  (State & e.*(i.trans) )\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "WMPxheBdmkHihMW5J", "msg": "There are 1 possible tokens that can appear here:\n.", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-16 17:54:00"}
{"_id": "r2gWF7J4bEvKbEz2F", "cmd_i": 2, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State | lone ^s.trans\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "qdqSnQGizCZDBCyAg", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-12 11:10:35"}
{"_id": "pSyogMv5Jp29pPmG6", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  trans.State.Event = State\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  all s : State | Init.^{x,y : State | x.trans.y} = Evebt\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "8dn3bA2yHFi5XPGZr", "msg": "This must be a formula expression.\nInstead, it has the following possible type(s):\n{this/Event}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2020-11-5 13:16:57"}
{"_id": "n44np5Q22WeCD7YJE", "cmd_c": true, "cmd_i": 1, "cmd_n": "inv2Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\nhttp:\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all x : State | some x.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  all x, y : Init | x = y\n\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "xW8jZkNo4SBYpaJJ5", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-16 21:37:27"}
{"_id": "WQ86ww2iFq3BEc3Bv", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s:State,e:Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tState in {x:State | some (Init.^trans).x}\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "wHRXbByCAxkbtotBH", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2019-10-17 10:53:21"}
{"_id": "L3oX7qSmqK7xMq2kW", "cmd_c": true, "cmd_i": 0, "cmd_n": "inv1Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  some State.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "pwxvanJ7AqNxzwv2p", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2021-1-12 00:45:46"}
{"_id": "jintSqnxD6dfaxoq3", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  \n  all s : State | some s.trans\n\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\t\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n  all s : State | lone s.trans\n\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "6zBQneKXefepZSFuv", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2020-11-12 09:51:05"}
{"_id": "HH2gAJLE3YGz49xdH", "cmd_c": true, "cmd_i": 2, "cmd_n": "inv3Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n  all s : State | some (s.trans)\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n  one Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  all s : State, e : Event | lone(e.(s.trans)) \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n  State = Init.(^onlyStates)\n}\n\nfun onlyStates : set (State -> State) {\n  { s1, s2 : State | some e : Event | s1->e->s2 in trans }\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n  all s1, s2 : State | State.(~(s1.trans)) = State.(~(s2.trans))\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n  Event = (State.trans).State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n  \n}", "derivationOf": "y8H7pGhdfALCzy5wp", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-23 04:27:33"}
{"_id": "xSFtexcSQsqcPnadq", "cmd_c": true, "cmd_i": 5, "cmd_n": "inv6Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\t\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\t\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\tall s1, s2 : State | s1.trans.State = s2.trans.State\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some s1 : State | e in s1.trans.State\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "jjy3h3t7Fu432QWBq", "original": "zoEADeCW2b2suJB2k", "sat": 0, "time": "2020-11-19 09:15:56"}
{"_id": "NAZeg9iBDknEnTKDC", "cmd_c": true, "cmd_i": 3, "cmd_n": "inv4Ok", "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s : State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n\tall s : State, e : Event | lone e.(s.trans)\n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s : State | State in Init.*(s.trans)\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\t\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\tall e : Event | some e.(State.trans)\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\t\n}", "derivationOf": "YxzbZ5Zga22QxjsXW", "msg": "The value of this expression does not contribute to the value of the parent.\nParent's relevant type = {this/State->this/State}\nThis expression's type = {this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": 1, "time": "2019-10-17 10:42:38"}
{"_id": "ThGGCNSpP2yXSRXqZ", "cmd_i": 3, "code": "/*\nA labeled transition system (LTS) is comprised by States, a sub-set\nof which are Initial, connected by transitions, here represented by \nEvents.\n*/\nsig State {\n        trans : Event -> State\n}\nsig Init in State {}\nsig Event {}\n\n/*\nThe LTS does not contain deadlocks, ie, each state has at least a \ntransition.\n*/\npred inv1 {\n\tall s:State | some s.trans\n}\n\n/*\nThere is a single initial state.\n*/\npred inv2 {\n\tone Init\n}\n\n/*\nThe LTS is deterministic, ie, each state has at most a transition for each event.\n*/\npred inv3 {\n  \n}\n\n/*\nAll states are reachable from an initial state.\n*/\npred inv4 {\n\tall s:State | Event->s in ^trans.Init\n}\n\n/*\nAll the states have the same events available.\n*/\npred inv5 {\n\n}\n\n/*\nEach event is available in at least a state.\n*/\npred inv6 {\n\n}\n\n/*\nThe LTS is reversible, ie, from a reacheable state it is always possible \nto return to an initial state.\n*/\npred inv7 {\n\n}", "derivationOf": "j69MdxbzD2QLcPiy6", "msg": "^ can be used only with a binary relation.\nInstead, its possible type(s) are:\n{this/State->this/Event->this/State}", "original": "zoEADeCW2b2suJB2k", "sat": -1, "time": "2021-1-14 00:16:01"}