./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f7cb1fb9d530fed5cffc0369d2ffc038bc6f50c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:18:24,767 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:18:24,769 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:18:24,779 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:18:24,779 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:18:24,780 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:18:24,781 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:18:24,782 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:18:24,784 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:18:24,785 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:18:24,785 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:18:24,786 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:18:24,786 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:18:24,787 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:18:24,788 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:18:24,788 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:18:24,789 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:18:24,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:18:24,792 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:18:24,793 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:18:24,794 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:18:24,795 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:18:24,797 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:18:24,797 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:18:24,797 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:18:24,798 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:18:24,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:18:24,800 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:18:24,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:18:24,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:18:24,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:18:24,802 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:18:24,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:18:24,802 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:18:24,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:18:24,803 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:18:24,804 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 12:18:24,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:18:24,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:18:24,815 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:18:24,815 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:18:24,815 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:18:24,815 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:18:24,816 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:18:24,816 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:18:24,816 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:18:24,816 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:18:24,816 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:18:24,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:18:24,816 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:18:24,817 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:18:24,817 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:18:24,817 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:18:24,817 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:18:24,817 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:18:24,817 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:18:24,817 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:18:24,818 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:18:24,818 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:18:24,818 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:18:24,818 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:18:24,818 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:18:24,818 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:18:24,819 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:18:24,819 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:18:24,819 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:18:24,819 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:18:24,819 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:18:24,820 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:18:24,820 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f7cb1fb9d530fed5cffc0369d2ffc038bc6f50c [2018-11-28 12:18:24,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:18:24,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:18:24,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:18:24,862 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:18:24,862 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:18:24,863 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-28 12:18:24,918 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/data/ee48a9c3a/8d84e3a5669a41bdaf128034e0f98795/FLAG339b47900 [2018-11-28 12:18:25,298 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:18:25,299 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-28 12:18:25,307 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/data/ee48a9c3a/8d84e3a5669a41bdaf128034e0f98795/FLAG339b47900 [2018-11-28 12:18:25,319 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/data/ee48a9c3a/8d84e3a5669a41bdaf128034e0f98795 [2018-11-28 12:18:25,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:18:25,322 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:18:25,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:18:25,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:18:25,327 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:18:25,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:18:25" (1/1) ... [2018-11-28 12:18:25,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75eb1ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:18:25, skipping insertion in model container [2018-11-28 12:18:25,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:18:25" (1/1) ... [2018-11-28 12:18:25,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:18:25,362 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:18:25,498 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:18:25,504 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:18:25,591 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:18:25,607 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:18:25,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:18:25 WrapperNode [2018-11-28 12:18:25,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:18:25,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:18:25,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:18:25,608 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:18:25,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:18:25" (1/1) ... [2018-11-28 12:18:25,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:18:25" (1/1) ... [2018-11-28 12:18:25,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:18:25,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:18:25,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:18:25,657 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:18:25,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:18:25" (1/1) ... [2018-11-28 12:18:25,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:18:25" (1/1) ... [2018-11-28 12:18:25,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:18:25" (1/1) ... [2018-11-28 12:18:25,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:18:25" (1/1) ... [2018-11-28 12:18:25,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:18:25" (1/1) ... [2018-11-28 12:18:25,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:18:25" (1/1) ... [2018-11-28 12:18:25,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:18:25" (1/1) ... [2018-11-28 12:18:25,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:18:25,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:18:25,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:18:25,712 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:18:25,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:18:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:25,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:18:25,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:18:26,775 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:18:26,775 INFO L280 CfgBuilder]: Removed 173 assue(true) statements. [2018-11-28 12:18:26,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:18:26 BoogieIcfgContainer [2018-11-28 12:18:26,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:18:26,776 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:18:26,776 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:18:26,780 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:18:26,780 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:18:26,780 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:18:25" (1/3) ... [2018-11-28 12:18:26,782 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@532060c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:18:26, skipping insertion in model container [2018-11-28 12:18:26,782 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:18:26,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:18:25" (2/3) ... [2018-11-28 12:18:26,782 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@532060c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:18:26, skipping insertion in model container [2018-11-28 12:18:26,782 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:18:26,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:18:26" (3/3) ... [2018-11-28 12:18:26,784 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-28 12:18:26,831 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:18:26,831 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:18:26,832 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:18:26,832 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:18:26,832 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:18:26,832 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:18:26,832 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:18:26,832 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:18:26,832 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:18:26,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states. [2018-11-28 12:18:26,892 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 459 [2018-11-28 12:18:26,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:26,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:26,901 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:18:26,901 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:18:26,901 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:18:26,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states. [2018-11-28 12:18:26,912 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 459 [2018-11-28 12:18:26,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:26,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:26,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:18:26,913 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:18:26,920 INFO L794 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 202#L-1true havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 382#L116-2true [2018-11-28 12:18:26,921 INFO L796 eck$LassoCheckResult]: Loop: 382#L116-2true assume !!(add_history_type_~var~0 < 3); 350#L117true assume !(0 == add_history_type_~history_id); 185#L123true assume !(1 == add_history_type_~history_id); 462#L129true assume !(2 == add_history_type_~history_id); 153#L135true assume !(3 == add_history_type_~history_id); 152#L135-2true add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 382#L116-2true [2018-11-28 12:18:26,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:26,926 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 12:18:26,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:26,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:26,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:26,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:26,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:27,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:27,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1278004263, now seen corresponding path program 1 times [2018-11-28 12:18:27,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:27,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:27,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:27,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:27,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:27,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:27,070 INFO L82 PathProgramCache]: Analyzing trace with hash 358053481, now seen corresponding path program 1 times [2018-11-28 12:18:27,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:27,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:27,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:27,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:27,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:27,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:27,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:27,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:27,192 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:18:27,193 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:18:27,193 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:18:27,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:18:27,193 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:18:27,193 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,194 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:18:27,194 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:18:27,194 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2018-11-28 12:18:27,194 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:18:27,195 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:18:27,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,424 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:18:27,425 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,429 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:27,429 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:27,450 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:27,450 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_1=3} Honda state: {v_rep#funAddr~voter.offset_1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,454 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:27,454 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:27,463 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:27,463 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_1=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:27,487 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:27,491 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:27,491 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_1=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:27,511 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:27,531 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:27,531 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_1=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:27,563 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:27,592 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:27,592 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_1=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,596 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:27,596 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:27,618 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:27,618 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_1=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,624 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:27,624 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:27,643 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:27,643 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_1=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:27,648 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:27,651 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:27,651 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_1=-1} Honda state: {v_rep#funAddr~voter.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:27,671 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:27,673 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:27,673 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id=7} Honda state: {ULTIMATE.start_add_history_type_~history_id=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:27,693 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:27,695 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:27,695 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post4=0} Honda state: {ULTIMATE.start_add_history_type_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:27,717 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,736 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:18:27,736 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:27,755 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:18:27,756 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:18:27,756 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:18:27,756 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:18:27,756 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:18:27,756 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:18:27,757 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:27,757 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:18:27,757 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:18:27,757 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2018-11-28 12:18:27,757 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:18:27,757 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:18:27,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:27,937 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:18:27,941 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:18:27,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:27,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:27,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:27,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:27,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:27,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:27,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:27,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:27,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:27,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:27,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:27,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:27,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:27,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:27,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:27,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:27,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:27,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:27,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:27,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:27,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:27,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:27,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:27,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:28,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:28,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:28,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:28,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:28,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:28,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:28,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:28,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:28,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:28,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:28,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:28,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:28,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:28,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:28,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:28,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:28,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:28,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:28,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:28,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:28,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:28,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:28,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:28,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:28,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:28,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:28,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:28,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:28,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:28,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:28,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:28,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:28,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:28,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:28,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:28,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:28,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:28,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:28,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:28,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:28,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:28,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:28,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:28,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:28,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:28,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:28,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:28,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:28,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:28,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:28,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:28,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:28,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:28,051 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:18:28,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:28,051 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:18:28,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:28,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:28,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:28,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:28,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:28,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:28,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:28,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:28,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:28,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:28,060 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:18:28,062 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:18:28,062 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:18:28,064 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:18:28,065 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:18:28,065 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:18:28,065 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 5 Supporting invariants [] [2018-11-28 12:18:28,068 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:18:28,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:28,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:18:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:28,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:18:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:28,158 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 12:18:28,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states. Second operand 3 states. [2018-11-28 12:18:28,287 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states.. Second operand 3 states. Result 1977 states and 3303 transitions. Complement of second has 8 states. [2018-11-28 12:18:28,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:18:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:18:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1729 transitions. [2018-11-28 12:18:28,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1729 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 12:18:28,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:28,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1729 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 12:18:28,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:28,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1729 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-28 12:18:28,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:28,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1977 states and 3303 transitions. [2018-11-28 12:18:28,306 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 831 [2018-11-28 12:18:28,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1977 states to 953 states and 1596 transitions. [2018-11-28 12:18:28,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 899 [2018-11-28 12:18:28,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 901 [2018-11-28 12:18:28,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 953 states and 1596 transitions. [2018-11-28 12:18:28,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:28,321 INFO L705 BuchiCegarLoop]: Abstraction has 953 states and 1596 transitions. [2018-11-28 12:18:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states and 1596 transitions. [2018-11-28 12:18:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 736. [2018-11-28 12:18:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-28 12:18:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1241 transitions. [2018-11-28 12:18:28,371 INFO L728 BuchiCegarLoop]: Abstraction has 736 states and 1241 transitions. [2018-11-28 12:18:28,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:18:28,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:18:28,374 INFO L87 Difference]: Start difference. First operand 736 states and 1241 transitions. Second operand 3 states. [2018-11-28 12:18:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:28,454 INFO L93 Difference]: Finished difference Result 918 states and 1478 transitions. [2018-11-28 12:18:28,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:18:28,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 918 states and 1478 transitions. [2018-11-28 12:18:28,459 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 807 [2018-11-28 12:18:28,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 918 states to 864 states and 1424 transitions. [2018-11-28 12:18:28,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 848 [2018-11-28 12:18:28,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 848 [2018-11-28 12:18:28,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 864 states and 1424 transitions. [2018-11-28 12:18:28,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:28,464 INFO L705 BuchiCegarLoop]: Abstraction has 864 states and 1424 transitions. [2018-11-28 12:18:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states and 1424 transitions. [2018-11-28 12:18:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 425. [2018-11-28 12:18:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-28 12:18:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 708 transitions. [2018-11-28 12:18:28,474 INFO L728 BuchiCegarLoop]: Abstraction has 425 states and 708 transitions. [2018-11-28 12:18:28,474 INFO L608 BuchiCegarLoop]: Abstraction has 425 states and 708 transitions. [2018-11-28 12:18:28,474 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:18:28,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 425 states and 708 transitions. [2018-11-28 12:18:28,476 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 379 [2018-11-28 12:18:28,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:28,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:28,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:18:28,477 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:18:28,477 INFO L794 eck$LassoCheckResult]: Stem: 4522#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 4474#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 4475#L116-2 assume !(add_history_type_~var~0 < 3); 4569#L116-3 add_history_type_#res := 1; 4519#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 4374#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 4375#L116-6 [2018-11-28 12:18:28,477 INFO L796 eck$LassoCheckResult]: Loop: 4375#L116-6 assume !!(add_history_type_~var~0 < 3); 4573#L117-2 assume !(0 == add_history_type_~history_id); 4466#L123-2 assume !(1 == add_history_type_~history_id); 4468#L129-2 assume !(2 == add_history_type_~history_id); 4418#L135-3 assume !(3 == add_history_type_~history_id); 4200#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 4375#L116-6 [2018-11-28 12:18:28,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:28,478 INFO L82 PathProgramCache]: Analyzing trace with hash 889868154, now seen corresponding path program 1 times [2018-11-28 12:18:28,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:28,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:28,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:28,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:28,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:28,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:28,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:28,511 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:28,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:28,511 INFO L82 PathProgramCache]: Analyzing trace with hash 261434407, now seen corresponding path program 1 times [2018-11-28 12:18:28,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:28,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:28,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:28,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:28,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:28,549 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:18:28,549 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:18:28,549 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:18:28,549 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:18:28,549 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:18:28,549 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:28,549 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:18:28,549 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:18:28,549 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2018-11-28 12:18:28,550 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:18:28,550 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:18:28,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,679 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:18:28,680 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:28,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:28,695 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:28,699 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:28,699 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post4=0} Honda state: {ULTIMATE.start_add_history_type_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:28,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:28,723 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:28,739 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:28,739 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_3=3} Honda state: {v_rep#funAddr~voter.offset_3=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:28,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:28,744 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:28,748 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:28,748 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_3=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:28,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:28,765 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:28,780 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:28,780 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_3=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:28,783 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:28,783 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:28,799 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:28,800 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_3=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:28,804 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:28,804 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:28,807 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:28,807 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_3=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:28,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:28,824 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:28,826 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:28,826 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_3=-1} Honda state: {v_rep#funAddr~voter.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:28,843 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:28,843 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:28,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:18:28,861 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:28,877 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:18:28,878 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:18:28,879 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:18:28,879 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:18:28,879 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:18:28,879 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:18:28,879 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:28,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:18:28,879 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:18:28,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2018-11-28 12:18:28,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:18:28,879 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:18:28,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:28,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,031 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:18:29,031 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:18:29,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:29,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:29,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:29,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:29,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:29,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:29,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:29,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:29,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:29,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:29,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:29,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:29,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:29,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:29,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:29,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:29,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:29,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:29,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:29,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:29,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:29,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:29,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:29,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:29,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:29,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:29,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:29,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:29,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:29,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:29,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:29,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:29,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:29,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:29,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:29,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:29,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:29,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:29,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:29,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:29,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:29,054 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:18:29,056 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:18:29,056 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:18:29,056 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:18:29,056 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:18:29,056 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:18:29,056 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 5 Supporting invariants [] [2018-11-28 12:18:29,057 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:18:29,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:29,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:18:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:29,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:18:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:29,099 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 12:18:29,099 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 425 states and 708 transitions. cyclomatic complexity: 291 Second operand 3 states. [2018-11-28 12:18:29,167 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 425 states and 708 transitions. cyclomatic complexity: 291. Second operand 3 states. Result 1561 states and 2573 transitions. Complement of second has 7 states. [2018-11-28 12:18:29,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:18:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:18:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1185 transitions. [2018-11-28 12:18:29,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1185 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-28 12:18:29,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:29,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1185 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-28 12:18:29,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:29,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1185 transitions. Stem has 6 letters. Loop has 12 letters. [2018-11-28 12:18:29,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:29,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1561 states and 2573 transitions. [2018-11-28 12:18:29,180 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 966 [2018-11-28 12:18:29,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1561 states to 1124 states and 1852 transitions. [2018-11-28 12:18:29,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1050 [2018-11-28 12:18:29,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1053 [2018-11-28 12:18:29,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1124 states and 1852 transitions. [2018-11-28 12:18:29,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:29,188 INFO L705 BuchiCegarLoop]: Abstraction has 1124 states and 1852 transitions. [2018-11-28 12:18:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states and 1852 transitions. [2018-11-28 12:18:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 477. [2018-11-28 12:18:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-11-28 12:18:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 793 transitions. [2018-11-28 12:18:29,201 INFO L728 BuchiCegarLoop]: Abstraction has 477 states and 793 transitions. [2018-11-28 12:18:29,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:18:29,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:18:29,201 INFO L87 Difference]: Start difference. First operand 477 states and 793 transitions. Second operand 3 states. [2018-11-28 12:18:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:29,245 INFO L93 Difference]: Finished difference Result 937 states and 1553 transitions. [2018-11-28 12:18:29,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:18:29,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 937 states and 1553 transitions. [2018-11-28 12:18:29,252 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 538 [2018-11-28 12:18:29,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 937 states to 937 states and 1553 transitions. [2018-11-28 12:18:29,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 799 [2018-11-28 12:18:29,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 799 [2018-11-28 12:18:29,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 937 states and 1553 transitions. [2018-11-28 12:18:29,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:29,258 INFO L705 BuchiCegarLoop]: Abstraction has 937 states and 1553 transitions. [2018-11-28 12:18:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states and 1553 transitions. [2018-11-28 12:18:29,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 479. [2018-11-28 12:18:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-11-28 12:18:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 793 transitions. [2018-11-28 12:18:29,268 INFO L728 BuchiCegarLoop]: Abstraction has 479 states and 793 transitions. [2018-11-28 12:18:29,268 INFO L608 BuchiCegarLoop]: Abstraction has 479 states and 793 transitions. [2018-11-28 12:18:29,268 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:18:29,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 479 states and 793 transitions. [2018-11-28 12:18:29,270 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 324 [2018-11-28 12:18:29,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:29,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:29,271 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:29,271 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:29,272 INFO L794 eck$LassoCheckResult]: Stem: 8025#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 7970#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 7971#L116-2 assume !!(add_history_type_~var~0 < 3); 8066#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 7713#L171 assume 0 == read_history_bool_~history_id; 7714#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 7720#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 7839#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8021#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 7862#L255 assume 0 == init_~tmp~1;init_#res := 0; 7733#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 7696#L554-2 [2018-11-28 12:18:29,272 INFO L796 eck$LassoCheckResult]: Loop: 7696#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 7697#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 7729#L574-16 assume 0 != ~gate1Failed~0 % 256; 7727#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 7728#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 7735#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 7710#L226-2 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 7712#L574-17 assume 0 != ~gate2Failed~0 % 256; 7700#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 7685#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 7686#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 8027#L226-4 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 7805#L574-18 assume 0 != ~gate3Failed~0 % 256; 7868#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 7852#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 7853#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 7866#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 7694#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 7944#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 7945#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 7947#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 7920#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 7921#L171-12 assume 0 == read_history_bool_~history_id; 8059#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 7763#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 7807#L307 assume !(0 == check_~tmp___3~0 % 256); 7897#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 7979#L151-7 assume 3 == read_history_int8_~history_id; 7993#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 7882#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 7846#L346 assume !(check_~tmp___10~0 > -2); 7831#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 7832#L151-9 assume 3 == read_history_int8_~history_id; 7988#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 7878#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 7913#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 7845#L366-1 check_#res := 1; 7701#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 7702#L579-72 assume !(0 == assert_~arg % 256); 7928#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 7696#L554-2 [2018-11-28 12:18:29,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:29,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1494216267, now seen corresponding path program 1 times [2018-11-28 12:18:29,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:29,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:29,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:29,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:29,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:29,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:29,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:18:29,300 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:29,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:29,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1816510568, now seen corresponding path program 1 times [2018-11-28 12:18:29,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:29,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:29,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:29,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:29,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:29,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:29,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:29,334 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:18:29,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:18:29,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:18:29,334 INFO L87 Difference]: Start difference. First operand 479 states and 793 transitions. cyclomatic complexity: 322 Second operand 3 states. [2018-11-28 12:18:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:29,351 INFO L93 Difference]: Finished difference Result 480 states and 793 transitions. [2018-11-28 12:18:29,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:18:29,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 480 states and 793 transitions. [2018-11-28 12:18:29,355 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 324 [2018-11-28 12:18:29,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 480 states to 479 states and 789 transitions. [2018-11-28 12:18:29,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 408 [2018-11-28 12:18:29,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 408 [2018-11-28 12:18:29,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 479 states and 789 transitions. [2018-11-28 12:18:29,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:29,358 INFO L705 BuchiCegarLoop]: Abstraction has 479 states and 789 transitions. [2018-11-28 12:18:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states and 789 transitions. [2018-11-28 12:18:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2018-11-28 12:18:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-11-28 12:18:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 789 transitions. [2018-11-28 12:18:29,366 INFO L728 BuchiCegarLoop]: Abstraction has 479 states and 789 transitions. [2018-11-28 12:18:29,366 INFO L608 BuchiCegarLoop]: Abstraction has 479 states and 789 transitions. [2018-11-28 12:18:29,366 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:18:29,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 479 states and 789 transitions. [2018-11-28 12:18:29,368 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 324 [2018-11-28 12:18:29,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:29,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:29,369 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:29,369 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:18:29,369 INFO L794 eck$LassoCheckResult]: Stem: 8991#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 8937#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 8938#L116-2 assume !!(add_history_type_~var~0 < 3); 9032#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 8679#L171 assume 0 == read_history_bool_~history_id; 8680#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 8686#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 8805#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8989#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 8828#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 8829#L116-6 assume !!(add_history_type_~var~0 < 3); 9052#L117-2 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 9019#L171-3 assume 0 == read_history_bool_~history_id; 9022#L172-3 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 8762#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 8771#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8627#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 8697#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 8698#L116-10 assume !!(add_history_type_~var~0 < 3); 9047#L117-4 [2018-11-28 12:18:29,370 INFO L796 eck$LassoCheckResult]: Loop: 9047#L117-4 assume !(0 == add_history_type_~history_id); 8921#L123-4 assume !(1 == add_history_type_~history_id); 8923#L129-4 assume !(2 == add_history_type_~history_id); 8872#L135-6 assume !(3 == add_history_type_~history_id); 8619#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 9064#L116-10 assume !!(add_history_type_~var~0 < 3); 9047#L117-4 [2018-11-28 12:18:29,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:29,374 INFO L82 PathProgramCache]: Analyzing trace with hash 576829260, now seen corresponding path program 1 times [2018-11-28 12:18:29,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:29,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:29,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:29,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:29,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:29,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:29,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:18:29,398 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:29,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1197341531, now seen corresponding path program 1 times [2018-11-28 12:18:29,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:29,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:29,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:29,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:29,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:29,427 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:18:29,427 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:18:29,427 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:18:29,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:18:29,427 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:18:29,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:29,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:18:29,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:18:29,428 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-28 12:18:29,428 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:18:29,428 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:18:29,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,575 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:18:29,575 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:29,578 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:29,579 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:29,598 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:18:29,598 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:29,650 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:18:29,651 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:18:29,651 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:18:29,651 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:18:29,651 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:18:29,651 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:18:29,652 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:29,652 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:18:29,652 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:18:29,652 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-28 12:18:29,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:18:29,652 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:18:29,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:29,772 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:18:29,772 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:18:29,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:29,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:29,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:29,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:29,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:29,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:29,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:29,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:29,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:29,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:29,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:29,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:29,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:29,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:29,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:29,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:29,781 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:18:29,783 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:18:29,783 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:18:29,783 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:18:29,783 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:18:29,784 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:18:29,784 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 3 Supporting invariants [] [2018-11-28 12:18:29,784 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:18:29,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:29,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:18:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:29,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:18:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:29,885 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 12:18:29,885 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 479 states and 789 transitions. cyclomatic complexity: 318 Second operand 4 states. [2018-11-28 12:18:29,959 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 479 states and 789 transitions. cyclomatic complexity: 318. Second operand 4 states. Result 540 states and 891 transitions. Complement of second has 7 states. [2018-11-28 12:18:29,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:18:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:18:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 221 transitions. [2018-11-28 12:18:29,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 221 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-28 12:18:29,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:29,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 221 transitions. Stem has 25 letters. Loop has 6 letters. [2018-11-28 12:18:29,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:29,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 221 transitions. Stem has 19 letters. Loop has 12 letters. [2018-11-28 12:18:29,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:29,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 540 states and 891 transitions. [2018-11-28 12:18:29,964 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 269 [2018-11-28 12:18:29,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 540 states to 535 states and 882 transitions. [2018-11-28 12:18:29,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 407 [2018-11-28 12:18:29,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2018-11-28 12:18:29,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 535 states and 882 transitions. [2018-11-28 12:18:29,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:29,968 INFO L705 BuchiCegarLoop]: Abstraction has 535 states and 882 transitions. [2018-11-28 12:18:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states and 882 transitions. [2018-11-28 12:18:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2018-11-28 12:18:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-11-28 12:18:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 878 transitions. [2018-11-28 12:18:29,977 INFO L728 BuchiCegarLoop]: Abstraction has 531 states and 878 transitions. [2018-11-28 12:18:29,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:18:29,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:18:29,978 INFO L87 Difference]: Start difference. First operand 531 states and 878 transitions. Second operand 4 states. [2018-11-28 12:18:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:30,042 INFO L93 Difference]: Finished difference Result 754 states and 1237 transitions. [2018-11-28 12:18:30,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:18:30,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1237 transitions. [2018-11-28 12:18:30,047 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 483 [2018-11-28 12:18:30,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 738 states and 1211 transitions. [2018-11-28 12:18:30,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 612 [2018-11-28 12:18:30,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 612 [2018-11-28 12:18:30,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 738 states and 1211 transitions. [2018-11-28 12:18:30,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:30,052 INFO L705 BuchiCegarLoop]: Abstraction has 738 states and 1211 transitions. [2018-11-28 12:18:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states and 1211 transitions. [2018-11-28 12:18:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 517. [2018-11-28 12:18:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-11-28 12:18:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 853 transitions. [2018-11-28 12:18:30,061 INFO L728 BuchiCegarLoop]: Abstraction has 517 states and 853 transitions. [2018-11-28 12:18:30,061 INFO L608 BuchiCegarLoop]: Abstraction has 517 states and 853 transitions. [2018-11-28 12:18:30,061 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:18:30,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 517 states and 853 transitions. [2018-11-28 12:18:30,063 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 269 [2018-11-28 12:18:30,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:30,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:30,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:30,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:18:30,065 INFO L794 eck$LassoCheckResult]: Stem: 11425#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 11366#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11367#L116-2 assume !!(add_history_type_~var~0 < 3); 11475#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 11092#L171 assume 0 == read_history_bool_~history_id; 11093#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11096#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11226#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 11291#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 11292#L116-2 assume !(add_history_type_~var~0 < 3); 11488#L116-3 add_history_type_#res := 1; 11423#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 11250#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11251#L116-6 assume !!(add_history_type_~var~0 < 3); 11494#L117-2 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 11461#L171-3 assume 0 == read_history_bool_~history_id; 11464#L172-3 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11175#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11179#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11040#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 11104#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11105#L116-10 assume !!(add_history_type_~var~0 < 3); 11452#L117-4 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 11453#L171-6 assume 0 == read_history_bool_~history_id; 11448#L172-6 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11144#L203-6 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11148#L119-2 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11029#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 11364#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11365#L116-14 assume !!(add_history_type_~var~0 < 3); 11482#L117-6 [2018-11-28 12:18:30,065 INFO L796 eck$LassoCheckResult]: Loop: 11482#L117-6 assume !(0 == add_history_type_~history_id); 11342#L123-6 assume !(1 == add_history_type_~history_id); 11344#L129-6 assume !(2 == add_history_type_~history_id); 11085#L135-9 assume !(3 == add_history_type_~history_id); 11021#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 11505#L116-14 assume !!(add_history_type_~var~0 < 3); 11482#L117-6 [2018-11-28 12:18:30,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2009806385, now seen corresponding path program 1 times [2018-11-28 12:18:30,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:30,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:30,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:30,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:30,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:18:30,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:30,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:18:30,145 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:30,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:30,145 INFO L82 PathProgramCache]: Analyzing trace with hash 180771675, now seen corresponding path program 1 times [2018-11-28 12:18:30,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:30,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:30,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:30,170 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:18:30,170 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:18:30,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:18:30,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:18:30,171 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:18:30,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:30,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:18:30,171 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:18:30,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2018-11-28 12:18:30,171 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:18:30,171 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:18:30,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,315 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:18:30,315 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:30,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:30,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:30,325 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:30,326 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_7=-1} Honda state: {v_rep#funAddr~voter.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:30,350 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:30,351 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:30,374 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:30,375 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_7=3} Honda state: {v_rep#funAddr~voter.offset_7=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:30,379 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:30,379 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:30,381 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:30,381 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post4=0} Honda state: {ULTIMATE.start_add_history_type_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:30,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:30,399 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:30,416 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:30,416 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_7=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:30,423 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:30,423 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:30,426 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:30,426 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_7=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:30,442 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:30,442 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:30,460 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:30,460 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_7=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:30,464 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:30,464 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:30,467 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:30,467 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id=7} Honda state: {ULTIMATE.start_add_history_type_~history_id=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:30,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:30,486 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:30,489 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:30,489 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_7=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:30,506 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:30,506 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:30,509 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:30,510 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_7=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:30,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:30,529 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:30,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:18:30,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:30,600 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:18:30,601 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:18:30,601 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:18:30,601 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:18:30,601 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:18:30,601 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:18:30,601 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:30,601 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:18:30,601 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:18:30,601 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2018-11-28 12:18:30,601 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:18:30,601 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:18:30,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:30,717 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:18:30,717 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:18:30,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:30,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:30,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:30,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:30,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:30,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:30,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:30,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:30,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:30,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:30,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:30,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:30,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:30,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:30,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:30,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:30,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:30,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:30,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:30,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:30,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:30,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:30,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:30,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:30,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:30,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:30,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:30,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:30,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:30,726 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:18:30,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:30,726 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:18:30,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:30,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:30,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:30,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:30,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:30,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:30,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:30,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:30,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:30,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:30,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:30,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:30,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:30,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:30,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:30,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:30,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:30,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:30,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:30,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:30,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:30,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:30,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:30,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:30,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:30,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:30,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:30,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:30,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:30,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:30,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:30,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:18:30,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:18:30,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:30,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:30,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:30,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:30,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:30,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:30,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:30,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:30,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:30,747 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:18:30,748 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:18:30,748 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:18:30,749 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:18:30,749 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:18:30,749 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:18:30,749 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 3 Supporting invariants [] [2018-11-28 12:18:30,749 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:18:30,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:30,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:18:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:30,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:18:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:30,826 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 12:18:30,826 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 517 states and 853 transitions. cyclomatic complexity: 344 Second operand 4 states. [2018-11-28 12:18:30,866 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 517 states and 853 transitions. cyclomatic complexity: 344. Second operand 4 states. Result 1223 states and 2013 transitions. Complement of second has 6 states. [2018-11-28 12:18:30,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:18:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:18:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1020 transitions. [2018-11-28 12:18:30,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1020 transitions. Stem has 30 letters. Loop has 6 letters. [2018-11-28 12:18:30,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:30,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1020 transitions. Stem has 36 letters. Loop has 6 letters. [2018-11-28 12:18:30,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:30,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1020 transitions. Stem has 30 letters. Loop has 12 letters. [2018-11-28 12:18:30,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:30,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1223 states and 2013 transitions. [2018-11-28 12:18:30,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 428 [2018-11-28 12:18:30,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1223 states to 788 states and 1298 transitions. [2018-11-28 12:18:30,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 605 [2018-11-28 12:18:30,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 607 [2018-11-28 12:18:30,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 788 states and 1298 transitions. [2018-11-28 12:18:30,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:30,879 INFO L705 BuchiCegarLoop]: Abstraction has 788 states and 1298 transitions. [2018-11-28 12:18:30,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states and 1298 transitions. [2018-11-28 12:18:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 569. [2018-11-28 12:18:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-11-28 12:18:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 942 transitions. [2018-11-28 12:18:30,889 INFO L728 BuchiCegarLoop]: Abstraction has 569 states and 942 transitions. [2018-11-28 12:18:30,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:18:30,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:18:30,889 INFO L87 Difference]: Start difference. First operand 569 states and 942 transitions. Second operand 5 states. [2018-11-28 12:18:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:30,976 INFO L93 Difference]: Finished difference Result 702 states and 1142 transitions. [2018-11-28 12:18:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:18:30,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 702 states and 1142 transitions. [2018-11-28 12:18:30,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 428 [2018-11-28 12:18:30,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 702 states to 702 states and 1142 transitions. [2018-11-28 12:18:30,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 569 [2018-11-28 12:18:30,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 569 [2018-11-28 12:18:30,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 702 states and 1142 transitions. [2018-11-28 12:18:30,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:30,984 INFO L705 BuchiCegarLoop]: Abstraction has 702 states and 1142 transitions. [2018-11-28 12:18:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states and 1142 transitions. [2018-11-28 12:18:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 481. [2018-11-28 12:18:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-11-28 12:18:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 784 transitions. [2018-11-28 12:18:30,991 INFO L728 BuchiCegarLoop]: Abstraction has 481 states and 784 transitions. [2018-11-28 12:18:30,991 INFO L608 BuchiCegarLoop]: Abstraction has 481 states and 784 transitions. [2018-11-28 12:18:30,991 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:18:30,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 481 states and 784 transitions. [2018-11-28 12:18:30,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2018-11-28 12:18:30,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:30,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:30,994 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:30,994 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:30,995 INFO L794 eck$LassoCheckResult]: Stem: 14411#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 14166#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 14167#L116-2 assume !!(add_history_type_~var~0 < 3); 14531#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 14368#L171 assume 0 == read_history_bool_~history_id; 14369#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14142#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 14351#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 14352#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 14552#L116-2 assume !(add_history_type_~var~0 < 3); 14549#L116-3 add_history_type_#res := 1; 14383#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 14384#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 14515#L116-6 assume !!(add_history_type_~var~0 < 3); 14509#L117-2 assume !(0 == add_history_type_~history_id); 14510#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 14550#L171-4 assume 0 == read_history_bool_~history_id; 14507#L172-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14183#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14219#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14194#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 14378#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 14379#L116-10 assume !!(add_history_type_~var~0 < 3); 14499#L117-4 assume !(0 == add_history_type_~history_id); 14500#L123-4 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 14566#L171-7 assume 0 == read_history_bool_~history_id; 14488#L172-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14268#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14214#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14187#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 14152#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 14153#L116-14 assume !!(add_history_type_~var~0 < 3); 14482#L117-6 assume !(0 == add_history_type_~history_id); 14484#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 14557#L171-10 assume 0 == read_history_bool_~history_id; 14521#L172-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14247#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14206#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14175#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 14412#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 14381#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 14291#L554-2 [2018-11-28 12:18:30,995 INFO L796 eck$LassoCheckResult]: Loop: 14291#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 14292#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 14376#L574-16 assume 0 != ~gate1Failed~0 % 256; 14374#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 14375#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 14382#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 14365#L226-2 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 14367#L574-17 assume 0 != ~gate2Failed~0 % 256; 14303#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 14250#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 14225#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 14424#L226-4 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 14414#L574-18 assume 0 != ~gate3Failed~0 % 256; 14524#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 14491#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 14492#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 14523#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 14289#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 14615#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 14614#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 14607#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 14406#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 14553#L171-12 assume 0 == read_history_bool_~history_id; 14518#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14305#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 14179#L307 assume !(0 == check_~tmp___3~0 % 256); 14180#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 14191#L151-7 assume 3 == read_history_int8_~history_id; 14263#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 14264#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 14266#L346 assume !(check_~tmp___10~0 > -2); 14460#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 14461#L151-9 assume 3 == read_history_int8_~history_id; 14251#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 14252#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 14254#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 14327#L366-1 check_#res := 1; 14317#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 14318#L579-72 assume !(0 == assert_~arg % 256); 14361#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 14291#L554-2 [2018-11-28 12:18:30,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:30,995 INFO L82 PathProgramCache]: Analyzing trace with hash 317959147, now seen corresponding path program 1 times [2018-11-28 12:18:30,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:30,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:30,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:30,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:30,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:18:31,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:18:31,037 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:31,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1816510568, now seen corresponding path program 2 times [2018-11-28 12:18:31,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:31,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:31,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:31,065 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:18:31,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:18:31,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:18:31,065 INFO L87 Difference]: Start difference. First operand 481 states and 784 transitions. cyclomatic complexity: 308 Second operand 3 states. [2018-11-28 12:18:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:31,106 INFO L93 Difference]: Finished difference Result 492 states and 798 transitions. [2018-11-28 12:18:31,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:18:31,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 492 states and 798 transitions. [2018-11-28 12:18:31,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 224 [2018-11-28 12:18:31,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 492 states to 492 states and 798 transitions. [2018-11-28 12:18:31,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 359 [2018-11-28 12:18:31,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 359 [2018-11-28 12:18:31,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 492 states and 798 transitions. [2018-11-28 12:18:31,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:31,111 INFO L705 BuchiCegarLoop]: Abstraction has 492 states and 798 transitions. [2018-11-28 12:18:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states and 798 transitions. [2018-11-28 12:18:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 481. [2018-11-28 12:18:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-11-28 12:18:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 782 transitions. [2018-11-28 12:18:31,117 INFO L728 BuchiCegarLoop]: Abstraction has 481 states and 782 transitions. [2018-11-28 12:18:31,117 INFO L608 BuchiCegarLoop]: Abstraction has 481 states and 782 transitions. [2018-11-28 12:18:31,117 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:18:31,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 481 states and 782 transitions. [2018-11-28 12:18:31,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2018-11-28 12:18:31,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:31,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:31,120 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,120 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,120 INFO L794 eck$LassoCheckResult]: Stem: 15393#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 15148#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15149#L116-2 assume !!(add_history_type_~var~0 < 3); 15513#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15349#L171 assume 0 == read_history_bool_~history_id; 15350#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15124#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 15333#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 15334#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 15534#L116-2 assume !(add_history_type_~var~0 < 3); 15531#L116-3 add_history_type_#res := 1; 15364#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 15365#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15497#L116-6 assume !!(add_history_type_~var~0 < 3); 15491#L117-2 assume !(0 == add_history_type_~history_id); 15492#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15532#L171-4 assume 0 == read_history_bool_~history_id; 15489#L172-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15165#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15201#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15176#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 15359#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15360#L116-10 assume !!(add_history_type_~var~0 < 3); 15481#L117-4 assume !(0 == add_history_type_~history_id); 15482#L123-4 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15548#L171-7 assume 0 == read_history_bool_~history_id; 15470#L172-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15250#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15196#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15169#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 15134#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15135#L116-14 assume !!(add_history_type_~var~0 < 3); 15464#L117-6 assume !(0 == add_history_type_~history_id); 15466#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15539#L171-10 assume 0 == read_history_bool_~history_id; 15503#L172-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15229#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15188#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15157#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 15394#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 15362#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 15273#L554-2 [2018-11-28 12:18:31,120 INFO L796 eck$LassoCheckResult]: Loop: 15273#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 15274#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 15357#L574-16 assume 0 != ~gate1Failed~0 % 256; 15355#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 15356#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 15363#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 15347#L226-2 assume !(0 == write_history_bool_~history_id); 15348#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 15368#L574-17 assume 0 != ~gate2Failed~0 % 256; 15285#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 15232#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 15207#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 15406#L226-4 assume !(0 == write_history_bool_~history_id); 15395#L231-4 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 15396#L574-18 assume 0 != ~gate3Failed~0 % 256; 15506#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 15473#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 15474#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 15505#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 15271#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 15597#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 15596#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 15589#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 15388#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15535#L171-12 assume 0 == read_history_bool_~history_id; 15500#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15287#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 15161#L307 assume !(0 == check_~tmp___3~0 % 256); 15162#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 15173#L151-7 assume 3 == read_history_int8_~history_id; 15245#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 15246#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 15248#L346 assume !(check_~tmp___10~0 > -2); 15442#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 15443#L151-9 assume 3 == read_history_int8_~history_id; 15233#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 15234#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 15236#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 15309#L366-1 check_#res := 1; 15299#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 15300#L579-72 assume !(0 == assert_~arg % 256); 15343#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 15273#L554-2 [2018-11-28 12:18:31,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash 317959147, now seen corresponding path program 2 times [2018-11-28 12:18:31,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:18:31,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:18:31,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:18:31,149 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:31,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,149 INFO L82 PathProgramCache]: Analyzing trace with hash 72685121, now seen corresponding path program 1 times [2018-11-28 12:18:31,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:18:31,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:31,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:31,184 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:18:31,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:18:31,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:18:31,185 INFO L87 Difference]: Start difference. First operand 481 states and 782 transitions. cyclomatic complexity: 306 Second operand 5 states. [2018-11-28 12:18:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:31,360 INFO L93 Difference]: Finished difference Result 990 states and 1531 transitions. [2018-11-28 12:18:31,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:18:31,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 990 states and 1531 transitions. [2018-11-28 12:18:31,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 636 [2018-11-28 12:18:31,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 990 states to 990 states and 1531 transitions. [2018-11-28 12:18:31,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 825 [2018-11-28 12:18:31,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 825 [2018-11-28 12:18:31,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 990 states and 1531 transitions. [2018-11-28 12:18:31,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:31,368 INFO L705 BuchiCegarLoop]: Abstraction has 990 states and 1531 transitions. [2018-11-28 12:18:31,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states and 1531 transitions. [2018-11-28 12:18:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 449. [2018-11-28 12:18:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-28 12:18:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 702 transitions. [2018-11-28 12:18:31,374 INFO L728 BuchiCegarLoop]: Abstraction has 449 states and 702 transitions. [2018-11-28 12:18:31,375 INFO L608 BuchiCegarLoop]: Abstraction has 449 states and 702 transitions. [2018-11-28 12:18:31,375 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 12:18:31,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 449 states and 702 transitions. [2018-11-28 12:18:31,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 206 [2018-11-28 12:18:31,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:31,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:31,377 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,377 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,378 INFO L794 eck$LassoCheckResult]: Stem: 16878#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 16637#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 16638#L116-2 assume !!(add_history_type_~var~0 < 3); 16973#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16834#L171 assume 0 == read_history_bool_~history_id; 16835#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 16616#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 16818#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 16819#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 16991#L116-2 assume !(add_history_type_~var~0 < 3); 16988#L116-3 add_history_type_#res := 1; 16850#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 16851#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 16964#L116-6 assume !!(add_history_type_~var~0 < 3); 16960#L117-2 assume !(0 == add_history_type_~history_id); 16961#L123-2 assume !(1 == add_history_type_~history_id); 17050#L129-2 assume !(2 == add_history_type_~history_id); 17024#L135-3 assume !(3 == add_history_type_~history_id); 16659#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 17005#L116-6 assume !(add_history_type_~var~0 < 3); 16999#L116-7 add_history_type_#res := 1; 16657#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 16844#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 16845#L116-10 assume !!(add_history_type_~var~0 < 3); 16952#L117-4 assume !(0 == add_history_type_~history_id); 16953#L123-4 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17006#L171-7 assume !(0 == read_history_bool_~history_id); 16920#L181-7 assume 1 == read_history_bool_~history_id; 16921#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 16734#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 16677#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 16650#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 16623#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 16624#L116-14 assume !!(add_history_type_~var~0 < 3); 16937#L117-6 assume !(0 == add_history_type_~history_id); 16939#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16997#L171-10 assume !(0 == read_history_bool_~history_id); 16908#L181-10 assume 1 == read_history_bool_~history_id; 16909#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 16710#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 16669#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 16642#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 16879#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 16847#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 16756#L554-2 [2018-11-28 12:18:31,378 INFO L796 eck$LassoCheckResult]: Loop: 16756#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 16757#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 16842#L574-16 assume 0 != ~gate1Failed~0 % 256; 16840#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 16841#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 16848#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 16832#L226-2 assume !(0 == write_history_bool_~history_id); 16833#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 16855#L574-17 assume 0 != ~gate2Failed~0 % 256; 16771#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 16713#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 16688#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 16891#L226-4 assume !(0 == write_history_bool_~history_id); 16880#L231-4 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 16881#L574-18 assume 0 != ~gate3Failed~0 % 256; 16968#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 16944#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 16945#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 16967#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 16754#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 17054#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 17053#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 17046#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 16873#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16992#L171-12 assume 0 == read_history_bool_~history_id; 16966#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 16773#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 16646#L307 assume !(0 == check_~tmp___3~0 % 256); 16647#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 16654#L151-7 assume 3 == read_history_int8_~history_id; 16726#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 16727#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 16729#L346 assume !(check_~tmp___10~0 > -2); 16926#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 16927#L151-9 assume 3 == read_history_int8_~history_id; 16714#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 16715#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 16717#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 16792#L366-1 check_#res := 1; 16782#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 16783#L579-72 assume !(0 == assert_~arg % 256); 16828#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 16756#L554-2 [2018-11-28 12:18:31,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2106629905, now seen corresponding path program 1 times [2018-11-28 12:18:31,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:31,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:18:31,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:31,411 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:31,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,411 INFO L82 PathProgramCache]: Analyzing trace with hash 72685121, now seen corresponding path program 2 times [2018-11-28 12:18:31,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:31,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:31,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:31,431 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:18:31,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:18:31,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:18:31,432 INFO L87 Difference]: Start difference. First operand 449 states and 702 transitions. cyclomatic complexity: 258 Second operand 3 states. [2018-11-28 12:18:31,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:31,451 INFO L93 Difference]: Finished difference Result 470 states and 732 transitions. [2018-11-28 12:18:31,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:18:31,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 470 states and 732 transitions. [2018-11-28 12:18:31,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 226 [2018-11-28 12:18:31,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 470 states to 470 states and 732 transitions. [2018-11-28 12:18:31,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 349 [2018-11-28 12:18:31,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 349 [2018-11-28 12:18:31,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 470 states and 732 transitions. [2018-11-28 12:18:31,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:31,456 INFO L705 BuchiCegarLoop]: Abstraction has 470 states and 732 transitions. [2018-11-28 12:18:31,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states and 732 transitions. [2018-11-28 12:18:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 449. [2018-11-28 12:18:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-28 12:18:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 701 transitions. [2018-11-28 12:18:31,461 INFO L728 BuchiCegarLoop]: Abstraction has 449 states and 701 transitions. [2018-11-28 12:18:31,461 INFO L608 BuchiCegarLoop]: Abstraction has 449 states and 701 transitions. [2018-11-28 12:18:31,461 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 12:18:31,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 449 states and 701 transitions. [2018-11-28 12:18:31,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 206 [2018-11-28 12:18:31,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:31,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:31,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,464 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,464 INFO L794 eck$LassoCheckResult]: Stem: 17804#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 17563#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17564#L116-2 assume !!(add_history_type_~var~0 < 3); 17899#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17760#L171 assume 0 == read_history_bool_~history_id; 17761#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 17542#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 17744#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 17745#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 17917#L116-2 assume !(add_history_type_~var~0 < 3); 17914#L116-3 add_history_type_#res := 1; 17776#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 17777#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17890#L116-6 assume !!(add_history_type_~var~0 < 3); 17884#L117-2 assume !(0 == add_history_type_~history_id); 17885#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17915#L171-4 assume !(0 == read_history_bool_~history_id); 17817#L181-4 assume 1 == read_history_bool_~history_id; 17818#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17722#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17608#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17583#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 17770#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17771#L116-10 assume !!(add_history_type_~var~0 < 3); 17878#L117-4 assume !(0 == add_history_type_~history_id); 17879#L123-4 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17931#L171-7 assume !(0 == read_history_bool_~history_id); 17846#L181-7 assume 1 == read_history_bool_~history_id; 17847#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17660#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17603#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17576#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 17549#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17550#L116-14 assume !!(add_history_type_~var~0 < 3); 17863#L117-6 assume !(0 == add_history_type_~history_id); 17865#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17922#L171-10 assume !(0 == read_history_bool_~history_id); 17834#L181-10 assume 1 == read_history_bool_~history_id; 17835#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17639#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17595#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17568#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 17805#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 17773#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 17684#L554-2 [2018-11-28 12:18:31,464 INFO L796 eck$LassoCheckResult]: Loop: 17684#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 17685#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 17768#L574-16 assume 0 != ~gate1Failed~0 % 256; 17766#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 17767#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 17774#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 17758#L226-2 assume !(0 == write_history_bool_~history_id); 17759#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 17781#L574-17 assume 0 != ~gate2Failed~0 % 256; 17697#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 17642#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 17614#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 17816#L226-4 assume !(0 == write_history_bool_~history_id); 17806#L231-4 assume !(1 == write_history_bool_~history_id); 17807#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 17825#L574-18 assume 0 != ~gate3Failed~0 % 256; 17894#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 17870#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 17871#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 17893#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 17680#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 17980#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 17979#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 17972#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 17799#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17918#L171-12 assume 0 == read_history_bool_~history_id; 17892#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 17699#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 17572#L307 assume !(0 == check_~tmp___3~0 % 256); 17573#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 17580#L151-7 assume 3 == read_history_int8_~history_id; 17648#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 17649#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 17655#L346 assume !(check_~tmp___10~0 > -2); 17852#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 17853#L151-9 assume 3 == read_history_int8_~history_id; 17635#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 17636#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 17643#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 17718#L366-1 check_#res := 1; 17708#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 17709#L579-72 assume !(0 == assert_~arg % 256); 17754#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 17684#L554-2 [2018-11-28 12:18:31,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1987741776, now seen corresponding path program 1 times [2018-11-28 12:18:31,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:18:31,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:18:31,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:18:31,516 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:31,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1569068031, now seen corresponding path program 1 times [2018-11-28 12:18:31,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:31,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:31,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:31,540 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:18:31,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:18:31,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:18:31,540 INFO L87 Difference]: Start difference. First operand 449 states and 701 transitions. cyclomatic complexity: 257 Second operand 3 states. [2018-11-28 12:18:31,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:31,572 INFO L93 Difference]: Finished difference Result 640 states and 1003 transitions. [2018-11-28 12:18:31,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:18:31,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 640 states and 1003 transitions. [2018-11-28 12:18:31,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 397 [2018-11-28 12:18:31,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 640 states to 640 states and 1003 transitions. [2018-11-28 12:18:31,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 519 [2018-11-28 12:18:31,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 519 [2018-11-28 12:18:31,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 640 states and 1003 transitions. [2018-11-28 12:18:31,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:31,579 INFO L705 BuchiCegarLoop]: Abstraction has 640 states and 1003 transitions. [2018-11-28 12:18:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states and 1003 transitions. [2018-11-28 12:18:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 492. [2018-11-28 12:18:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-11-28 12:18:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 766 transitions. [2018-11-28 12:18:31,585 INFO L728 BuchiCegarLoop]: Abstraction has 492 states and 766 transitions. [2018-11-28 12:18:31,586 INFO L608 BuchiCegarLoop]: Abstraction has 492 states and 766 transitions. [2018-11-28 12:18:31,586 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 12:18:31,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 492 states and 766 transitions. [2018-11-28 12:18:31,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 249 [2018-11-28 12:18:31,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:31,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:31,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,589 INFO L794 eck$LassoCheckResult]: Stem: 18903#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 18660#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18661#L116-2 assume !!(add_history_type_~var~0 < 3); 18999#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18859#L171 assume 0 == read_history_bool_~history_id; 18860#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 18639#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 18843#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 18844#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 19017#L116-2 assume !(add_history_type_~var~0 < 3); 19014#L116-3 add_history_type_#res := 1; 18875#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 18876#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18990#L116-6 assume !!(add_history_type_~var~0 < 3); 18984#L117-2 assume !(0 == add_history_type_~history_id); 18985#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19015#L171-4 assume !(0 == read_history_bool_~history_id); 18917#L181-4 assume 1 == read_history_bool_~history_id; 18918#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18821#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18705#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18680#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 18869#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18870#L116-10 assume !!(add_history_type_~var~0 < 3); 18978#L117-4 assume !(0 == add_history_type_~history_id); 18979#L123-4 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19033#L171-7 assume !(0 == read_history_bool_~history_id); 18946#L181-7 assume 1 == read_history_bool_~history_id; 18947#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18757#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18700#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18673#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 18646#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18647#L116-14 assume !!(add_history_type_~var~0 < 3); 18963#L117-6 assume !(0 == add_history_type_~history_id); 18965#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19024#L171-10 assume !(0 == read_history_bool_~history_id); 18934#L181-10 assume 1 == read_history_bool_~history_id; 18935#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18733#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18692#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18665#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 18904#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 18872#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 18781#L554-2 [2018-11-28 12:18:31,589 INFO L796 eck$LassoCheckResult]: Loop: 18781#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 18782#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 18867#L574-16 assume 0 != ~gate1Failed~0 % 256; 18865#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 18866#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 18873#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 18857#L226-2 assume !(0 == write_history_bool_~history_id); 18858#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 18880#L574-17 assume 0 != ~gate2Failed~0 % 256; 18794#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 18795#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 18915#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 18916#L226-4 assume !(0 == write_history_bool_~history_id); 19115#L231-4 assume !(1 == write_history_bool_~history_id); 19114#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 19109#L574-18 assume 0 != ~gate3Failed~0 % 256; 19107#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 19105#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 19037#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 18993#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 18777#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 19083#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 19082#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 19075#L294 assume !(0 == ~gate1Failed~0 % 256); 18897#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 18898#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19020#L171-12 assume 0 == read_history_bool_~history_id; 18992#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 18797#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 18669#L307 assume !(0 == check_~tmp___3~0 % 256); 18670#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 18677#L151-7 assume 3 == read_history_int8_~history_id; 18749#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 18750#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 18752#L346 assume !(check_~tmp___10~0 > -2); 18952#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 18953#L151-9 assume 3 == read_history_int8_~history_id; 18737#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 18738#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 18740#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 18817#L366-1 check_#res := 1; 18806#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 18807#L579-72 assume !(0 == assert_~arg % 256); 18853#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 18781#L554-2 [2018-11-28 12:18:31,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1987741776, now seen corresponding path program 2 times [2018-11-28 12:18:31,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:31,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:18:31,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:18:31,638 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:31,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1221692518, now seen corresponding path program 1 times [2018-11-28 12:18:31,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:18:31,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:31,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:31,670 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:18:31,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:18:31,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:18:31,670 INFO L87 Difference]: Start difference. First operand 492 states and 766 transitions. cyclomatic complexity: 279 Second operand 3 states. [2018-11-28 12:18:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:31,686 INFO L93 Difference]: Finished difference Result 714 states and 1116 transitions. [2018-11-28 12:18:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:18:31,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 714 states and 1116 transitions. [2018-11-28 12:18:31,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 471 [2018-11-28 12:18:31,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 714 states to 714 states and 1116 transitions. [2018-11-28 12:18:31,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 593 [2018-11-28 12:18:31,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 593 [2018-11-28 12:18:31,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 714 states and 1116 transitions. [2018-11-28 12:18:31,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:31,695 INFO L705 BuchiCegarLoop]: Abstraction has 714 states and 1116 transitions. [2018-11-28 12:18:31,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states and 1116 transitions. [2018-11-28 12:18:31,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 551. [2018-11-28 12:18:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-11-28 12:18:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 856 transitions. [2018-11-28 12:18:31,702 INFO L728 BuchiCegarLoop]: Abstraction has 551 states and 856 transitions. [2018-11-28 12:18:31,702 INFO L608 BuchiCegarLoop]: Abstraction has 551 states and 856 transitions. [2018-11-28 12:18:31,702 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 12:18:31,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 551 states and 856 transitions. [2018-11-28 12:18:31,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2018-11-28 12:18:31,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:31,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:31,706 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,706 INFO L794 eck$LassoCheckResult]: Stem: 20118#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 19874#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19875#L116-2 assume !!(add_history_type_~var~0 < 3); 20213#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 20074#L171 assume 0 == read_history_bool_~history_id; 20075#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 19853#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 20058#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 20059#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 20231#L116-2 assume !(add_history_type_~var~0 < 3); 20228#L116-3 add_history_type_#res := 1; 20090#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 20091#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 20204#L116-6 assume !!(add_history_type_~var~0 < 3); 20198#L117-2 assume !(0 == add_history_type_~history_id); 20199#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 20229#L171-4 assume !(0 == read_history_bool_~history_id); 20131#L181-4 assume 1 == read_history_bool_~history_id; 20132#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 20036#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19919#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19894#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 20085#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 20086#L116-10 assume !!(add_history_type_~var~0 < 3); 20192#L117-4 assume !(0 == add_history_type_~history_id); 20193#L123-4 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 20246#L171-7 assume !(0 == read_history_bool_~history_id); 20160#L181-7 assume 1 == read_history_bool_~history_id; 20161#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 19972#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19914#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19888#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 19860#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19861#L116-14 assume !!(add_history_type_~var~0 < 3); 20177#L117-6 assume !(0 == add_history_type_~history_id); 20179#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 20237#L171-10 assume !(0 == read_history_bool_~history_id); 20148#L181-10 assume 1 == read_history_bool_~history_id; 20149#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 19950#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19906#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19882#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 20119#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 20088#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 19996#L554-2 [2018-11-28 12:18:31,707 INFO L796 eck$LassoCheckResult]: Loop: 19996#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 19997#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 20082#L574-16 assume 0 != ~gate1Failed~0 % 256; 20080#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 20081#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 20087#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 20072#L226-2 assume !(0 == write_history_bool_~history_id); 20073#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 20366#L574-17 assume 0 != ~gate2Failed~0 % 256; 20365#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 20364#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 20363#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 20360#L226-4 assume !(0 == write_history_bool_~history_id); 20358#L231-4 assume !(1 == write_history_bool_~history_id); 20356#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 20353#L574-18 assume 0 != ~gate3Failed~0 % 256; 20352#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 20350#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 20348#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 20346#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 20338#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 20320#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 20314#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 20311#L294 assume !(0 == ~gate1Failed~0 % 256); 20113#L297 assume !(0 == ~gate2Failed~0 % 256); 20114#L300 assume 0 == ~gate3Failed~0 % 256;check_~tmp~2 := 1; 20285#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 20233#L171-12 assume 0 == read_history_bool_~history_id; 20206#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 20007#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 19878#L307 assume !(0 == check_~tmp___3~0 % 256); 19879#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 19886#L151-7 assume 3 == read_history_int8_~history_id; 19960#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 19961#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 19967#L346 assume !(check_~tmp___10~0 > -2); 20166#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 20167#L151-9 assume 3 == read_history_int8_~history_id; 19946#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 19947#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 19955#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 20032#L366-1 check_#res := 1; 20020#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 20021#L579-72 assume !(0 == assert_~arg % 256); 20068#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 19996#L554-2 [2018-11-28 12:18:31,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1987741776, now seen corresponding path program 3 times [2018-11-28 12:18:31,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:31,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:18:31,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:18:31,744 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:31,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,744 INFO L82 PathProgramCache]: Analyzing trace with hash 414922554, now seen corresponding path program 1 times [2018-11-28 12:18:31,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:18:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:31,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:31,765 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:18:31,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:18:31,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:18:31,766 INFO L87 Difference]: Start difference. First operand 551 states and 856 transitions. cyclomatic complexity: 310 Second operand 4 states. [2018-11-28 12:18:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:31,797 INFO L93 Difference]: Finished difference Result 866 states and 1345 transitions. [2018-11-28 12:18:31,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:18:31,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 866 states and 1345 transitions. [2018-11-28 12:18:31,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 616 [2018-11-28 12:18:31,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 866 states to 831 states and 1292 transitions. [2018-11-28 12:18:31,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 710 [2018-11-28 12:18:31,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 710 [2018-11-28 12:18:31,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 831 states and 1292 transitions. [2018-11-28 12:18:31,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:31,805 INFO L705 BuchiCegarLoop]: Abstraction has 831 states and 1292 transitions. [2018-11-28 12:18:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states and 1292 transitions. [2018-11-28 12:18:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 518. [2018-11-28 12:18:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-11-28 12:18:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 804 transitions. [2018-11-28 12:18:31,814 INFO L728 BuchiCegarLoop]: Abstraction has 518 states and 804 transitions. [2018-11-28 12:18:31,814 INFO L608 BuchiCegarLoop]: Abstraction has 518 states and 804 transitions. [2018-11-28 12:18:31,814 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 12:18:31,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 518 states and 804 transitions. [2018-11-28 12:18:31,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2018-11-28 12:18:31,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:31,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:31,817 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,817 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,818 INFO L794 eck$LassoCheckResult]: Stem: 21525#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 21301#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 21302#L116-2 assume !!(add_history_type_~var~0 < 3); 21610#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21482#L171 assume 0 == read_history_bool_~history_id; 21483#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 21280#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 21470#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 21471#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 21626#L116-2 assume !(add_history_type_~var~0 < 3); 21624#L116-3 add_history_type_#res := 1; 21498#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 21499#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 21602#L116-6 assume !!(add_history_type_~var~0 < 3); 21598#L117-2 assume !(0 == add_history_type_~history_id); 21599#L123-2 assume !(1 == add_history_type_~history_id); 21687#L129-2 assume !(2 == add_history_type_~history_id); 21659#L135-3 assume !(3 == add_history_type_~history_id); 21321#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 21641#L116-6 assume !(add_history_type_~var~0 < 3); 21634#L116-7 add_history_type_#res := 1; 21529#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 21492#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 21493#L116-10 assume !!(add_history_type_~var~0 < 3); 21593#L117-4 assume !(0 == add_history_type_~history_id); 21594#L123-4 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21642#L171-7 assume !(0 == read_history_bool_~history_id); 21562#L181-7 assume 1 == read_history_bool_~history_id; 21563#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 21387#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 21330#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 21314#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 21287#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 21288#L116-14 assume !!(add_history_type_~var~0 < 3); 21579#L117-6 assume !(0 == add_history_type_~history_id); 21581#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21632#L171-10 assume !(0 == read_history_bool_~history_id); 21550#L181-10 assume 1 == read_history_bool_~history_id; 21551#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 21365#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 21325#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 21306#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 21526#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 21495#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 21410#L554-2 [2018-11-28 12:18:31,818 INFO L796 eck$LassoCheckResult]: Loop: 21410#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 21411#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 21490#L574-16 assume 0 != ~gate1Failed~0 % 256; 21488#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 21489#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 21496#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 21752#L226-2 assume !(0 == write_history_bool_~history_id); 21750#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 21747#L574-17 assume 0 != ~gate2Failed~0 % 256; 21748#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 21793#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 21792#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 21791#L226-4 assume !(0 == write_history_bool_~history_id); 21790#L231-4 assume !(1 == write_history_bool_~history_id); 21787#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 21783#L574-18 assume 0 != ~gate3Failed~0 % 256; 21781#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 21780#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 21778#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 21776#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 21771#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 21769#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 21768#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 21683#L294 assume !(0 == ~gate1Failed~0 % 256); 21520#L297 assume !(0 == ~gate2Failed~0 % 256); 21521#L300 assume 0 == ~gate3Failed~0 % 256;check_~tmp~2 := 1; 21677#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21627#L171-12 assume 0 == read_history_bool_~history_id; 21604#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 21424#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 21310#L307 assume !(0 == check_~tmp___3~0 % 256); 21311#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 21318#L151-7 assume 3 == read_history_int8_~history_id; 21382#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 21383#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 21385#L346 assume !(check_~tmp___10~0 > -2); 21568#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 21569#L151-9 assume 3 == read_history_int8_~history_id; 21370#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 21371#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 21373#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 21446#L366-1 check_#res := 1; 21436#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 21437#L579-72 assume !(0 == assert_~arg % 256); 21476#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 21410#L554-2 [2018-11-28 12:18:31,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2106629905, now seen corresponding path program 2 times [2018-11-28 12:18:31,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:31,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:18:31,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:31,856 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:31,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,857 INFO L82 PathProgramCache]: Analyzing trace with hash 414922554, now seen corresponding path program 2 times [2018-11-28 12:18:31,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:18:31,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:31,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:31,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:31,897 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:18:31,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:18:31,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:18:31,898 INFO L87 Difference]: Start difference. First operand 518 states and 804 transitions. cyclomatic complexity: 291 Second operand 3 states. [2018-11-28 12:18:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:31,932 INFO L93 Difference]: Finished difference Result 827 states and 1278 transitions. [2018-11-28 12:18:31,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:18:31,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 827 states and 1278 transitions. [2018-11-28 12:18:31,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 616 [2018-11-28 12:18:31,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 827 states to 827 states and 1278 transitions. [2018-11-28 12:18:31,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 718 [2018-11-28 12:18:31,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 718 [2018-11-28 12:18:31,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 827 states and 1278 transitions. [2018-11-28 12:18:31,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:31,942 INFO L705 BuchiCegarLoop]: Abstraction has 827 states and 1278 transitions. [2018-11-28 12:18:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states and 1278 transitions. [2018-11-28 12:18:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 508. [2018-11-28 12:18:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-28 12:18:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 784 transitions. [2018-11-28 12:18:31,950 INFO L728 BuchiCegarLoop]: Abstraction has 508 states and 784 transitions. [2018-11-28 12:18:31,950 INFO L608 BuchiCegarLoop]: Abstraction has 508 states and 784 transitions. [2018-11-28 12:18:31,950 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 12:18:31,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 508 states and 784 transitions. [2018-11-28 12:18:31,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2018-11-28 12:18:31,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:31,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:31,953 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,953 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:31,954 INFO L794 eck$LassoCheckResult]: Stem: 22870#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 22653#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22654#L116-2 assume !!(add_history_type_~var~0 < 3); 22954#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22827#L171 assume 0 == read_history_bool_~history_id; 22828#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 22632#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 22819#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 22820#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 22969#L116-2 assume !(add_history_type_~var~0 < 3); 22967#L116-3 add_history_type_#res := 1; 22843#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 22844#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22946#L116-6 assume !!(add_history_type_~var~0 < 3); 22942#L117-2 assume !(0 == add_history_type_~history_id); 22943#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22968#L171-4 assume !(0 == read_history_bool_~history_id); 22878#L181-4 assume 1 == read_history_bool_~history_id; 22879#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22797#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22687#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 22688#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 22984#L116-6 assume !(add_history_type_~var~0 < 3); 22978#L116-7 add_history_type_#res := 1; 22874#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 22837#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22838#L116-10 assume !!(add_history_type_~var~0 < 3); 22936#L117-4 assume !(0 == add_history_type_~history_id); 22937#L123-4 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22985#L171-7 assume !(0 == read_history_bool_~history_id); 22904#L181-7 assume 1 == read_history_bool_~history_id; 22905#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22741#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22681#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22666#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 22639#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22640#L116-14 assume !!(add_history_type_~var~0 < 3); 22922#L117-6 assume !(0 == add_history_type_~history_id); 22924#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22976#L171-10 assume !(0 == read_history_bool_~history_id); 22892#L181-10 assume 1 == read_history_bool_~history_id; 22893#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22716#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22675#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22658#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 22871#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 22840#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 22759#L554-2 [2018-11-28 12:18:31,959 INFO L796 eck$LassoCheckResult]: Loop: 22759#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 22760#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 22835#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 22881#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 22832#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 22839#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 22966#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 22970#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 23129#L226-2 assume !(0 == write_history_bool_~history_id); 23127#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 23125#L574-17 assume 0 != ~gate2Failed~0 % 256; 23124#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 23123#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 23122#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 23121#L226-4 assume !(0 == write_history_bool_~history_id); 23116#L231-4 assume !(1 == write_history_bool_~history_id); 23112#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 23105#L574-18 assume 0 != ~gate3Failed~0 % 256; 23097#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 23092#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 23088#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 23069#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 23056#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 23051#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 23047#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 23044#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 23018#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22971#L171-12 assume 0 == read_history_bool_~history_id; 22948#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 22773#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 22662#L307 assume !(0 == check_~tmp___3~0 % 256); 22663#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 22670#L151-7 assume 3 == read_history_int8_~history_id; 22733#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 22734#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 22736#L346 assume !(check_~tmp___10~0 > -2); 22910#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 22911#L151-9 assume 3 == read_history_int8_~history_id; 22721#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 22722#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 22724#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 22794#L366-1 check_#res := 1; 22785#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 22786#L579-72 assume !(0 == assert_~arg % 256); 22821#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 22759#L554-2 [2018-11-28 12:18:31,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 1 times [2018-11-28 12:18:31,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:31,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:31,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:18:31,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:18:32,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:32,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:32,015 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:32,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:32,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1561137736, now seen corresponding path program 1 times [2018-11-28 12:18:32,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:32,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:32,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:32,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:32,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:32,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:32,052 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:18:32,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:18:32,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:18:32,052 INFO L87 Difference]: Start difference. First operand 508 states and 784 transitions. cyclomatic complexity: 283 Second operand 3 states. [2018-11-28 12:18:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:32,138 INFO L93 Difference]: Finished difference Result 775 states and 1147 transitions. [2018-11-28 12:18:32,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:18:32,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 775 states and 1147 transitions. [2018-11-28 12:18:32,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2018-11-28 12:18:32,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 775 states to 775 states and 1147 transitions. [2018-11-28 12:18:32,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 613 [2018-11-28 12:18:32,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 613 [2018-11-28 12:18:32,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 775 states and 1147 transitions. [2018-11-28 12:18:32,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:32,144 INFO L705 BuchiCegarLoop]: Abstraction has 775 states and 1147 transitions. [2018-11-28 12:18:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states and 1147 transitions. [2018-11-28 12:18:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 508. [2018-11-28 12:18:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-28 12:18:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 756 transitions. [2018-11-28 12:18:32,151 INFO L728 BuchiCegarLoop]: Abstraction has 508 states and 756 transitions. [2018-11-28 12:18:32,151 INFO L608 BuchiCegarLoop]: Abstraction has 508 states and 756 transitions. [2018-11-28 12:18:32,151 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 12:18:32,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 508 states and 756 transitions. [2018-11-28 12:18:32,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2018-11-28 12:18:32,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:32,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:32,154 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:32,154 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:32,154 INFO L794 eck$LassoCheckResult]: Stem: 24159#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 23943#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 23944#L116-2 assume !!(add_history_type_~var~0 < 3); 24241#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 24116#L171 assume 0 == read_history_bool_~history_id; 24117#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 23919#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 24108#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 24109#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 24256#L116-2 assume !(add_history_type_~var~0 < 3); 24254#L116-3 add_history_type_#res := 1; 24131#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 24132#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 24234#L116-6 assume !!(add_history_type_~var~0 < 3); 24230#L117-2 assume !(0 == add_history_type_~history_id); 24231#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 24255#L171-4 assume !(0 == read_history_bool_~history_id); 24167#L181-4 assume 1 == read_history_bool_~history_id; 24168#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 24086#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23977#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 23978#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 24271#L116-6 assume !(add_history_type_~var~0 < 3); 24265#L116-7 add_history_type_#res := 1; 24163#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 24126#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 24127#L116-10 assume !!(add_history_type_~var~0 < 3); 24224#L117-4 assume !(0 == add_history_type_~history_id); 24225#L123-4 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 24272#L171-7 assume !(0 == read_history_bool_~history_id); 24193#L181-7 assume 1 == read_history_bool_~history_id; 24194#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 24027#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23971#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23956#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 23929#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 23930#L116-14 assume !!(add_history_type_~var~0 < 3); 24210#L117-6 assume !(0 == add_history_type_~history_id); 24212#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 24263#L171-10 assume !(0 == read_history_bool_~history_id); 24181#L181-10 assume 1 == read_history_bool_~history_id; 24182#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 24005#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23965#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23948#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 24160#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 24129#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 24048#L554-2 [2018-11-28 12:18:32,154 INFO L796 eck$LassoCheckResult]: Loop: 24048#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 24049#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 24124#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 24170#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 24121#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 24128#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 24253#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 24257#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 24401#L226-2 assume !(0 == write_history_bool_~history_id); 24399#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 24397#L574-17 assume 0 != ~gate2Failed~0 % 256; 24394#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 24392#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 24390#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 24388#L226-4 assume !(0 == write_history_bool_~history_id); 24386#L231-4 assume !(1 == write_history_bool_~history_id); 24384#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 24380#L574-18 assume 0 != ~gate3Failed~0 % 256; 24377#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 24374#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 24371#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 24366#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 24359#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 24348#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 24347#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 24324#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 24305#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 24258#L171-12 assume 0 == read_history_bool_~history_id; 24236#L172-12 assume !(0 == read_history_bool_~historyIndex); 24207#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 24062#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 23952#L307 assume !(0 == check_~tmp___3~0 % 256); 23953#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 23960#L151-7 assume 3 == read_history_int8_~history_id; 24022#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 24023#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 24025#L346 assume !(check_~tmp___10~0 > -2); 24199#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 24200#L151-9 assume 3 == read_history_int8_~history_id; 24010#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 24011#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 24013#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 24084#L366-1 check_#res := 1; 24074#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 24075#L579-72 assume !(0 == assert_~arg % 256); 24110#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 24048#L554-2 [2018-11-28 12:18:32,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:32,154 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 2 times [2018-11-28 12:18:32,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:32,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:32,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:32,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:18:32,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:32,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:32,187 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:32,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:32,188 INFO L82 PathProgramCache]: Analyzing trace with hash -33204935, now seen corresponding path program 1 times [2018-11-28 12:18:32,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:32,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:32,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:18:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:32,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:32,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:18:32,217 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:18:32,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:18:32,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:18:32,217 INFO L87 Difference]: Start difference. First operand 508 states and 756 transitions. cyclomatic complexity: 255 Second operand 4 states. [2018-11-28 12:18:32,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:32,391 INFO L93 Difference]: Finished difference Result 1400 states and 2070 transitions. [2018-11-28 12:18:32,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:18:32,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1400 states and 2070 transitions. [2018-11-28 12:18:32,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 569 [2018-11-28 12:18:32,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1400 states to 1400 states and 2070 transitions. [2018-11-28 12:18:32,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1138 [2018-11-28 12:18:32,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1138 [2018-11-28 12:18:32,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1400 states and 2070 transitions. [2018-11-28 12:18:32,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:32,400 INFO L705 BuchiCegarLoop]: Abstraction has 1400 states and 2070 transitions. [2018-11-28 12:18:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states and 2070 transitions. [2018-11-28 12:18:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 508. [2018-11-28 12:18:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-28 12:18:32,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 755 transitions. [2018-11-28 12:18:32,410 INFO L728 BuchiCegarLoop]: Abstraction has 508 states and 755 transitions. [2018-11-28 12:18:32,410 INFO L608 BuchiCegarLoop]: Abstraction has 508 states and 755 transitions. [2018-11-28 12:18:32,410 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 12:18:32,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 508 states and 755 transitions. [2018-11-28 12:18:32,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2018-11-28 12:18:32,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:32,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:32,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:32,413 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:32,413 INFO L794 eck$LassoCheckResult]: Stem: 26078#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 25862#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 25863#L116-2 assume !!(add_history_type_~var~0 < 3); 26159#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 26035#L171 assume 0 == read_history_bool_~history_id; 26036#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 25841#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 26027#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 26028#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 26174#L116-2 assume !(add_history_type_~var~0 < 3); 26172#L116-3 add_history_type_#res := 1; 26051#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 26052#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 26152#L116-6 assume !!(add_history_type_~var~0 < 3); 26148#L117-2 assume !(0 == add_history_type_~history_id); 26149#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 26173#L171-4 assume !(0 == read_history_bool_~history_id); 26086#L181-4 assume 1 == read_history_bool_~history_id; 26087#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 26013#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25898#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 25899#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 26188#L116-6 assume !(add_history_type_~var~0 < 3); 26182#L116-7 add_history_type_#res := 1; 26082#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 26046#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 26047#L116-10 assume !!(add_history_type_~var~0 < 3); 26142#L117-4 assume !(0 == add_history_type_~history_id); 26143#L123-4 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 26189#L171-7 assume !(0 == read_history_bool_~history_id); 26112#L181-7 assume 1 == read_history_bool_~history_id; 26113#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25946#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25887#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25875#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 25848#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 25849#L116-14 assume !!(add_history_type_~var~0 < 3); 26129#L117-6 assume !(0 == add_history_type_~history_id); 26131#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 26180#L171-10 assume !(0 == read_history_bool_~history_id); 26100#L181-10 assume 1 == read_history_bool_~history_id; 26101#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25924#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25884#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25867#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 26079#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 26048#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 25967#L554-2 [2018-11-28 12:18:32,413 INFO L796 eck$LassoCheckResult]: Loop: 25967#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 25968#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 26043#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 26089#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 26040#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 26045#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 26171#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 26133#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 26033#L226-2 assume !(0 == write_history_bool_~history_id); 26034#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 26054#L574-17 assume 0 != ~gate2Failed~0 % 256; 25979#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 25927#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 25928#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 26344#L226-4 assume !(0 == write_history_bool_~history_id); 26343#L231-4 assume !(1 == write_history_bool_~history_id); 26340#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 26336#L574-18 assume 0 != ~gate3Failed~0 % 256; 26334#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 26333#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 26331#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 26155#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 25965#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 26233#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 26232#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 26243#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 26222#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 26175#L171-12 assume 0 == read_history_bool_~history_id; 26154#L172-12 assume !(0 == read_history_bool_~historyIndex); 26126#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 25981#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 25871#L307 assume !(0 == check_~tmp___3~0 % 256); 25872#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 25879#L151-7 assume !(3 == read_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 26208#L579-54 assume !(0 == assert_~arg % 256); 26211#L574-27 read_history_int8_#res := -2; 25943#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 25944#L346 assume !(check_~tmp___10~0 > -2); 26118#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 26119#L151-9 assume 3 == read_history_int8_~history_id; 25929#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 25930#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 25932#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 26003#L366-1 check_#res := 1; 25993#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 25994#L579-72 assume !(0 == assert_~arg % 256); 26029#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 25967#L554-2 [2018-11-28 12:18:32,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:32,413 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 3 times [2018-11-28 12:18:32,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:32,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:32,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:32,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:18:32,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:32,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:32,451 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:32,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:32,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1774370779, now seen corresponding path program 1 times [2018-11-28 12:18:32,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:32,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:18:32,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:32,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:32,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:32,473 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:18:32,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:18:32,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:18:32,473 INFO L87 Difference]: Start difference. First operand 508 states and 755 transitions. cyclomatic complexity: 254 Second operand 3 states. [2018-11-28 12:18:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:32,516 INFO L93 Difference]: Finished difference Result 809 states and 1208 transitions. [2018-11-28 12:18:32,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:18:32,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 809 states and 1208 transitions. [2018-11-28 12:18:32,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 290 [2018-11-28 12:18:32,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 809 states to 809 states and 1208 transitions. [2018-11-28 12:18:32,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 640 [2018-11-28 12:18:32,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 640 [2018-11-28 12:18:32,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 809 states and 1208 transitions. [2018-11-28 12:18:32,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:32,523 INFO L705 BuchiCegarLoop]: Abstraction has 809 states and 1208 transitions. [2018-11-28 12:18:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states and 1208 transitions. [2018-11-28 12:18:32,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 482. [2018-11-28 12:18:32,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-11-28 12:18:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 716 transitions. [2018-11-28 12:18:32,529 INFO L728 BuchiCegarLoop]: Abstraction has 482 states and 716 transitions. [2018-11-28 12:18:32,530 INFO L608 BuchiCegarLoop]: Abstraction has 482 states and 716 transitions. [2018-11-28 12:18:32,530 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 12:18:32,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 716 transitions. [2018-11-28 12:18:32,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 290 [2018-11-28 12:18:32,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:32,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:32,532 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:32,532 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:32,532 INFO L794 eck$LassoCheckResult]: Stem: 27400#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 27186#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 27187#L116-2 assume !!(add_history_type_~var~0 < 3); 27478#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27357#L171 assume 0 == read_history_bool_~history_id; 27358#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 27165#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 27349#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 27350#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 27493#L116-2 assume !(add_history_type_~var~0 < 3); 27491#L116-3 add_history_type_#res := 1; 27373#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 27374#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 27471#L116-6 assume !!(add_history_type_~var~0 < 3); 27467#L117-2 assume !(0 == add_history_type_~history_id); 27468#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27492#L171-4 assume !(0 == read_history_bool_~history_id); 27408#L181-4 assume 1 == read_history_bool_~history_id; 27409#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 27331#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 27222#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 27223#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 27508#L116-6 assume !(add_history_type_~var~0 < 3); 27502#L116-7 add_history_type_#res := 1; 27404#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 27368#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 27369#L116-10 assume !!(add_history_type_~var~0 < 3); 27461#L117-4 assume !(0 == add_history_type_~history_id); 27463#L123-4 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27509#L171-7 assume !(0 == read_history_bool_~history_id); 27434#L181-7 assume 1 == read_history_bool_~history_id; 27435#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 27273#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 27214#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 27200#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 27172#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 27173#L116-14 assume !!(add_history_type_~var~0 < 3); 27451#L117-6 assume !(0 == add_history_type_~history_id); 27453#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27500#L171-10 assume !(0 == read_history_bool_~history_id); 27422#L181-10 assume 1 == read_history_bool_~history_id; 27423#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 27253#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 27208#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 27191#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 27401#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 27370#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 27291#L554-2 [2018-11-28 12:18:32,532 INFO L796 eck$LassoCheckResult]: Loop: 27291#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 27292#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 27365#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 27411#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 27362#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 27367#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 27490#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 27494#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 27596#L226-2 assume !(0 == write_history_bool_~history_id); 27594#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 27591#L574-17 assume 0 != ~gate2Failed~0 % 256; 27592#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 27640#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 27639#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 27636#L226-4 assume !(0 == write_history_bool_~history_id); 27634#L231-4 assume !(1 == write_history_bool_~history_id); 27632#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 27629#L574-18 assume 0 != ~gate3Failed~0 % 256; 27628#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 27626#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 27624#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 27622#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 27615#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 27613#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 27612#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 27541#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 27526#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27495#L171-12 assume 0 == read_history_bool_~history_id; 27473#L172-12 assume !(0 == read_history_bool_~historyIndex); 27448#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 27305#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 27195#L307 assume !(0 == check_~tmp___3~0 % 256); 27196#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 27198#L151-7 assume 3 == read_history_int8_~history_id; 27261#L152-7 assume !(0 == read_history_int8_~historyIndex); 27262#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 27267#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 27268#L346 assume !(check_~tmp___10~0 > -2); 27440#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 27441#L151-9 assume 3 == read_history_int8_~history_id; 27249#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 27250#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 27256#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 27327#L366-1 check_#res := 1; 27317#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 27318#L579-72 assume !(0 == assert_~arg % 256); 27351#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 27291#L554-2 [2018-11-28 12:18:32,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:32,533 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 4 times [2018-11-28 12:18:32,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:32,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:32,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:32,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:18:32,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:32,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:32,575 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:32,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1680706438, now seen corresponding path program 1 times [2018-11-28 12:18:32,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:32,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:32,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:18:32,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:33,182 WARN L180 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 219 [2018-11-28 12:18:34,733 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 186 DAG size of output: 167 [2018-11-28 12:18:34,735 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:18:34,735 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:18:34,735 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:18:34,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:18:34,736 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:18:34,736 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:34,736 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:18:34,736 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:18:34,736 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration16_Loop [2018-11-28 12:18:34,736 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:18:34,736 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:18:34,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:34,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:35,047 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-28 12:18:35,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:35,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:35,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:35,546 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-28 12:18:37,933 WARN L180 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 153 DAG size of output: 129 [2018-11-28 12:18:37,947 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:18:37,947 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:37,950 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:37,951 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:37,953 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:37,953 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___14~0=0} Honda state: {ULTIMATE.start_check_~tmp___14~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:37,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:37,969 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:37,972 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:37,972 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:37,988 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:37,989 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:37,991 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:18:37,991 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret24=0} Honda state: {ULTIMATE.start_check_#t~ret24=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:38,007 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:18:38,007 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:38,051 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:18:38,051 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:18:51,199 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 12:18:51,205 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:18:51,205 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:18:51,205 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:18:51,205 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:18:51,205 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:18:51,205 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:18:51,205 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:18:51,205 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:18:51,205 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration16_Loop [2018-11-28 12:18:51,205 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:18:51,206 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:18:51,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,377 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-28 12:18:51,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:18:51,699 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-28 12:18:54,140 WARN L180 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 153 DAG size of output: 129 [2018-11-28 12:18:54,256 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:18:54,256 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:18:54,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:54,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:54,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:54,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:54,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:54,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:54,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:54,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:54,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:54,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:54,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:54,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:54,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:54,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:54,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:54,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:54,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:54,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:54,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:54,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:54,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:54,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:54,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:54,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:54,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:54,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:54,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:54,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:54,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:54,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:54,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:54,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:54,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:54,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:54,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:54,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:54,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:54,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:54,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:54,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:54,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:54,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:54,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:54,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:54,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:54,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:54,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:54,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:54,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:54,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:54,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:54,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:54,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:54,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:54,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:54,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:54,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:54,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:54,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:54,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:54,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:54,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:54,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:54,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:54,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:54,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:54,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:54,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:18:54,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:54,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:18:54,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:54,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:18:54,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:18:54,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:18:54,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:18:54,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:18:54,273 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2018-11-28 12:18:54,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:18:54,291 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 12:18:54,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:18:54,402 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:18:54,580 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:18:54,580 INFO L444 ModelExtractionUtils]: 18 out of 23 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:18:54,580 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:18:54,580 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:18:54,581 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:18:54,581 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~votedValue_History_0~0, ~g1v_old~0, ~nomsg~0) = -1*~votedValue_History_0~0 - 1*~g1v_old~0 + 1*~nomsg~0 Supporting invariants [] [2018-11-28 12:18:54,581 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:18:54,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:54,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:18:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:54,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:18:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:54,909 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 15 loop predicates [2018-11-28 12:18:54,910 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 482 states and 716 transitions. cyclomatic complexity: 241 Second operand 17 states. [2018-11-28 12:18:57,408 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 482 states and 716 transitions. cyclomatic complexity: 241. Second operand 17 states. Result 4969 states and 7085 transitions. Complement of second has 81 states. [2018-11-28 12:18:57,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 41 states 1 stem states 39 non-accepting loop states 1 accepting loop states [2018-11-28 12:18:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 12:18:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2090 transitions. [2018-11-28 12:18:57,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 2090 transitions. Stem has 47 letters. Loop has 47 letters. [2018-11-28 12:18:57,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:57,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 2090 transitions. Stem has 94 letters. Loop has 47 letters. [2018-11-28 12:18:57,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:57,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 2090 transitions. Stem has 47 letters. Loop has 94 letters. [2018-11-28 12:18:57,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:18:57,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4969 states and 7085 transitions. [2018-11-28 12:18:57,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 821 [2018-11-28 12:18:57,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4969 states to 3331 states and 4785 transitions. [2018-11-28 12:18:57,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2619 [2018-11-28 12:18:57,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2621 [2018-11-28 12:18:57,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3331 states and 4785 transitions. [2018-11-28 12:18:57,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:57,445 INFO L705 BuchiCegarLoop]: Abstraction has 3331 states and 4785 transitions. [2018-11-28 12:18:57,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states and 4785 transitions. [2018-11-28 12:18:57,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 990. [2018-11-28 12:18:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2018-11-28 12:18:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1459 transitions. [2018-11-28 12:18:57,467 INFO L728 BuchiCegarLoop]: Abstraction has 990 states and 1459 transitions. [2018-11-28 12:18:57,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:18:57,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:18:57,468 INFO L87 Difference]: Start difference. First operand 990 states and 1459 transitions. Second operand 3 states. [2018-11-28 12:18:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:57,501 INFO L93 Difference]: Finished difference Result 1762 states and 2579 transitions. [2018-11-28 12:18:57,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:18:57,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1762 states and 2579 transitions. [2018-11-28 12:18:57,509 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 940 [2018-11-28 12:18:57,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1762 states to 1762 states and 2579 transitions. [2018-11-28 12:18:57,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1165 [2018-11-28 12:18:57,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1165 [2018-11-28 12:18:57,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1762 states and 2579 transitions. [2018-11-28 12:18:57,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:57,518 INFO L705 BuchiCegarLoop]: Abstraction has 1762 states and 2579 transitions. [2018-11-28 12:18:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states and 2579 transitions. [2018-11-28 12:18:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 958. [2018-11-28 12:18:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-11-28 12:18:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1403 transitions. [2018-11-28 12:18:57,532 INFO L728 BuchiCegarLoop]: Abstraction has 958 states and 1403 transitions. [2018-11-28 12:18:57,532 INFO L608 BuchiCegarLoop]: Abstraction has 958 states and 1403 transitions. [2018-11-28 12:18:57,532 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-28 12:18:57,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 958 states and 1403 transitions. [2018-11-28 12:18:57,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 470 [2018-11-28 12:18:57,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:57,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:57,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:57,535 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:57,535 INFO L794 eck$LassoCheckResult]: Stem: 36155#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 35861#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 35862#L116-2 assume !!(add_history_type_~var~0 < 3); 36251#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 36086#L171 assume 0 == read_history_bool_~history_id; 36087#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 35828#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 36073#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 36074#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 36278#L116-2 assume !(add_history_type_~var~0 < 3); 36276#L116-3 add_history_type_#res := 1; 36107#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 36108#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 36237#L116-6 assume !!(add_history_type_~var~0 < 3); 36235#L117-2 assume !(0 == add_history_type_~history_id); 36236#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 36277#L171-4 assume !(0 == read_history_bool_~history_id); 36166#L181-4 assume 1 == read_history_bool_~history_id; 36167#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 36059#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 35903#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 35904#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 36296#L116-6 assume !(add_history_type_~var~0 < 3); 36287#L116-7 add_history_type_#res := 1; 36161#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 36098#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 36099#L116-10 assume !!(add_history_type_~var~0 < 3); 36231#L117-4 assume !(0 == add_history_type_~history_id); 36233#L123-4 assume !(1 == add_history_type_~history_id); 36314#L129-4 assume 2 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 36290#L171-8 assume !(0 == read_history_bool_~history_id); 36190#L181-8 assume 1 == read_history_bool_~history_id; 36191#L182-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 35948#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 35878#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 35879#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 35841#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 35842#L116-14 assume !!(add_history_type_~var~0 < 3); 36215#L117-6 assume !(0 == add_history_type_~history_id); 36217#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 36285#L171-10 assume !(0 == read_history_bool_~history_id); 36184#L181-10 assume 1 == read_history_bool_~history_id; 36185#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 35928#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 35891#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 35868#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 36156#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 36104#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 36105#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 35991#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 36094#L574-16 assume 0 != ~gate1Failed~0 % 256; 36092#L391 [2018-11-28 12:18:57,536 INFO L796 eck$LassoCheckResult]: Loop: 36092#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 36093#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 36106#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 36591#L226-2 assume !(0 == write_history_bool_~history_id); 36589#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 36586#L574-17 assume 0 != ~gate2Failed~0 % 256; 36585#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 36582#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 36581#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 36578#L226-4 assume !(0 == write_history_bool_~history_id); 36576#L231-4 assume !(1 == write_history_bool_~history_id); 36571#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 36560#L574-18 assume 0 != ~gate3Failed~0 % 256; 36554#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 36546#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 36542#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 36537#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 36529#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 36471#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 36467#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 36465#L294 assume !(0 == ~gate1Failed~0 % 256); 36460#L297 assume !(0 == ~gate2Failed~0 % 256); 36462#L300 assume 0 == ~gate3Failed~0 % 256;check_~tmp~2 := 1; 36458#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 36455#L171-12 assume 0 == read_history_bool_~history_id; 36453#L172-12 assume !(0 == read_history_bool_~historyIndex); 36452#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 36448#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 36443#L307 assume !(0 == check_~tmp___3~0 % 256); 35883#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 35884#L151-7 assume 3 == read_history_int8_~history_id; 35951#L152-7 assume !(0 == read_history_int8_~historyIndex); 35952#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 35955#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 35956#L346 assume !(check_~tmp___10~0 > -2); 36196#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 36197#L151-9 assume 3 == read_history_int8_~history_id; 36436#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 36434#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 36435#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 36657#L366-1 check_#res := 1; 36067#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 36653#L579-72 assume !(0 == assert_~arg % 256); 36645#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 36639#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 36625#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 36603#L574-16 assume 0 != ~gate1Failed~0 % 256; 36092#L391 [2018-11-28 12:18:57,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:57,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1772607248, now seen corresponding path program 1 times [2018-11-28 12:18:57,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:57,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:57,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:18:57,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:57,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:18:57,580 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:57,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1508959966, now seen corresponding path program 1 times [2018-11-28 12:18:57,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:57,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:57,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:57,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:57,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:57,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:57,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:57,613 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:18:57,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:18:57,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:18:57,613 INFO L87 Difference]: Start difference. First operand 958 states and 1403 transitions. cyclomatic complexity: 454 Second operand 3 states. [2018-11-28 12:18:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:57,637 INFO L93 Difference]: Finished difference Result 1599 states and 2340 transitions. [2018-11-28 12:18:57,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:18:57,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1599 states and 2340 transitions. [2018-11-28 12:18:57,644 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 862 [2018-11-28 12:18:57,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1599 states to 1599 states and 2340 transitions. [2018-11-28 12:18:57,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1054 [2018-11-28 12:18:57,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1054 [2018-11-28 12:18:57,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1599 states and 2340 transitions. [2018-11-28 12:18:57,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:57,655 INFO L705 BuchiCegarLoop]: Abstraction has 1599 states and 2340 transitions. [2018-11-28 12:18:57,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states and 2340 transitions. [2018-11-28 12:18:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1131. [2018-11-28 12:18:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2018-11-28 12:18:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1679 transitions. [2018-11-28 12:18:57,679 INFO L728 BuchiCegarLoop]: Abstraction has 1131 states and 1679 transitions. [2018-11-28 12:18:57,679 INFO L608 BuchiCegarLoop]: Abstraction has 1131 states and 1679 transitions. [2018-11-28 12:18:57,679 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-28 12:18:57,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1131 states and 1679 transitions. [2018-11-28 12:18:57,681 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 570 [2018-11-28 12:18:57,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:57,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:57,691 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:57,691 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:57,691 INFO L794 eck$LassoCheckResult]: Stem: 38717#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 38426#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 38427#L116-2 assume !!(add_history_type_~var~0 < 3); 38818#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38650#L171 assume 0 == read_history_bool_~history_id; 38651#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 38396#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 38637#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 38638#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 38843#L116-2 assume !(add_history_type_~var~0 < 3); 38841#L116-3 add_history_type_#res := 1; 38672#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 38673#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 38803#L116-6 assume !!(add_history_type_~var~0 < 3); 38801#L117-2 assume !(0 == add_history_type_~history_id); 38802#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38842#L171-4 assume !(0 == read_history_bool_~history_id); 38730#L181-4 assume 1 == read_history_bool_~history_id; 38731#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 38632#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 38472#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 38473#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 38866#L116-6 assume !(add_history_type_~var~0 < 3); 38856#L116-7 add_history_type_#res := 1; 38723#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 38666#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 38667#L116-10 assume !!(add_history_type_~var~0 < 3); 38797#L117-4 assume !(0 == add_history_type_~history_id); 38799#L123-4 assume !(1 == add_history_type_~history_id); 38891#L129-4 assume 2 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38864#L171-8 assume !(0 == read_history_bool_~history_id); 38755#L181-8 assume 1 == read_history_bool_~history_id; 38756#L182-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 38517#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 38446#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 38447#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 38406#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 38407#L116-14 assume !!(add_history_type_~var~0 < 3); 38782#L117-6 assume !(0 == add_history_type_~history_id); 38784#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38854#L171-10 assume !(0 == read_history_bool_~history_id); 38749#L181-10 assume 1 == read_history_bool_~history_id; 38750#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 38493#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 38456#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 38433#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 38718#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 38668#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 38669#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 38556#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 38658#L574-16 assume 0 != ~gate1Failed~0 % 256; 38656#L391 [2018-11-28 12:18:57,691 INFO L796 eck$LassoCheckResult]: Loop: 38656#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 38657#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 38670#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 39194#L226-2 assume !(0 == write_history_bool_~history_id); 39192#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 39190#L574-17 assume 0 != ~gate2Failed~0 % 256; 39186#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 39181#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 39171#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 39170#L226-4 assume !(0 == write_history_bool_~history_id); 39169#L231-4 assume !(1 == write_history_bool_~history_id); 39168#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 39165#L574-18 assume 0 != ~gate3Failed~0 % 256; 39164#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 39163#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 39162#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 39159#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 39152#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 39150#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 39149#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 39146#L294 assume !(0 == ~gate1Failed~0 % 256); 39147#L297 assume !(0 == ~gate2Failed~0 % 256); 39312#L300 assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2 := 0; 39311#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 39310#L171-12 assume 0 == read_history_bool_~history_id; 39309#L172-12 assume !(0 == read_history_bool_~historyIndex); 38775#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 38583#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 38437#L307 assume !(0 == check_~tmp___3~0 % 256); 38438#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 38881#L151-7 assume 3 == read_history_int8_~history_id; 38882#L152-7 assume !(0 == read_history_int8_~historyIndex); 38816#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 38817#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 38779#L346 assume !(check_~tmp___10~0 > -2); 38780#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 38899#L151-9 assume 3 == read_history_int8_~history_id; 38900#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 39284#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 39474#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 39464#L366-1 check_#res := 1; 38629#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 39463#L579-72 assume !(0 == assert_~arg % 256); 39462#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 39461#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 39457#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 39455#L574-16 assume 0 != ~gate1Failed~0 % 256; 38656#L391 [2018-11-28 12:18:57,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:57,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1772607248, now seen corresponding path program 2 times [2018-11-28 12:18:57,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:57,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:57,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:57,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:57,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:18:57,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:57,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:18:57,758 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:57,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:57,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1368411356, now seen corresponding path program 1 times [2018-11-28 12:18:57,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:57,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:57,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:57,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:18:57,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:18:57,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:57,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:18:57,793 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:18:57,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:18:57,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:18:57,794 INFO L87 Difference]: Start difference. First operand 1131 states and 1679 transitions. cyclomatic complexity: 557 Second operand 3 states. [2018-11-28 12:18:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:57,813 INFO L93 Difference]: Finished difference Result 1134 states and 1679 transitions. [2018-11-28 12:18:57,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:18:57,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1134 states and 1679 transitions. [2018-11-28 12:18:57,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 549 [2018-11-28 12:18:57,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1134 states to 1108 states and 1637 transitions. [2018-11-28 12:18:57,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 712 [2018-11-28 12:18:57,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 712 [2018-11-28 12:18:57,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1108 states and 1637 transitions. [2018-11-28 12:18:57,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:18:57,828 INFO L705 BuchiCegarLoop]: Abstraction has 1108 states and 1637 transitions. [2018-11-28 12:18:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states and 1637 transitions. [2018-11-28 12:18:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2018-11-28 12:18:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-11-28 12:18:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1637 transitions. [2018-11-28 12:18:57,841 INFO L728 BuchiCegarLoop]: Abstraction has 1108 states and 1637 transitions. [2018-11-28 12:18:57,841 INFO L608 BuchiCegarLoop]: Abstraction has 1108 states and 1637 transitions. [2018-11-28 12:18:57,841 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-28 12:18:57,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1108 states and 1637 transitions. [2018-11-28 12:18:57,851 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 549 [2018-11-28 12:18:57,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:18:57,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:18:57,852 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:57,852 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:57,853 INFO L794 eck$LassoCheckResult]: Stem: 40995#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 40699#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 40700#L116-2 assume !!(add_history_type_~var~0 < 3); 41094#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 40925#L171 assume 0 == read_history_bool_~history_id; 40926#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 40666#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 40912#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 40913#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 41122#L116-2 assume !(add_history_type_~var~0 < 3); 41120#L116-3 add_history_type_#res := 1; 40947#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 40948#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 41080#L116-6 assume !!(add_history_type_~var~0 < 3); 41078#L117-2 assume !(0 == add_history_type_~history_id); 41079#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 41121#L171-4 assume !(0 == read_history_bool_~history_id); 41007#L181-4 assume 1 == read_history_bool_~history_id; 41008#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 40898#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 40741#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 40742#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 41140#L116-6 assume !(add_history_type_~var~0 < 3); 41131#L116-7 add_history_type_#res := 1; 41001#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 40938#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 40939#L116-10 assume !!(add_history_type_~var~0 < 3); 41074#L117-4 assume !(0 == add_history_type_~history_id); 41076#L123-4 assume !(1 == add_history_type_~history_id); 41160#L129-4 assume 2 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 41134#L171-8 assume !(0 == read_history_bool_~history_id); 41032#L181-8 assume 1 == read_history_bool_~history_id; 41033#L182-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 40786#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 40716#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 40717#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 40679#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 40680#L116-14 assume !!(add_history_type_~var~0 < 3); 41059#L117-6 assume !(0 == add_history_type_~history_id); 41060#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 41129#L171-10 assume !(0 == read_history_bool_~history_id); 41026#L181-10 assume 1 == read_history_bool_~history_id; 41027#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 40766#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 40729#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 40706#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 40996#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 40944#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 40945#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 41217#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 41666#L574-16 assume 0 != ~gate1Failed~0 % 256; 40931#L391 [2018-11-28 12:18:57,853 INFO L796 eck$LassoCheckResult]: Loop: 40931#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 40932#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 40946#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 41336#L226-2 assume !(0 == write_history_bool_~history_id); 41334#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 41331#L574-17 assume !(0 != ~gate2Failed~0 % 256);gate2_each_pals_period_~tmp~4 := gate2_each_pals_period_#t~nondet33;havoc gate2_each_pals_period_#t~nondet33;gate2_each_pals_period_~next_state~1 := gate2_each_pals_period_~tmp~4; 41329#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 41327#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 41326#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 41325#L439-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite34 % 256 <= 127 then gate2_each_pals_period_#t~ite34 % 256 else gate2_each_pals_period_#t~ite34 % 256 - 256);havoc gate2_each_pals_period_#t~ite34; 41324#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 41323#L226-4 assume !(0 == write_history_bool_~history_id); 41322#L231-4 assume !(1 == write_history_bool_~history_id); 41321#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 41318#L574-18 assume 0 != ~gate3Failed~0 % 256; 41319#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 41358#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 41356#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 41353#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 41346#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 41344#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 41343#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 41340#L294 assume !(0 == ~gate1Failed~0 % 256); 41341#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 41488#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 41485#L171-12 assume 0 == read_history_bool_~history_id; 41483#L172-12 assume !(0 == read_history_bool_~historyIndex); 41479#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 41474#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 40710#L307 assume !(0 == check_~tmp___3~0 % 256); 40711#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 41151#L151-7 assume 3 == read_history_int8_~history_id; 40789#L152-7 assume !(0 == read_history_int8_~historyIndex); 40790#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 41093#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 41056#L346 assume !(check_~tmp___10~0 > -2); 41057#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 41169#L151-9 assume 3 == read_history_int8_~history_id; 41170#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 41460#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 41591#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 41580#L366-1 check_#res := 1; 40906#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 41577#L579-72 assume !(0 == assert_~arg % 256); 41576#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 41572#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 41565#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 41564#L574-16 assume 0 != ~gate1Failed~0 % 256; 40931#L391 [2018-11-28 12:18:57,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:57,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1772607248, now seen corresponding path program 3 times [2018-11-28 12:18:57,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:57,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:57,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:57,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:57,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:18:57,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:57,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:18:57,902 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:18:57,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:57,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1128877933, now seen corresponding path program 1 times [2018-11-28 12:18:57,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:57,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:57,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:18:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:18:58,495 WARN L180 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 223 [2018-11-28 12:19:00,103 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 190 DAG size of output: 171 [2018-11-28 12:19:00,105 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:19:00,105 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:19:00,105 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:19:00,105 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:19:00,105 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:19:00,105 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:00,105 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:19:00,105 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:19:00,105 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration19_Loop [2018-11-28 12:19:00,105 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:19:00,106 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:19:00,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,449 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-28 12:19:00,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:00,613 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-28 12:19:00,843 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-28 12:19:03,528 WARN L180 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 153 DAG size of output: 129 [2018-11-28 12:19:03,536 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:19:03,536 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:03,556 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:03,556 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:03,559 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:03,559 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:03,594 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:03,595 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:03,598 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:03,598 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret20=0} Honda state: {ULTIMATE.start_check_#t~ret20=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:03,630 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:03,630 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:03,638 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:03,639 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:03,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:03,671 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:03,674 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:03,674 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret23=0} Honda state: {ULTIMATE.start_check_#t~ret23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:03,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:03,702 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:03,708 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:03,708 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:03,738 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:03,739 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:03,742 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:03,742 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp~2=1} Honda state: {ULTIMATE.start_check_~tmp~2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:03,774 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:03,775 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:03,778 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:03,778 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret24=0} Honda state: {ULTIMATE.start_check_#t~ret24=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:03,809 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:03,809 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:03,813 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:03,813 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___4~0=0} Honda state: {ULTIMATE.start_check_~tmp___4~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:03,844 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:03,844 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:03,848 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:03,848 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:03,880 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:03,880 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:03,886 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:03,886 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret26=0} Honda state: {ULTIMATE.start_check_#t~ret26=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:03,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:03,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:03,922 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:03,922 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:03,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:03,953 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:03,958 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:03,958 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_~historyIndex=0} Honda state: {ULTIMATE.start_read_history_int8_~historyIndex=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 12:19:03,988 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:03,988 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:03,993 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:03,993 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post59=0} Honda state: {ULTIMATE.start_main_#t~post59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:04,023 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:04,023 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:04,026 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:04,027 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Honda state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:04,048 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:04,048 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:04,050 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:04,050 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:04,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:04,071 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:04,090 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:04,091 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_11=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:04,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:04,098 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:04,101 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:04,101 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:04,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:04,132 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:04,135 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:04,136 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_11=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_11=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:04,154 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:04,155 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:04,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:19:04,181 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:04,357 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:19:04,358 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:19:04,358 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:19:04,358 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:19:04,358 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:19:04,358 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:19:04,358 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:04,359 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:19:04,359 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:19:04,359 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration19_Loop [2018-11-28 12:19:04,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:19:04,359 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:19:04,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:04,640 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-28 12:19:04,803 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-28 12:19:05,044 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-28 12:19:07,671 WARN L180 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 153 DAG size of output: 129 [2018-11-28 12:19:07,676 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:19:07,676 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:19:07,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:19:07,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:19:07,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:19:07,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:19:07,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:19:07,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:19:07,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:07,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:07,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:07,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:07,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:07,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:07,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:07,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:07,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:07,724 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:19:07,724 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:19:07,725 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:19:07,725 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:19:07,725 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:19:07,725 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:19:07,725 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-28 12:19:07,726 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:19:07,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:07,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:19:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:07,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:19:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:07,907 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:19:07,907 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1108 states and 1637 transitions. cyclomatic complexity: 538 Second operand 5 states. [2018-11-28 12:19:07,929 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1108 states and 1637 transitions. cyclomatic complexity: 538. Second operand 5 states. Result 1691 states and 2503 transitions. Complement of second has 6 states. [2018-11-28 12:19:07,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:19:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:19:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 682 transitions. [2018-11-28 12:19:07,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 682 transitions. Stem has 51 letters. Loop has 48 letters. [2018-11-28 12:19:07,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:19:07,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 682 transitions. Stem has 99 letters. Loop has 48 letters. [2018-11-28 12:19:07,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:19:07,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 682 transitions. Stem has 51 letters. Loop has 96 letters. [2018-11-28 12:19:07,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:19:07,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1691 states and 2503 transitions. [2018-11-28 12:19:07,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 462 [2018-11-28 12:19:07,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1691 states to 1021 states and 1502 transitions. [2018-11-28 12:19:07,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 625 [2018-11-28 12:19:07,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 625 [2018-11-28 12:19:07,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1021 states and 1502 transitions. [2018-11-28 12:19:07,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:19:07,942 INFO L705 BuchiCegarLoop]: Abstraction has 1021 states and 1502 transitions. [2018-11-28 12:19:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states and 1502 transitions. [2018-11-28 12:19:07,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2018-11-28 12:19:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2018-11-28 12:19:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1502 transitions. [2018-11-28 12:19:07,954 INFO L728 BuchiCegarLoop]: Abstraction has 1021 states and 1502 transitions. [2018-11-28 12:19:07,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:07,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:07,955 INFO L87 Difference]: Start difference. First operand 1021 states and 1502 transitions. Second operand 4 states. [2018-11-28 12:19:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:08,154 INFO L93 Difference]: Finished difference Result 3202 states and 4727 transitions. [2018-11-28 12:19:08,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:19:08,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3202 states and 4727 transitions. [2018-11-28 12:19:08,166 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1538 [2018-11-28 12:19:08,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3202 states to 3202 states and 4727 transitions. [2018-11-28 12:19:08,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1994 [2018-11-28 12:19:08,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1994 [2018-11-28 12:19:08,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3202 states and 4727 transitions. [2018-11-28 12:19:08,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:19:08,177 INFO L705 BuchiCegarLoop]: Abstraction has 3202 states and 4727 transitions. [2018-11-28 12:19:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states and 4727 transitions. [2018-11-28 12:19:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 995. [2018-11-28 12:19:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-11-28 12:19:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1453 transitions. [2018-11-28 12:19:08,194 INFO L728 BuchiCegarLoop]: Abstraction has 995 states and 1453 transitions. [2018-11-28 12:19:08,194 INFO L608 BuchiCegarLoop]: Abstraction has 995 states and 1453 transitions. [2018-11-28 12:19:08,194 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-28 12:19:08,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 995 states and 1453 transitions. [2018-11-28 12:19:08,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 450 [2018-11-28 12:19:08,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:19:08,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:19:08,198 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:08,198 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:08,198 INFO L794 eck$LassoCheckResult]: Stem: 48318#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 48045#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 48046#L116-2 assume !!(add_history_type_~var~0 < 3); 48416#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 48252#L171 assume 0 == read_history_bool_~history_id; 48253#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 48012#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 48240#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 48241#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 48443#L116-2 assume !(add_history_type_~var~0 < 3); 48441#L116-3 add_history_type_#res := 1; 48270#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 48271#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 48402#L116-6 assume !!(add_history_type_~var~0 < 3); 48400#L117-2 assume !(0 == add_history_type_~history_id); 48401#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 48442#L171-4 assume !(0 == read_history_bool_~history_id); 48328#L181-4 assume 1 == read_history_bool_~history_id; 48329#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 48227#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 48087#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 48088#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 48462#L116-6 assume !(add_history_type_~var~0 < 3); 48453#L116-7 add_history_type_#res := 1; 48324#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 48261#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 48262#L116-10 assume !!(add_history_type_~var~0 < 3); 48395#L117-4 assume !(0 == add_history_type_~history_id); 48397#L123-4 assume !(1 == add_history_type_~history_id); 48486#L129-4 assume 2 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 48456#L171-8 assume !(0 == read_history_bool_~history_id); 48354#L181-8 assume !(1 == read_history_bool_~history_id); 48103#L191-8 assume 2 == read_history_bool_~history_id; 48104#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 48356#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 48062#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 48063#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 48025#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 48026#L116-14 assume !!(add_history_type_~var~0 < 3); 48380#L117-6 assume !(0 == add_history_type_~history_id); 48381#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 48451#L171-10 assume !(0 == read_history_bool_~history_id); 48348#L181-10 assume 1 == read_history_bool_~history_id; 48349#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 48110#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 48075#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 48052#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 48319#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 48266#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 48267#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 48825#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 48823#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 48822#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 48332#L399 [2018-11-28 12:19:08,199 INFO L796 eck$LassoCheckResult]: Loop: 48332#L399 assume 1 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 48256#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 48263#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 48439#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 48387#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 48248#L226-2 assume !(0 == write_history_bool_~history_id); 48249#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 48275#L574-17 assume 0 != ~gate2Failed~0 % 256; 48189#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 48113#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 48114#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 48967#L226-4 assume !(0 == write_history_bool_~history_id); 48966#L231-4 assume !(1 == write_history_bool_~history_id); 48965#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 48963#L574-18 assume 0 != ~gate3Failed~0 % 256; 48409#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 48391#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 48392#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 48407#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 48164#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 48526#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 48521#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 48504#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 48498#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 48444#L171-12 assume 0 == read_history_bool_~history_id; 48445#L172-12 assume !(0 == read_history_bool_~historyIndex); 48374#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 48339#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 48340#L307 assume !(0 == check_~tmp___3~0 % 256); 48553#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 48552#L151-7 assume 3 == read_history_int8_~history_id; 48551#L152-7 assume !(0 == read_history_int8_~historyIndex); 48550#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 48415#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 48549#L346 assume !(check_~tmp___10~0 > -2); 48399#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 48548#L151-9 assume 3 == read_history_int8_~history_id; 48546#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 48544#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 48545#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 48223#L366-1 check_#res := 1; 48222#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 48945#L579-72 assume !(0 == assert_~arg % 256); 48944#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 48169#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 48170#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 48257#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 48331#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 48332#L399 [2018-11-28 12:19:08,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:08,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1796449700, now seen corresponding path program 1 times [2018-11-28 12:19:08,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:08,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:08,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:08,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:08,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:19:08,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:08,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:08,269 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:19:08,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:08,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1118097476, now seen corresponding path program 1 times [2018-11-28 12:19:08,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:08,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:08,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:08,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:08,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:19:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:19:08,927 WARN L180 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 225 [2018-11-28 12:19:10,583 WARN L180 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 190 DAG size of output: 171 [2018-11-28 12:19:10,590 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:19:10,590 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:19:10,590 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:19:10,590 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:19:10,590 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:19:10,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:10,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:19:10,591 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:19:10,591 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2018-11-28 12:19:10,591 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:19:10,591 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:19:10,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,749 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2018-11-28 12:19:10,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:10,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:11,030 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-11-28 12:19:11,166 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-11-28 12:19:11,257 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 12:19:16,357 WARN L180 SmtUtils]: Spent 5.06 s on a formula simplification. DAG size of input: 191 DAG size of output: 143 [2018-11-28 12:19:16,472 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:19:16,472 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,477 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,479 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,479 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret21=0} Honda state: {ULTIMATE.start_check_#t~ret21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,496 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,499 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,499 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp~2=1} Honda state: {ULTIMATE.start_check_~tmp~2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,519 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,521 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,521 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___4~0=0} Honda state: {ULTIMATE.start_check_~tmp___4~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,539 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,539 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,541 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,541 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___1~2=0} Honda state: {ULTIMATE.start_check_~tmp___1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,560 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,561 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,577 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,577 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,580 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,580 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_13=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_13=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,596 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,596 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,598 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,598 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,616 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,618 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,618 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret18=0} Honda state: {ULTIMATE.start_check_#t~ret18=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,635 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,635 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,637 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,637 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret12=0} Honda state: {ULTIMATE.start_check_#t~ret12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,658 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,661 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,661 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,676 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,678 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,678 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,694 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,694 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,696 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,696 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_read_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,714 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,714 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,717 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,717 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#res=1, ULTIMATE.start_main_~c1~0=1} Honda state: {ULTIMATE.start_check_#res=1, ULTIMATE.start_main_~c1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,734 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,734 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,736 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,736 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_write_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,754 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,754 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,757 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,757 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,779 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,779 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,786 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,786 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_13=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_13=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,805 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,808 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,808 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,831 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,831 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret14=0} Honda state: {ULTIMATE.start_check_#t~ret14=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,851 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,851 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,854 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,854 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,875 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,875 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,878 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,878 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post13=0} Honda state: {ULTIMATE.start_check_#t~post13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,905 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,905 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,910 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,910 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,929 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:16,947 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:16,948 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_13=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_13=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:16,950 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:16,951 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:17,556 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:19:17,556 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:29,910 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 12:19:29,930 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:19:29,930 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:19:29,930 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:19:29,931 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:19:29,931 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:19:29,931 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:29,931 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:19:29,931 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:19:29,931 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2018-11-28 12:19:29,931 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:19:29,931 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:19:29,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:29,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,135 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2018-11-28 12:19:30,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:30,385 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-11-28 12:19:30,495 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-11-28 12:19:30,558 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 12:19:35,246 WARN L180 SmtUtils]: Spent 4.65 s on a formula simplification. DAG size of input: 191 DAG size of output: 143 [2018-11-28 12:19:35,332 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:19:35,332 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:19:35,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:19:35,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:19:35,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:19:35,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:19:35,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:19:35,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:19:35,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:35,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:35,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:35,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:35,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:35,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:35,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:35,416 INFO L206 nArgumentSynthesizer]: 16 loop disjuncts [2018-11-28 12:19:35,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:35,436 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2018-11-28 12:19:35,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:35,537 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:19:35,671 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:19:35,671 INFO L444 ModelExtractionUtils]: 18 out of 23 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:19:35,671 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:19:35,671 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:19:35,672 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:19:35,672 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~votedValue_History_0~0, ~g1v_old~0, ~nomsg~0) = -1*~votedValue_History_0~0 - 1*~g1v_old~0 + 1*~nomsg~0 Supporting invariants [] [2018-11-28 12:19:35,672 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:19:35,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:35,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:19:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:35,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:19:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:36,142 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 15 loop predicates [2018-11-28 12:19:36,142 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 995 states and 1453 transitions. cyclomatic complexity: 467 Second operand 16 states. [2018-11-28 12:19:38,080 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 995 states and 1453 transitions. cyclomatic complexity: 467. Second operand 16 states. Result 4914 states and 6965 transitions. Complement of second has 81 states. [2018-11-28 12:19:38,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 41 states 1 stem states 39 non-accepting loop states 1 accepting loop states [2018-11-28 12:19:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 12:19:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2234 transitions. [2018-11-28 12:19:38,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 2234 transitions. Stem has 53 letters. Loop has 48 letters. [2018-11-28 12:19:38,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:19:38,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 2234 transitions. Stem has 101 letters. Loop has 48 letters. [2018-11-28 12:19:38,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:19:38,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 2234 transitions. Stem has 53 letters. Loop has 96 letters. [2018-11-28 12:19:38,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:19:38,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4914 states and 6965 transitions. [2018-11-28 12:19:38,098 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1271 [2018-11-28 12:19:38,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4914 states to 3751 states and 5373 transitions. [2018-11-28 12:19:38,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2685 [2018-11-28 12:19:38,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2688 [2018-11-28 12:19:38,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3751 states and 5373 transitions. [2018-11-28 12:19:38,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:19:38,108 INFO L705 BuchiCegarLoop]: Abstraction has 3751 states and 5373 transitions. [2018-11-28 12:19:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states and 5373 transitions. [2018-11-28 12:19:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 1842. [2018-11-28 12:19:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2018-11-28 12:19:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2701 transitions. [2018-11-28 12:19:38,130 INFO L728 BuchiCegarLoop]: Abstraction has 1842 states and 2701 transitions. [2018-11-28 12:19:38,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:19:38,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:19:38,130 INFO L87 Difference]: Start difference. First operand 1842 states and 2701 transitions. Second operand 4 states. [2018-11-28 12:19:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:38,166 INFO L93 Difference]: Finished difference Result 3539 states and 5198 transitions. [2018-11-28 12:19:38,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:19:38,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3539 states and 5198 transitions. [2018-11-28 12:19:38,176 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1798 [2018-11-28 12:19:38,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3539 states to 3537 states and 5196 transitions. [2018-11-28 12:19:38,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2238 [2018-11-28 12:19:38,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2238 [2018-11-28 12:19:38,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3537 states and 5196 transitions. [2018-11-28 12:19:38,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:19:38,187 INFO L705 BuchiCegarLoop]: Abstraction has 3537 states and 5196 transitions. [2018-11-28 12:19:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states and 5196 transitions. [2018-11-28 12:19:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 1842. [2018-11-28 12:19:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2018-11-28 12:19:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2700 transitions. [2018-11-28 12:19:38,206 INFO L728 BuchiCegarLoop]: Abstraction has 1842 states and 2700 transitions. [2018-11-28 12:19:38,206 INFO L608 BuchiCegarLoop]: Abstraction has 1842 states and 2700 transitions. [2018-11-28 12:19:38,206 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-28 12:19:38,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1842 states and 2700 transitions. [2018-11-28 12:19:38,209 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 899 [2018-11-28 12:19:38,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:19:38,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:19:38,210 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:38,210 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:38,210 INFO L794 eck$LassoCheckResult]: Stem: 60097#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 59822#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 59823#L116-2 assume !!(add_history_type_~var~0 < 3); 60200#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 60030#L171 assume 0 == read_history_bool_~history_id; 60031#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 59792#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 60018#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 60019#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 60234#L116-2 assume !(add_history_type_~var~0 < 3); 60232#L116-3 add_history_type_#res := 1; 60050#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 60051#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 60188#L116-6 assume !!(add_history_type_~var~0 < 3); 60186#L117-2 assume !(0 == add_history_type_~history_id); 60187#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 60233#L171-4 assume !(0 == read_history_bool_~history_id); 60109#L181-4 assume 1 == read_history_bool_~history_id; 60110#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 60007#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 59867#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 59868#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 60257#L116-6 assume !(add_history_type_~var~0 < 3); 60247#L116-7 add_history_type_#res := 1; 60104#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 60043#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 60044#L116-10 assume !!(add_history_type_~var~0 < 3); 60182#L117-4 assume !(0 == add_history_type_~history_id); 60184#L123-4 assume !(1 == add_history_type_~history_id); 60281#L129-4 assume 2 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 60255#L171-8 assume !(0 == read_history_bool_~history_id); 60136#L181-8 assume !(1 == read_history_bool_~history_id); 59879#L191-8 assume 2 == read_history_bool_~history_id; 59880#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 60138#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 59842#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 59843#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 60263#L116-10 assume !(add_history_type_~var~0 < 3); 60226#L116-11 add_history_type_#res := 1; 60099#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 59802#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 59803#L116-14 assume !!(add_history_type_~var~0 < 3); 60167#L117-6 assume !(0 == add_history_type_~history_id); 60168#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 60245#L171-10 assume !(0 == read_history_bool_~history_id); 60130#L181-10 assume 1 == read_history_bool_~history_id; 60131#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 59896#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 59851#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 59835#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 60098#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 60045#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 60046#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 59946#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 60035#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 60593#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 60591#L399 assume !(1 == gate1_each_pals_period_~next_state~0); 60033#L402 [2018-11-28 12:19:38,210 INFO L796 eck$LassoCheckResult]: Loop: 60033#L402 assume !(2 == gate1_each_pals_period_~next_state~0);gate1_each_pals_period_~tmp___0~3 := 0; 60034#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 61010#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 61007#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 61006#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 61005#L226-2 assume !(0 == write_history_bool_~history_id); 61003#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 61000#L574-17 assume 0 != ~gate2Failed~0 % 256; 61001#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 61170#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 61168#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 61167#L226-4 assume !(0 == write_history_bool_~history_id); 61166#L231-4 assume !(1 == write_history_bool_~history_id); 61165#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 61163#L574-18 assume 0 != ~gate3Failed~0 % 256; 61161#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 61160#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 61159#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 61099#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 61089#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 61088#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 61081#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 60886#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 60885#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 60881#L171-12 assume 0 == read_history_bool_~history_id; 60879#L172-12 assume !(0 == read_history_bool_~historyIndex); 60878#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 60875#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 60837#L307 assume !(0 == check_~tmp___3~0 % 256); 60831#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 60829#L151-7 assume 3 == read_history_int8_~history_id; 60827#L152-7 assume !(0 == read_history_int8_~historyIndex); 60824#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 60823#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 60822#L346 assume !(check_~tmp___10~0 > -2); 60758#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 60821#L151-9 assume 3 == read_history_int8_~history_id; 60818#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 60819#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 61214#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 61201#L366-1 check_#res := 1; 60757#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 61197#L579-72 assume !(0 == assert_~arg % 256); 61193#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 61191#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 61041#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 61039#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 61038#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 61036#L399 assume !(1 == gate1_each_pals_period_~next_state~0); 60033#L402 [2018-11-28 12:19:38,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:38,210 INFO L82 PathProgramCache]: Analyzing trace with hash -534925015, now seen corresponding path program 1 times [2018-11-28 12:19:38,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:38,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:38,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:38,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:38,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:19:38,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:38,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:19:38,254 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:19:38,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash -355597817, now seen corresponding path program 1 times [2018-11-28 12:19:38,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:38,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:38,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:38,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:38,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:38,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:38,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:19:38,277 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:19:38,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:19:38,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:38,277 INFO L87 Difference]: Start difference. First operand 1842 states and 2700 transitions. cyclomatic complexity: 870 Second operand 3 states. [2018-11-28 12:19:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:38,297 INFO L93 Difference]: Finished difference Result 1843 states and 2700 transitions. [2018-11-28 12:19:38,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:19:38,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1843 states and 2700 transitions. [2018-11-28 12:19:38,305 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 899 [2018-11-28 12:19:38,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1843 states to 1842 states and 2699 transitions. [2018-11-28 12:19:38,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1151 [2018-11-28 12:19:38,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1151 [2018-11-28 12:19:38,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1842 states and 2699 transitions. [2018-11-28 12:19:38,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:19:38,312 INFO L705 BuchiCegarLoop]: Abstraction has 1842 states and 2699 transitions. [2018-11-28 12:19:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states and 2699 transitions. [2018-11-28 12:19:38,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1842. [2018-11-28 12:19:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2018-11-28 12:19:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2699 transitions. [2018-11-28 12:19:38,327 INFO L728 BuchiCegarLoop]: Abstraction has 1842 states and 2699 transitions. [2018-11-28 12:19:38,327 INFO L608 BuchiCegarLoop]: Abstraction has 1842 states and 2699 transitions. [2018-11-28 12:19:38,328 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-28 12:19:38,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1842 states and 2699 transitions. [2018-11-28 12:19:38,330 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 899 [2018-11-28 12:19:38,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:19:38,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:19:38,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:38,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:38,331 INFO L794 eck$LassoCheckResult]: Stem: 63792#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 63514#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 63515#L116-2 assume !!(add_history_type_~var~0 < 3); 63902#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 63722#L171 assume 0 == read_history_bool_~history_id; 63723#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 63481#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 63709#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 63710#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 63931#L116-2 assume !(add_history_type_~var~0 < 3); 63929#L116-3 add_history_type_#res := 1; 63740#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 63741#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 63884#L116-6 assume !!(add_history_type_~var~0 < 3); 63882#L117-2 assume !(0 == add_history_type_~history_id); 63883#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 63930#L171-4 assume !(0 == read_history_bool_~history_id); 63804#L181-4 assume 1 == read_history_bool_~history_id; 63805#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 63696#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 63556#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 63557#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 63953#L116-6 assume !(add_history_type_~var~0 < 3); 63943#L116-7 add_history_type_#res := 1; 63799#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 63732#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 63733#L116-10 assume !!(add_history_type_~var~0 < 3); 63878#L117-4 assume !(0 == add_history_type_~history_id); 63880#L123-4 assume !(1 == add_history_type_~history_id); 63984#L129-4 assume 2 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 63946#L171-8 assume !(0 == read_history_bool_~history_id); 63833#L181-8 assume !(1 == read_history_bool_~history_id); 63572#L191-8 assume 2 == read_history_bool_~history_id; 63573#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 63835#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 63531#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 63532#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 63960#L116-10 assume !(add_history_type_~var~0 < 3); 63920#L116-11 add_history_type_#res := 1; 63794#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 63494#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 63495#L116-14 assume !!(add_history_type_~var~0 < 3); 63863#L117-6 assume !(0 == add_history_type_~history_id); 63864#L123-6 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 63941#L171-10 assume !(0 == read_history_bool_~history_id); 63827#L181-10 assume 1 == read_history_bool_~history_id; 63828#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 63579#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 63544#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 63521#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 63793#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 63738#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 63739#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 64098#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 64426#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 64391#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 64344#L399 assume !(1 == gate1_each_pals_period_~next_state~0); 63725#L402 [2018-11-28 12:19:38,332 INFO L796 eck$LassoCheckResult]: Loop: 63725#L402 assume 2 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 63726#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 64747#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 64746#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 64745#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 64744#L226-2 assume !(0 == write_history_bool_~history_id); 64742#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 64739#L574-17 assume 0 != ~gate2Failed~0 % 256; 64740#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 64958#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 64956#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 64955#L226-4 assume !(0 == write_history_bool_~history_id); 64952#L231-4 assume !(1 == write_history_bool_~history_id); 64948#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 64943#L574-18 assume 0 != ~gate3Failed~0 % 256; 64944#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 64986#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 64985#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 64978#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 64968#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 64965#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 64961#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 64607#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 64604#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 64601#L171-12 assume 0 == read_history_bool_~history_id; 64600#L172-12 assume !(0 == read_history_bool_~historyIndex); 64598#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 64594#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 64560#L307 assume !(0 == check_~tmp___3~0 % 256); 64555#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 64554#L151-7 assume 3 == read_history_int8_~history_id; 64553#L152-7 assume !(0 == read_history_int8_~historyIndex); 64531#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 64532#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 64517#L346 assume !(check_~tmp___10~0 > -2); 64489#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 64875#L151-9 assume 3 == read_history_int8_~history_id; 64874#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 64872#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 64871#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 64766#L366-1 check_#res := 1; 64488#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 64761#L579-72 assume !(0 == assert_~arg % 256); 64759#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 64758#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 64754#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 64753#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 64752#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 64751#L399 assume !(1 == gate1_each_pals_period_~next_state~0); 63725#L402 [2018-11-28 12:19:38,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:38,332 INFO L82 PathProgramCache]: Analyzing trace with hash -534925015, now seen corresponding path program 2 times [2018-11-28 12:19:38,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:38,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:38,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:38,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:38,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:19:38,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:38,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:19:38,381 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:19:38,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash -340079099, now seen corresponding path program 1 times [2018-11-28 12:19:38,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:38,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:38,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:38,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:19:38,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:19:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:19:39,128 WARN L180 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 227 [2018-11-28 12:19:40,745 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 192 DAG size of output: 173 [2018-11-28 12:19:40,747 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:19:40,747 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:19:40,747 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:19:40,747 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:19:40,748 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:19:40,748 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:40,748 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:19:40,748 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:19:40,748 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration22_Loop [2018-11-28 12:19:40,748 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:19:40,748 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:19:40,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,954 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-11-28 12:19:40,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:40,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:41,320 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-28 12:19:41,357 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-28 12:19:46,766 WARN L180 SmtUtils]: Spent 5.31 s on a formula simplification. DAG size of input: 259 DAG size of output: 143 [2018-11-28 12:19:46,798 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:19:46,798 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:46,809 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:46,809 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:46,819 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:46,819 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:46,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:46,845 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:46,849 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:46,849 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___4~0=0} Honda state: {ULTIMATE.start_check_~tmp___4~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 12:19:46,876 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:46,876 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:46,881 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:46,881 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___1~2=0} Honda state: {ULTIMATE.start_check_~tmp___1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:46,897 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:46,898 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:46,902 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:46,902 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret25=0} Honda state: {ULTIMATE.start_check_#t~ret25=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:46,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:46,917 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:46,920 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:46,920 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=0, ULTIMATE.start_write_history_bool_~history_id=0} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=0, ULTIMATE.start_write_history_bool_~history_id=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:46,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:46,935 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:46,937 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:46,937 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret21=0} Honda state: {ULTIMATE.start_check_#t~ret21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:46,954 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:46,954 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:46,956 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:46,956 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:46,974 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:46,974 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:46,977 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:46,977 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_15=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_15=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:46,991 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:46,992 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:46,993 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:46,993 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:47,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:47,024 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:47,026 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:47,026 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret16=0} Honda state: {ULTIMATE.start_check_#t~ret16=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:47,040 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:47,040 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:47,042 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:47,042 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Honda state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:47,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:47,060 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:47,062 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:47,062 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret12=0} Honda state: {ULTIMATE.start_check_#t~ret12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:47,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:47,077 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:47,079 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:47,079 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:47,097 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:47,097 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:47,115 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:47,115 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_15=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_15=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:47,124 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:47,124 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:47,126 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:47,126 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:47,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:47,142 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:47,144 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:19:47,145 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#res=1, ULTIMATE.start_main_~c1~0=1} Honda state: {ULTIMATE.start_check_#res=1, ULTIMATE.start_main_~c1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:47,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:19:47,161 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:47,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:19:47,178 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:19:47,301 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:19:47,302 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:19:47,302 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:19:47,302 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:19:47,302 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:19:47,303 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:19:47,303 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:47,303 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:19:47,303 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:19:47,303 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration22_Loop [2018-11-28 12:19:47,303 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:19:47,303 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:19:47,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,517 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-11-28 12:19:47,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:47,860 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-28 12:19:47,871 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-28 12:19:53,085 WARN L180 SmtUtils]: Spent 5.10 s on a formula simplification. DAG size of input: 259 DAG size of output: 143 [2018-11-28 12:19:53,108 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:19:53,108 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:19:53,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:19:53,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:19:53,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:19:53,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:19:53,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:19:53,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:19:53,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:19:53,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:19:53,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:19:53,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:19:53,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:19:53,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:19:53,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:19:53,131 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:19:53,131 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:19:53,131 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:19:53,132 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:19:53,132 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:19:53,132 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:19:53,132 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-28 12:19:53,132 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:19:53,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:53,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:19:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:53,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:19:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:19:53,245 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:19:53,245 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1842 states and 2699 transitions. cyclomatic complexity: 869 Second operand 5 states. [2018-11-28 12:19:53,262 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1842 states and 2699 transitions. cyclomatic complexity: 869. Second operand 5 states. Result 2321 states and 3403 transitions. Complement of second has 6 states. [2018-11-28 12:19:53,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:19:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:19:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 635 transitions. [2018-11-28 12:19:53,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 635 transitions. Stem has 57 letters. Loop has 49 letters. [2018-11-28 12:19:53,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:19:53,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 635 transitions. Stem has 106 letters. Loop has 49 letters. [2018-11-28 12:19:53,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:19:53,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 635 transitions. Stem has 57 letters. Loop has 98 letters. [2018-11-28 12:19:53,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:19:53,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2321 states and 3403 transitions. [2018-11-28 12:19:53,270 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 898 [2018-11-28 12:19:53,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2321 states to 1841 states and 2694 transitions. [2018-11-28 12:19:53,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1150 [2018-11-28 12:19:53,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1150 [2018-11-28 12:19:53,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1841 states and 2694 transitions. [2018-11-28 12:19:53,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:19:53,276 INFO L705 BuchiCegarLoop]: Abstraction has 1841 states and 2694 transitions. [2018-11-28 12:19:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states and 2694 transitions. [2018-11-28 12:19:53,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1841. [2018-11-28 12:19:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1841 states. [2018-11-28 12:19:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2694 transitions. [2018-11-28 12:19:53,292 INFO L728 BuchiCegarLoop]: Abstraction has 1841 states and 2694 transitions. [2018-11-28 12:19:53,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:19:53,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:19:53,293 INFO L87 Difference]: Start difference. First operand 1841 states and 2694 transitions. Second operand 3 states. [2018-11-28 12:19:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:19:53,435 INFO L93 Difference]: Finished difference Result 1789 states and 2614 transitions. [2018-11-28 12:19:53,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:19:53,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1789 states and 2614 transitions. [2018-11-28 12:19:53,439 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 898 [2018-11-28 12:19:53,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1789 states to 1789 states and 2614 transitions. [2018-11-28 12:19:53,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1127 [2018-11-28 12:19:53,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1127 [2018-11-28 12:19:53,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1789 states and 2614 transitions. [2018-11-28 12:19:53,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:19:53,445 INFO L705 BuchiCegarLoop]: Abstraction has 1789 states and 2614 transitions. [2018-11-28 12:19:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states and 2614 transitions. [2018-11-28 12:19:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1789. [2018-11-28 12:19:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1789 states. [2018-11-28 12:19:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2614 transitions. [2018-11-28 12:19:53,461 INFO L728 BuchiCegarLoop]: Abstraction has 1789 states and 2614 transitions. [2018-11-28 12:19:53,461 INFO L608 BuchiCegarLoop]: Abstraction has 1789 states and 2614 transitions. [2018-11-28 12:19:53,461 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-28 12:19:53,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1789 states and 2614 transitions. [2018-11-28 12:19:53,466 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 898 [2018-11-28 12:19:53,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:19:53,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:19:53,467 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:53,467 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:19:53,467 INFO L794 eck$LassoCheckResult]: Stem: 71901#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 71642#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 71643#L116-2 assume !!(add_history_type_~var~0 < 3); 71997#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 71831#L171 assume 0 == read_history_bool_~history_id; 71832#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 71615#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 71819#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 71820#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 72026#L116-2 assume !(add_history_type_~var~0 < 3); 72024#L116-3 add_history_type_#res := 1; 71847#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 71848#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 71979#L116-6 assume !!(add_history_type_~var~0 < 3); 71977#L117-2 assume !(0 == add_history_type_~history_id); 71978#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 72025#L171-4 assume !(0 == read_history_bool_~history_id); 71913#L181-4 assume 1 == read_history_bool_~history_id; 71914#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 71806#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 71676#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 71677#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 72044#L116-6 assume !(add_history_type_~var~0 < 3); 72035#L116-7 add_history_type_#res := 1; 71909#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 71839#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 71840#L116-10 assume !!(add_history_type_~var~0 < 3); 71972#L117-4 assume !(0 == add_history_type_~history_id); 71973#L123-4 assume !(1 == add_history_type_~history_id); 72075#L129-4 assume 2 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 72038#L171-8 assume !(0 == read_history_bool_~history_id); 71928#L181-8 assume !(1 == read_history_bool_~history_id); 71687#L191-8 assume 2 == read_history_bool_~history_id; 71688#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 71930#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 71654#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 71655#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 72033#L116-10 assume !(add_history_type_~var~0 < 3); 72017#L116-11 add_history_type_#res := 1; 71904#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 71628#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 71629#L116-14 assume !!(add_history_type_~var~0 < 3); 71959#L117-6 assume !(0 == add_history_type_~history_id); 71960#L123-6 assume !(1 == add_history_type_~history_id); 72064#L129-6 assume !(2 == add_history_type_~history_id); 71795#L135-9 assume 3 == add_history_type_~history_id;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 71796#L151-3 assume 3 == read_history_int8_~history_id; 71807#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 71808#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 71815#L137-3 assume !(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0);add_history_type_#res := 0; 71902#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 71903#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 71845#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 71846#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 72222#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 72450#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 72801#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 72799#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 72796#L408 assume !(gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite30 := ~g1v_new~0; 72797#L408-2 [2018-11-28 12:19:53,467 INFO L796 eck$LassoCheckResult]: Loop: 72797#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 73007#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 73006#L226-2 assume !(0 == write_history_bool_~history_id); 73004#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 72891#L574-17 assume 0 != ~gate2Failed~0 % 256; 72892#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 72926#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 72923#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 72922#L226-4 assume !(0 == write_history_bool_~history_id); 72921#L231-4 assume !(1 == write_history_bool_~history_id); 72920#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 72917#L574-18 assume 0 != ~gate3Failed~0 % 256; 72918#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 72942#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 72939#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 72735#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 72723#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 72719#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 72714#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 72613#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 72610#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 72607#L171-12 assume 0 == read_history_bool_~history_id; 72605#L172-12 assume !(0 == read_history_bool_~historyIndex); 72603#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 72595#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 72568#L307 assume !(0 == check_~tmp___3~0 % 256); 72563#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 72562#L151-7 assume 3 == read_history_int8_~history_id; 72561#L152-7 assume !(0 == read_history_int8_~historyIndex); 72560#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 71994#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 72559#L346 assume !(check_~tmp___10~0 > -2); 72003#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 72558#L151-9 assume 3 == read_history_int8_~history_id; 72555#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 72556#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 72836#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 72834#L366-1 check_#res := 1; 72495#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 72832#L579-72 assume !(0 == assert_~arg % 256); 72830#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 72828#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 72824#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 72445#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 72242#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 72243#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 73008#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 72797#L408-2 [2018-11-28 12:19:53,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:53,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1595648815, now seen corresponding path program 1 times [2018-11-28 12:19:53,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:53,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:53,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:53,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:53,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:19:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:19:53,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:19:53,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:19:53,648 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:19:53,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:19:53,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1663763832, now seen corresponding path program 2 times [2018-11-28 12:19:53,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:19:53,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:19:53,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:53,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:19:53,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:19:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:19:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:19:54,230 WARN L180 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 221 [2018-11-28 12:19:56,921 WARN L180 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 190 DAG size of output: 179 [2018-11-28 12:19:56,923 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:19:56,923 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:19:56,923 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:19:56,923 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:19:56,923 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:19:56,924 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:19:56,924 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:19:56,924 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:19:56,924 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration23_Loop [2018-11-28 12:19:56,924 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:19:56,924 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:19:56,925 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 12:19:56,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:56,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,204 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-11-28 12:19:57,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:19:57,531 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-28 12:19:57,547 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-28 12:20:02,837 WARN L180 SmtUtils]: Spent 5.18 s on a formula simplification. DAG size of input: 255 DAG size of output: 143 [2018-11-28 12:20:02,857 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:20:02,857 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:02,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:20:02,864 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:20:02,866 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:20:02,866 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_#in~historyIndex=0, ULTIMATE.start_read_history_int8_~historyIndex=0} Honda state: {ULTIMATE.start_read_history_int8_#in~historyIndex=0, ULTIMATE.start_read_history_int8_~historyIndex=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:02,885 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:20:02,885 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:20:02,887 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:20:02,887 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:02,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:20:02,902 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:20:02,908 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:20:02,908 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret25=0} Honda state: {ULTIMATE.start_check_#t~ret25=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:02,924 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:20:02,924 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:02,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:20:02,943 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:20:03,069 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:20:03,070 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:20:03,070 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:20:03,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:20:03,071 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:20:03,071 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:20:03,071 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:03,071 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:20:03,071 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:20:03,071 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration23_Loop [2018-11-28 12:20:03,071 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:20:03,071 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:20:03,073 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-28 12:20:03,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,387 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-11-28 12:20:03,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:03,692 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-28 12:20:03,810 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-28 12:20:08,904 WARN L180 SmtUtils]: Spent 5.01 s on a formula simplification. DAG size of input: 255 DAG size of output: 143 [2018-11-28 12:20:08,961 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:20:08,961 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:20:08,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:08,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:08,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:08,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:08,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:08,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:08,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:08,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:08,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:08,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:08,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:08,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:08,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:08,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:08,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:08,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:08,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:08,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:20:08,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:08,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:08,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:08,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:08,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:08,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:08,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:08,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:08,964 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:20:08,964 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:20:08,965 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:20:08,965 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:20:08,965 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:20:08,965 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:20:08,965 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-28 12:20:08,965 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:20:08,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:09,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:09,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:09,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:09,066 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:20:09,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1789 states and 2614 transitions. cyclomatic complexity: 835 Second operand 5 states. [2018-11-28 12:20:09,085 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1789 states and 2614 transitions. cyclomatic complexity: 835. Second operand 5 states. Result 3963 states and 5808 transitions. Complement of second has 6 states. [2018-11-28 12:20:09,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:20:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:20:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 598 transitions. [2018-11-28 12:20:09,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 598 transitions. Stem has 59 letters. Loop has 47 letters. [2018-11-28 12:20:09,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:09,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 598 transitions. Stem has 106 letters. Loop has 47 letters. [2018-11-28 12:20:09,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:09,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 598 transitions. Stem has 59 letters. Loop has 94 letters. [2018-11-28 12:20:09,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:09,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3963 states and 5808 transitions. [2018-11-28 12:20:09,093 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 898 [2018-11-28 12:20:09,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3963 states to 1789 states and 2608 transitions. [2018-11-28 12:20:09,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1127 [2018-11-28 12:20:09,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1127 [2018-11-28 12:20:09,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1789 states and 2608 transitions. [2018-11-28 12:20:09,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:20:09,096 INFO L705 BuchiCegarLoop]: Abstraction has 1789 states and 2608 transitions. [2018-11-28 12:20:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states and 2608 transitions. [2018-11-28 12:20:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1789. [2018-11-28 12:20:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1789 states. [2018-11-28 12:20:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2608 transitions. [2018-11-28 12:20:09,107 INFO L728 BuchiCegarLoop]: Abstraction has 1789 states and 2608 transitions. [2018-11-28 12:20:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:20:09,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:20:09,107 INFO L87 Difference]: Start difference. First operand 1789 states and 2608 transitions. Second operand 4 states. [2018-11-28 12:20:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:20:09,122 INFO L93 Difference]: Finished difference Result 1791 states and 2609 transitions. [2018-11-28 12:20:09,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:20:09,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1791 states and 2609 transitions. [2018-11-28 12:20:09,125 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 898 [2018-11-28 12:20:09,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1791 states to 1789 states and 2607 transitions. [2018-11-28 12:20:09,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1127 [2018-11-28 12:20:09,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1127 [2018-11-28 12:20:09,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1789 states and 2607 transitions. [2018-11-28 12:20:09,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:20:09,128 INFO L705 BuchiCegarLoop]: Abstraction has 1789 states and 2607 transitions. [2018-11-28 12:20:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states and 2607 transitions. [2018-11-28 12:20:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1789. [2018-11-28 12:20:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1789 states. [2018-11-28 12:20:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2607 transitions. [2018-11-28 12:20:09,138 INFO L728 BuchiCegarLoop]: Abstraction has 1789 states and 2607 transitions. [2018-11-28 12:20:09,138 INFO L608 BuchiCegarLoop]: Abstraction has 1789 states and 2607 transitions. [2018-11-28 12:20:09,138 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-28 12:20:09,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1789 states and 2607 transitions. [2018-11-28 12:20:09,140 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 898 [2018-11-28 12:20:09,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:20:09,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:20:09,141 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:09,141 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:09,141 INFO L794 eck$LassoCheckResult]: Stem: 81573#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 81318#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 81319#L116-2 assume !!(add_history_type_~var~0 < 3); 81672#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 81509#L171 assume 0 == read_history_bool_~history_id; 81510#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 81291#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 81497#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 81498#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 81702#L116-2 assume !(add_history_type_~var~0 < 3); 81700#L116-3 add_history_type_#res := 1; 81525#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 81526#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 81653#L116-6 assume !!(add_history_type_~var~0 < 3); 81651#L117-2 assume !(0 == add_history_type_~history_id); 81652#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 81701#L171-4 assume !(0 == read_history_bool_~history_id); 81586#L181-4 assume 1 == read_history_bool_~history_id; 81587#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 81483#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 81352#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 81353#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 81720#L116-6 assume !(add_history_type_~var~0 < 3); 81710#L116-7 add_history_type_#res := 1; 81581#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 81517#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 81518#L116-10 assume !!(add_history_type_~var~0 < 3); 81645#L117-4 assume !(0 == add_history_type_~history_id); 81646#L123-4 assume !(1 == add_history_type_~history_id); 81750#L129-4 assume 2 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 81713#L171-8 assume !(0 == read_history_bool_~history_id); 81602#L181-8 assume !(1 == read_history_bool_~history_id); 81363#L191-8 assume 2 == read_history_bool_~history_id; 81364#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 81604#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 81330#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 81331#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 81708#L116-10 assume !(add_history_type_~var~0 < 3); 81691#L116-11 add_history_type_#res := 1; 81576#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 81304#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 81305#L116-14 assume !!(add_history_type_~var~0 < 3); 81632#L117-6 assume !(0 == add_history_type_~history_id); 81633#L123-6 assume !(1 == add_history_type_~history_id); 81739#L129-6 assume !(2 == add_history_type_~history_id); 81471#L135-9 assume 3 == add_history_type_~history_id;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 81472#L151-3 assume 3 == read_history_int8_~history_id; 81484#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 81485#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 81492#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 81467#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 81468#L116-14 assume !(add_history_type_~var~0 < 3); 81684#L116-15 add_history_type_#res := 1; 81574#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 81575#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 81523#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 81524#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 81910#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 82396#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 82393#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 82394#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 82659#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 82658#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 82657#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 82656#L226-2 assume !(0 == write_history_bool_~history_id); 82654#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 82651#L574-17 assume 0 != ~gate2Failed~0 % 256; 82652#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 82849#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 82847#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 82845#L226-4 assume !(0 == write_history_bool_~history_id); 82842#L231-4 assume !(1 == write_history_bool_~history_id); 82839#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 82836#L574-18 assume 0 != ~gate3Failed~0 % 256; 82837#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 83013#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 83012#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 83011#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 82978#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 82932#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 82931#L574-20 [2018-11-28 12:20:09,141 INFO L796 eck$LassoCheckResult]: Loop: 82931#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 81777#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 81756#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 81706#L171-12 assume 0 == read_history_bool_~history_id; 81655#L172-12 assume !(0 == read_history_bool_~historyIndex); 81622#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 81623#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 82275#L307 assume !(0 == check_~tmp___3~0 % 256); 82257#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 82800#L151-7 assume 3 == read_history_int8_~history_id; 82799#L152-7 assume !(0 == read_history_int8_~historyIndex); 82797#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 82796#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 82794#L346 assume !(check_~tmp___10~0 > -2); 82795#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 82926#L151-9 assume 3 == read_history_int8_~history_id; 82924#L152-9 assume !(0 == read_history_int8_~historyIndex); 82925#L155-9 assume !(1 == read_history_int8_~historyIndex);read_history_int8_#res := ~votedValue_History_2~0; 82964#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 82954#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 82414#L366-1 check_#res := 1; 81460#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 81461#L579-72 assume !(0 == assert_~arg % 256); 81499#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 82193#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 82189#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 82174#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 81935#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 81936#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 82753#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 82752#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 82751#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 82750#L226-2 assume !(0 == write_history_bool_~history_id); 82747#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 82744#L574-17 assume 0 != ~gate2Failed~0 % 256; 82745#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 82903#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 82902#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 82899#L226-4 assume !(0 == write_history_bool_~history_id); 82897#L231-4 assume !(1 == write_history_bool_~history_id); 82895#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 82891#L574-18 assume 0 != ~gate3Failed~0 % 256; 82892#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 82965#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 82948#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 82944#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 82938#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 82937#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 82931#L574-20 [2018-11-28 12:20:09,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash -995642884, now seen corresponding path program 1 times [2018-11-28 12:20:09,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:09,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:09,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:09,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:09,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:20:09,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:20:09,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:20:09,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:09,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:20:09,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:20:09,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 12:20:09,291 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:20:09,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:09,291 INFO L82 PathProgramCache]: Analyzing trace with hash -970727895, now seen corresponding path program 1 times [2018-11-28 12:20:09,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:09,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:09,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:09,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:09,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:09,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:20:09,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:20:09,315 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:20:09,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:20:09,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:20:09,316 INFO L87 Difference]: Start difference. First operand 1789 states and 2607 transitions. cyclomatic complexity: 828 Second operand 3 states. [2018-11-28 12:20:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:20:09,336 INFO L93 Difference]: Finished difference Result 1743 states and 2465 transitions. [2018-11-28 12:20:09,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:20:09,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1743 states and 2465 transitions. [2018-11-28 12:20:09,339 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 866 [2018-11-28 12:20:09,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1743 states to 1743 states and 2465 transitions. [2018-11-28 12:20:09,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1097 [2018-11-28 12:20:09,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1097 [2018-11-28 12:20:09,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1743 states and 2465 transitions. [2018-11-28 12:20:09,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:20:09,342 INFO L705 BuchiCegarLoop]: Abstraction has 1743 states and 2465 transitions. [2018-11-28 12:20:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states and 2465 transitions. [2018-11-28 12:20:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1735. [2018-11-28 12:20:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-11-28 12:20:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2457 transitions. [2018-11-28 12:20:09,353 INFO L728 BuchiCegarLoop]: Abstraction has 1735 states and 2457 transitions. [2018-11-28 12:20:09,353 INFO L608 BuchiCegarLoop]: Abstraction has 1735 states and 2457 transitions. [2018-11-28 12:20:09,353 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-28 12:20:09,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1735 states and 2457 transitions. [2018-11-28 12:20:09,355 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 864 [2018-11-28 12:20:09,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:20:09,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:20:09,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:09,356 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:09,356 INFO L794 eck$LassoCheckResult]: Stem: 85342#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 85096#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 85097#L116-2 assume !!(add_history_type_~var~0 < 3); 85429#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 85271#L171 assume 0 == read_history_bool_~history_id; 85272#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 85069#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 85259#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 85260#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 85457#L116-2 assume !(add_history_type_~var~0 < 3); 85455#L116-3 add_history_type_#res := 1; 85287#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 85288#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 85418#L116-6 assume !!(add_history_type_~var~0 < 3); 85416#L117-2 assume !(0 == add_history_type_~history_id); 85417#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 85456#L171-4 assume !(0 == read_history_bool_~history_id); 85354#L181-4 assume 1 == read_history_bool_~history_id; 85355#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 85247#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 85129#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 85130#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 85477#L116-6 assume !(add_history_type_~var~0 < 3); 85468#L116-7 add_history_type_#res := 1; 85350#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 85279#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 85280#L116-10 assume !!(add_history_type_~var~0 < 3); 85410#L117-4 assume !(0 == add_history_type_~history_id); 85412#L123-4 assume !(1 == add_history_type_~history_id); 85501#L129-4 assume 2 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 85471#L171-8 assume !(0 == read_history_bool_~history_id); 85370#L181-8 assume !(1 == read_history_bool_~history_id); 85139#L191-8 assume 2 == read_history_bool_~history_id; 85140#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 85372#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 85108#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 85109#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 85466#L116-10 assume !(add_history_type_~var~0 < 3); 85447#L116-11 add_history_type_#res := 1; 85345#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 85082#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 85083#L116-14 assume !!(add_history_type_~var~0 < 3); 85397#L117-6 assume !(0 == add_history_type_~history_id); 85398#L123-6 assume !(1 == add_history_type_~history_id); 85492#L129-6 assume !(2 == add_history_type_~history_id); 85237#L135-9 assume 3 == add_history_type_~history_id;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 85238#L151-3 assume 3 == read_history_int8_~history_id; 85248#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 85249#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 85255#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 85233#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 85234#L116-14 assume !(add_history_type_~var~0 < 3); 85440#L116-15 add_history_type_#res := 1; 85343#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 85344#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 85285#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 85286#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 85192#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 85914#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 85901#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 85281#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 85282#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 85453#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 85458#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 86049#L226-2 assume !(0 == write_history_bool_~history_id); 86045#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 86041#L574-17 assume 0 != ~gate2Failed~0 % 256; 86039#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 86037#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 86036#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 86032#L226-4 assume !(0 == write_history_bool_~history_id); 86029#L231-4 assume !(1 == write_history_bool_~history_id); 86027#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 86024#L574-18 assume 0 != ~gate3Failed~0 % 256; 85424#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 85406#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 85407#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 85422#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 85330#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 86780#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 85548#L574-20 [2018-11-28 12:20:09,356 INFO L796 eck$LassoCheckResult]: Loop: 85548#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 85532#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 85334#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 85464#L171-12 assume 0 == read_history_bool_~history_id; 85420#L172-12 assume !(0 == read_history_bool_~historyIndex); 85390#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 85391#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 86145#L307 assume !(0 == check_~tmp___3~0 % 256); 86089#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 86139#L151-7 assume 3 == read_history_int8_~history_id; 86137#L152-7 assume !(0 == read_history_int8_~historyIndex); 86135#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 86133#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 86131#L346 assume !(check_~tmp___10~0 > -2); 86132#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 85524#L151-9 assume 3 == read_history_int8_~history_id; 85149#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 85150#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 86258#L366 assume check_~tmp___11~0 != ~nomsg~0;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 86257#L151-10 assume 3 == read_history_int8_~history_id; 86244#L152-10 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 85229#L163-10 check_#t~ret24 := read_history_int8_#res;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 85230#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 85244#L366-1 check_#res := 1; 85243#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 86601#L579-72 assume !(0 == assert_~arg % 256); 86600#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 86599#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 86595#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 86594#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 86591#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 86589#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 86587#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 86582#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 85402#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 85267#L226-2 assume !(0 == write_history_bool_~history_id); 85268#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 85292#L574-17 assume 0 != ~gate2Failed~0 % 256; 85552#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 85145#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 85146#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 86650#L226-4 assume !(0 == write_history_bool_~history_id); 86649#L231-4 assume !(1 == write_history_bool_~history_id); 86647#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 86644#L574-18 assume 0 != ~gate3Failed~0 % 256; 86645#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 86801#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 86799#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 86798#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 85557#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 85558#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 85548#L574-20 [2018-11-28 12:20:09,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:09,357 INFO L82 PathProgramCache]: Analyzing trace with hash -995642884, now seen corresponding path program 2 times [2018-11-28 12:20:09,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:09,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:09,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:20:09,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:20:09,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:20:09,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:20:09,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:20:09,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:20:09,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:20:09,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:20:09,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 12:20:09,490 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:20:09,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash -695265790, now seen corresponding path program 1 times [2018-11-28 12:20:09,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:09,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:09,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:09,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:20:09,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:20:10,213 WARN L180 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 233 [2018-11-28 12:20:11,048 WARN L180 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 166 [2018-11-28 12:20:11,050 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:20:11,050 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:20:11,050 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:20:11,050 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:20:11,050 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:20:11,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:11,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:20:11,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:20:11,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration25_Loop [2018-11-28 12:20:11,051 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:20:11,051 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:20:11,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:11,595 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-11-28 12:20:13,340 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 146 DAG size of output: 120 [2018-11-28 12:20:13,381 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:20:13,381 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:13,389 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:20:13,389 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:13,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:20:13,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:20:13,530 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:20:13,531 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:20:13,531 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:20:13,531 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:20:13,531 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:20:13,531 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:20:13,531 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:20:13,531 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:20:13,531 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:20:13,531 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration25_Loop [2018-11-28 12:20:13,531 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:20:13,531 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:20:13,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,703 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2018-11-28 12:20:13,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:13,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:20:14,029 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-11-28 12:20:15,762 WARN L180 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 146 DAG size of output: 120 [2018-11-28 12:20:15,801 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:20:15,802 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:20:15,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:20:15,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:20:15,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:20:15,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:20:15,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:20:15,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:20:15,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:20:15,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:20:15,803 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:20:15,803 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:20:15,803 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:20:15,804 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:20:15,804 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:20:15,804 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:20:15,804 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-28 12:20:15,804 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:20:15,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:15,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:15,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:15,908 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:20:15,908 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1735 states and 2457 transitions. cyclomatic complexity: 732 Second operand 5 states. [2018-11-28 12:20:15,934 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1735 states and 2457 transitions. cyclomatic complexity: 732. Second operand 5 states. Result 4506 states and 6434 transitions. Complement of second has 6 states. [2018-11-28 12:20:15,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:20:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:20:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2018-11-28 12:20:15,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 544 transitions. Stem has 80 letters. Loop has 51 letters. [2018-11-28 12:20:15,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:15,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 544 transitions. Stem has 131 letters. Loop has 51 letters. [2018-11-28 12:20:15,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:15,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 544 transitions. Stem has 80 letters. Loop has 102 letters. [2018-11-28 12:20:15,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:20:15,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4506 states and 6434 transitions. [2018-11-28 12:20:15,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 459 [2018-11-28 12:20:15,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4506 states to 725 states and 1019 transitions. [2018-11-28 12:20:15,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 672 [2018-11-28 12:20:15,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 672 [2018-11-28 12:20:15,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 725 states and 1019 transitions. [2018-11-28 12:20:15,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:20:15,950 INFO L705 BuchiCegarLoop]: Abstraction has 725 states and 1019 transitions. [2018-11-28 12:20:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states and 1019 transitions. [2018-11-28 12:20:15,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 326. [2018-11-28 12:20:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-11-28 12:20:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 440 transitions. [2018-11-28 12:20:15,954 INFO L728 BuchiCegarLoop]: Abstraction has 326 states and 440 transitions. [2018-11-28 12:20:15,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:20:15,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:20:15,955 INFO L87 Difference]: Start difference. First operand 326 states and 440 transitions. Second operand 5 states. [2018-11-28 12:20:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:20:16,007 INFO L93 Difference]: Finished difference Result 468 states and 618 transitions. [2018-11-28 12:20:16,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:20:16,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 468 states and 618 transitions. [2018-11-28 12:20:16,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 230 [2018-11-28 12:20:16,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 468 states to 446 states and 593 transitions. [2018-11-28 12:20:16,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 293 [2018-11-28 12:20:16,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 [2018-11-28 12:20:16,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 446 states and 593 transitions. [2018-11-28 12:20:16,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:20:16,010 INFO L705 BuchiCegarLoop]: Abstraction has 446 states and 593 transitions. [2018-11-28 12:20:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states and 593 transitions. [2018-11-28 12:20:16,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 355. [2018-11-28 12:20:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-11-28 12:20:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 479 transitions. [2018-11-28 12:20:16,013 INFO L728 BuchiCegarLoop]: Abstraction has 355 states and 479 transitions. [2018-11-28 12:20:16,013 INFO L608 BuchiCegarLoop]: Abstraction has 355 states and 479 transitions. [2018-11-28 12:20:16,013 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-28 12:20:16,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 355 states and 479 transitions. [2018-11-28 12:20:16,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 230 [2018-11-28 12:20:16,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:20:16,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:20:16,015 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:16,015 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:20:16,015 INFO L794 eck$LassoCheckResult]: Stem: 92921#ULTIMATE.startENTRY ~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 92777#L-1 havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 92778#L116-2 assume !!(add_history_type_~var~0 < 3); 92995#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 93044#L171 assume 0 == read_history_bool_~history_id; 93041#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 93038#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 93036#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 93035#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 92996#L116-2 assume !!(add_history_type_~var~0 < 3); 92980#L117 assume 0 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 92883#L171 assume 0 == read_history_bool_~history_id; 92884#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 92759#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 92876#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 92877#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 93008#L116-2 assume !(add_history_type_~var~0 < 3); 92993#L116-3 add_history_type_#res := 1; 92893#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 92894#L255 assume !(0 == init_~tmp~1);add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 92972#L116-6 assume !!(add_history_type_~var~0 < 3); 93006#L117-2 assume !(0 == add_history_type_~history_id); 93071#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 93062#L171-4 assume !(0 == read_history_bool_~history_id); 93060#L181-4 assume 1 == read_history_bool_~history_id; 93054#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 93050#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 93048#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 93012#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 93007#L116-6 assume !!(add_history_type_~var~0 < 3); 92970#L117-2 assume !(0 == add_history_type_~history_id); 92971#L123-2 assume 1 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 92994#L171-4 assume !(0 == read_history_bool_~history_id); 92930#L181-4 assume 1 == read_history_bool_~history_id; 92931#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 92866#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 92799#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 92800#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 93037#L116-6 assume !(add_history_type_~var~0 < 3); 93000#L116-7 add_history_type_#res := 1; 92927#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 92888#L259 assume !(0 == init_~tmp___0~1);add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 92889#L116-10 assume !!(add_history_type_~var~0 < 3); 92966#L117-4 assume !(0 == add_history_type_~history_id); 92967#L123-4 assume !(1 == add_history_type_~history_id); 93020#L129-4 assume 2 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 93003#L171-8 assume !(0 == read_history_bool_~history_id); 92941#L181-8 assume !(1 == read_history_bool_~history_id); 92809#L191-8 assume 2 == read_history_bool_~history_id; 92810#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 92944#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 92786#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 92787#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 92999#L116-10 assume !!(add_history_type_~var~0 < 3); 92968#L117-4 assume !(0 == add_history_type_~history_id); 92969#L123-4 assume !(1 == add_history_type_~history_id); 93019#L129-4 assume 2 == add_history_type_~history_id;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 93002#L171-8 assume !(0 == read_history_bool_~history_id); 92940#L181-8 assume !(1 == read_history_bool_~history_id); 92806#L191-8 assume 2 == read_history_bool_~history_id; 92807#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 92942#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 92784#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 92785#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 92998#L116-10 assume !(add_history_type_~var~0 < 3); 92989#L116-11 add_history_type_#res := 1; 92924#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 92769#L263 assume !(0 == init_~tmp___1~1);add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 92770#L116-14 assume !!(add_history_type_~var~0 < 3); 92957#L117-6 assume !(0 == add_history_type_~history_id); 92958#L123-6 assume !(1 == add_history_type_~history_id); 93016#L129-6 assume !(2 == add_history_type_~history_id); 92861#L135-9 assume 3 == add_history_type_~history_id;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 92862#L151-3 assume 3 == read_history_int8_~history_id; 92869#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 92870#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 92874#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 92857#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 92858#L116-14 assume !!(add_history_type_~var~0 < 3); 92959#L117-6 assume !(0 == add_history_type_~history_id); 92960#L123-6 assume !(1 == add_history_type_~history_id); 93015#L129-6 assume !(2 == add_history_type_~history_id); 92859#L135-9 assume 3 == add_history_type_~history_id;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 92860#L151-3 assume 3 == read_history_int8_~history_id; 92867#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 92868#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 92873#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 92855#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 92856#L116-14 assume !(add_history_type_~var~0 < 3); 92986#L116-15 add_history_type_#res := 1; 92922#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 92923#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 92892#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 92837#L554-2 [2018-11-28 12:20:16,015 INFO L796 eck$LassoCheckResult]: Loop: 92837#L554-2 assume !!(main_~i2~0 < 10);havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 92838#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 92886#L574-16 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 92933#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 92890#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 92891#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 92992#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 92962#L409 havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 92881#L226-2 assume !(0 == write_history_bool_~history_id); 92882#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 92898#L574-17 assume 0 != ~gate2Failed~0 % 256; 92846#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 92812#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 92813#L440 havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 92929#L226-4 assume !(0 == write_history_bool_~history_id); 92925#L231-4 assume !(1 == write_history_bool_~history_id); 92926#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 93080#L574-18 assume 0 != ~gate3Failed~0 % 256; 92976#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 92977#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 93112#L471 havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 93108#L486 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0 := ~VALUE1~0; 93093#L574-19 write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 93091#L211 assume !(3 == write_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 93089#L579-40 assume !(0 == assert_~arg % 256); 93088#L574-20 ~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 93023#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 93021#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 92997#L171-12 assume 0 == read_history_bool_~history_id; 92974#L172-12 assume !(0 == read_history_bool_~historyIndex); 92954#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 92939#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 92781#L307 assume !(0 == check_~tmp___3~0 % 256); 92782#L307-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 92788#L151-7 assume 3 == read_history_int8_~history_id; 92820#L152-7 assume !(0 == read_history_int8_~historyIndex); 92821#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 92822#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 92823#L346 assume !(check_~tmp___10~0 > -2); 92946#L346-1 read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 92947#L151-9 assume 3 == read_history_int8_~history_id; 92814#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 92815#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 92816#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 92864#L366-1 check_#res := 1; 92852#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 92853#L579-72 assume !(0 == assert_~arg % 256); 92878#L574-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 92837#L554-2 [2018-11-28 12:20:16,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash -12291865, now seen corresponding path program 1 times [2018-11-28 12:20:16,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:16,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:16,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:16,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:16,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-28 12:20:16,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:20:16,102 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b0e5fa-2608-4934-8d42-512bbc83cde9/bin-2019/uautomizer/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:20:16,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:16,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:20:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-28 12:20:16,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:20:16,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 12:20:16,174 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:20:16,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:20:16,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1987046614, now seen corresponding path program 1 times [2018-11-28 12:20:16,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:20:16,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:20:16,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:16,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:20:16,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:20:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:20:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:20:16,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:20:16,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:20:16,193 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:20:16,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:20:16,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:20:16,193 INFO L87 Difference]: Start difference. First operand 355 states and 479 transitions. cyclomatic complexity: 129 Second operand 3 states. [2018-11-28 12:20:16,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:20:16,194 INFO L93 Difference]: Finished difference Result 226 states and 311 transitions. [2018-11-28 12:20:16,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:20:16,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 311 transitions. [2018-11-28 12:20:16,195 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:20:16,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 0 states and 0 transitions. [2018-11-28 12:20:16,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:20:16,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:20:16,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:20:16,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:20:16,195 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:20:16,195 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:20:16,195 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:20:16,196 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-28 12:20:16,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:20:16,196 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:20:16,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:20:16,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:20:16 BoogieIcfgContainer [2018-11-28 12:20:16,202 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:20:16,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:20:16,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:20:16,202 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:20:16,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:18:26" (3/4) ... [2018-11-28 12:20:16,206 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:20:16,206 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:20:16,207 INFO L168 Benchmark]: Toolchain (without parser) took 110885.40 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 954.4 MB in the beginning and 1.4 GB in the end (delta: -447.7 MB). Peak memory consumption was 606.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:16,207 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:20:16,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:16,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:16,208 INFO L168 Benchmark]: Boogie Preprocessor took 54.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:16,208 INFO L168 Benchmark]: RCFGBuilder took 1064.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.4 MB in the end (delta: 140.8 MB). Peak memory consumption was 140.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:16,209 INFO L168 Benchmark]: BuchiAutomizer took 109425.65 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 896.5 MB). Free memory was 998.4 MB in the beginning and 1.4 GB in the end (delta: -426.6 MB). Peak memory consumption was 469.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:16,209 INFO L168 Benchmark]: Witness Printer took 4.13 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:20:16,211 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 284.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1064.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.4 MB in the end (delta: 140.8 MB). Peak memory consumption was 140.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 109425.65 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 896.5 MB). Free memory was 998.4 MB in the beginning and 1.4 GB in the end (delta: -426.6 MB). Peak memory consumption was 469.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.13 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 36 terminating modules (26 trivial, 10 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * var + 5 and consists of 5 locations. One deterministic module has affine ranking function -2 * var + 5 and consists of 4 locations. One deterministic module has affine ranking function -2 * var + 3 and consists of 4 locations. One deterministic module has affine ranking function -2 * var + 3 and consists of 4 locations. One deterministic module has affine ranking function -1 * votedValue_History_0 + -1 * g1v_\old + nomsg and consists of 41 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -1 * votedValue_History_0 + -1 * g1v_\old + nomsg and consists of 41 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. 26 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 109.3s and 27 iterations. TraceHistogramMax:2. Analysis of lassos took 100.4s. Construction of modules took 2.6s. Büchi inclusion checks took 5.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 35. Automata minimization 0.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 15350 StatesRemovedByMinimization, 27 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 1842 states and ocurred in iteration 20. Nontrivial modules had stage [10, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22515 SDtfs, 20352 SDslu, 34796 SDs, 0 SdLazy, 4784 SolverSat, 362 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT1 SILN0 SILU0 SILI16 SILT9 lasso0 LassoPreprocessingBenchmarks: Lassos: inital607 mio100 ax177 hnf109 lsp20 ukn80 mio100 lsp100 div145 bol100 ite100 ukn100 eq177 hnf80 smp100 dnf3811 smp13 tf105 neg99 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 256ms VariablesStem: 0 VariablesLoop: 36 DisjunctsStem: 1 DisjunctsLoop: 16 SupportingInvariants: 0 MotzkinApplications: 32 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 88 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 27.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...