./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.5_false-unreach-call.4.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.5_false-unreach-call.4.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/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 727f24e8ef6f45fcd7845df4b7c9997bc6f388f6 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:22:34,550 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:22:34,551 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:22:34,559 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:22:34,559 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:22:34,560 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:22:34,561 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:22:34,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:22:34,563 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:22:34,564 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:22:34,564 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:22:34,564 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:22:34,565 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:22:34,566 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:22:34,566 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:22:34,567 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:22:34,568 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:22:34,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:22:34,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:22:34,571 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:22:34,572 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:22:34,573 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:22:34,574 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:22:34,574 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:22:34,575 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:22:34,575 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:22:34,576 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:22:34,577 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:22:34,577 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:22:34,578 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:22:34,578 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:22:34,579 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:22:34,579 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:22:34,579 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:22:34,579 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:22:34,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:22:34,580 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 05:22:34,591 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:22:34,591 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:22:34,592 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:22:34,592 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:22:34,592 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:22:34,592 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:22:34,593 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:22:34,593 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:22:34,593 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:22:34,593 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:22:34,593 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:22:34,593 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:22:34,593 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:22:34,594 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:22:34,594 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:22:34,594 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:22:34,594 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:22:34,594 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:22:34,594 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:22:34,594 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:22:34,594 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:22:34,595 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:22:34,595 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:22:34,595 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:22:34,595 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:22:34,595 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:22:34,595 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:22:34,595 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:22:34,596 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:22:34,596 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:22:34,596 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:22:34,597 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_47130112-3fc8-4770-828b-52ee81473886/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 -> 727f24e8ef6f45fcd7845df4b7c9997bc6f388f6 [2018-11-10 05:22:34,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:22:34,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:22:34,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:22:34,627 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:22:34,628 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:22:34,628 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.5_false-unreach-call.4.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 05:22:34,664 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/bin-2019/uautomizer/data/fb4d7463e/97b165740b354cce900dc64954b9d10f/FLAGe765219df [2018-11-10 05:22:35,118 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:22:35,118 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5_false-unreach-call.4.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 05:22:35,130 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/bin-2019/uautomizer/data/fb4d7463e/97b165740b354cce900dc64954b9d10f/FLAGe765219df [2018-11-10 05:22:35,138 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/bin-2019/uautomizer/data/fb4d7463e/97b165740b354cce900dc64954b9d10f [2018-11-10 05:22:35,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:22:35,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:22:35,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:22:35,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:22:35,144 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:22:35,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:22:35" (1/1) ... [2018-11-10 05:22:35,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70607c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:22:35, skipping insertion in model container [2018-11-10 05:22:35,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:22:35" (1/1) ... [2018-11-10 05:22:35,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:22:35,191 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:22:35,433 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:22:35,440 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:22:35,510 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:22:35,526 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:22:35,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:22:35 WrapperNode [2018-11-10 05:22:35,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:22:35,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:22:35,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:22:35,527 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:22:35,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:22:35" (1/1) ... [2018-11-10 05:22:35,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:22:35" (1/1) ... [2018-11-10 05:22:35,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:22:35,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:22:35,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:22:35,634 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:22:35,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:22:35" (1/1) ... [2018-11-10 05:22:35,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:22:35" (1/1) ... [2018-11-10 05:22:35,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:22:35" (1/1) ... [2018-11-10 05:22:35,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:22:35" (1/1) ... [2018-11-10 05:22:35,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:22:35" (1/1) ... [2018-11-10 05:22:35,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:22:35" (1/1) ... [2018-11-10 05:22:35,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:22:35" (1/1) ... [2018-11-10 05:22:35,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:22:35,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:22:35,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:22:35,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:22:35,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:22:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/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-10 05:22:35,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:22:35,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:22:36,965 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:22:36,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:22:36 BoogieIcfgContainer [2018-11-10 05:22:36,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:22:36,966 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:22:36,966 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:22:36,969 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:22:36,970 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:22:36,970 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:22:35" (1/3) ... [2018-11-10 05:22:36,971 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@525d1367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:22:36, skipping insertion in model container [2018-11-10 05:22:36,971 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:22:36,971 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:22:35" (2/3) ... [2018-11-10 05:22:36,971 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@525d1367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:22:36, skipping insertion in model container [2018-11-10 05:22:36,971 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:22:36,972 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:22:36" (3/3) ... [2018-11-10 05:22:36,973 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.5_false-unreach-call.4.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 05:22:37,022 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:22:37,023 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:22:37,023 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:22:37,023 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:22:37,024 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:22:37,024 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:22:37,024 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:22:37,024 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:22:37,025 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:22:37,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 704 states. [2018-11-10 05:22:37,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 156 [2018-11-10 05:22:37,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:22:37,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:22:37,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:22:37,104 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] [2018-11-10 05:22:37,104 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:22:37,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 704 states. [2018-11-10 05:22:37,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 156 [2018-11-10 05:22:37,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:22:37,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:22:37,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:22:37,118 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] [2018-11-10 05:22:37,128 INFO L793 eck$LassoCheckResult]: Stem: 486#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p15~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p25~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p35~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~p45~0 := 0;~p51~0 := 0;~p52~0 := 0;~p53~0 := 0;~p54~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 367#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, 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~nondet57, main_#t~nondet58, main_#t~nondet59, main_#t~nondet60, main_#t~nondet61, main_#t~nondet62, main_#t~nondet63, main_#t~nondet64, main_#t~nondet65, main_#t~nondet66, main_#t~nondet67, main_#t~nondet68, main_#t~nondet69, main_#t~nondet70, main_#t~nondet71, main_#t~nondet72, main_#t~nondet73, main_#t~nondet74, main_#t~ret75, main_#t~ret76, main_#t~post77, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep13~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep14~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep15~0 := main_#t~nondet23;havoc main_#t~nondet23;~ep21~0 := main_#t~nondet24;havoc main_#t~nondet24;~ep23~0 := main_#t~nondet25;havoc main_#t~nondet25;~ep24~0 := main_#t~nondet26;havoc main_#t~nondet26;~ep25~0 := main_#t~nondet27;havoc main_#t~nondet27;~ep31~0 := main_#t~nondet28;havoc main_#t~nondet28;~ep32~0 := main_#t~nondet29;havoc main_#t~nondet29;~ep34~0 := main_#t~nondet30;havoc main_#t~nondet30;~ep35~0 := main_#t~nondet31;havoc main_#t~nondet31;~ep41~0 := main_#t~nondet32;havoc main_#t~nondet32;~ep42~0 := main_#t~nondet33;havoc main_#t~nondet33;~ep43~0 := main_#t~nondet34;havoc main_#t~nondet34;~ep45~0 := main_#t~nondet35;havoc main_#t~nondet35;~ep51~0 := main_#t~nondet36;havoc main_#t~nondet36;~ep52~0 := main_#t~nondet37;havoc main_#t~nondet37;~ep53~0 := main_#t~nondet38;havoc main_#t~nondet38;~ep54~0 := main_#t~nondet39;havoc main_#t~nondet39;~id1~0 := main_#t~nondet40;havoc main_#t~nondet40;~r1~0 := main_#t~nondet41;havoc main_#t~nondet41;~st1~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl1~0 := main_#t~nondet43;havoc main_#t~nondet43;~m1~0 := main_#t~nondet44;havoc main_#t~nondet44;~max1~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode1~0 := main_#t~nondet46;havoc main_#t~nondet46;~id2~0 := main_#t~nondet47;havoc main_#t~nondet47;~r2~0 := main_#t~nondet48;havoc main_#t~nondet48;~st2~0 := main_#t~nondet49;havoc main_#t~nondet49;~nl2~0 := main_#t~nondet50;havoc main_#t~nondet50;~m2~0 := main_#t~nondet51;havoc main_#t~nondet51;~max2~0 := main_#t~nondet52;havoc main_#t~nondet52;~mode2~0 := main_#t~nondet53;havoc main_#t~nondet53;~id3~0 := main_#t~nondet54;havoc main_#t~nondet54;~r3~0 := main_#t~nondet55;havoc main_#t~nondet55;~st3~0 := main_#t~nondet56;havoc main_#t~nondet56;~nl3~0 := main_#t~nondet57;havoc main_#t~nondet57;~m3~0 := main_#t~nondet58;havoc main_#t~nondet58;~max3~0 := main_#t~nondet59;havoc main_#t~nondet59;~mode3~0 := main_#t~nondet60;havoc main_#t~nondet60;~id4~0 := main_#t~nondet61;havoc main_#t~nondet61;~r4~0 := main_#t~nondet62;havoc main_#t~nondet62;~st4~0 := main_#t~nondet63;havoc main_#t~nondet63;~nl4~0 := main_#t~nondet64;havoc main_#t~nondet64;~m4~0 := main_#t~nondet65;havoc main_#t~nondet65;~max4~0 := main_#t~nondet66;havoc main_#t~nondet66;~mode4~0 := main_#t~nondet67;havoc main_#t~nondet67;~id5~0 := main_#t~nondet68;havoc main_#t~nondet68;~r5~0 := main_#t~nondet69;havoc main_#t~nondet69;~st5~0 := main_#t~nondet70;havoc main_#t~nondet70;~nl5~0 := main_#t~nondet71;havoc main_#t~nondet71;~m5~0 := main_#t~nondet72;havoc main_#t~nondet72;~max5~0 := main_#t~nondet73;havoc main_#t~nondet73;~mode5~0 := main_#t~nondet74;havoc main_#t~nondet74;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r151~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r251~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r351~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r451~0, init_~r511~0, init_~r521~0, init_~r531~0, init_~r541~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r152~0, init_~tmp___2~0, init_~r212~0, init_~tmp___3~0, init_~r232~0, init_~tmp___4~0, init_~r242~0, init_~tmp___5~0, init_~r252~0, init_~tmp___6~0, init_~r312~0, init_~tmp___7~0, init_~r322~0, init_~tmp___8~0, init_~r342~0, init_~tmp___9~0, init_~r352~0, init_~tmp___10~0, init_~r412~0, init_~tmp___11~0, init_~r422~0, init_~tmp___12~0, init_~r432~0, init_~tmp___13~0, init_~r452~0, init_~tmp___14~0, init_~r512~0, init_~tmp___15~0, init_~r522~0, init_~tmp___16~0, init_~r532~0, init_~tmp___17~0, init_~r542~0, init_~tmp___18~0, init_~r123~0, init_~tmp___19~0, init_~r133~0, init_~tmp___20~0, init_~r143~0, init_~tmp___21~0, init_~r153~0, init_~tmp___22~0, init_~r213~0, init_~tmp___23~0, init_~r233~0, init_~tmp___24~0, init_~r243~0, init_~tmp___25~0, init_~r253~0, init_~tmp___26~0, init_~r313~0, init_~tmp___27~0, init_~r323~0, init_~tmp___28~0, init_~r343~0, init_~tmp___29~0, init_~r353~0, init_~tmp___30~0, init_~r413~0, init_~tmp___31~0, init_~r423~0, init_~tmp___32~0, init_~r433~0, init_~tmp___33~0, init_~r453~0, init_~tmp___34~0, init_~r513~0, init_~tmp___35~0, init_~r523~0, init_~tmp___36~0, init_~r533~0, init_~tmp___37~0, init_~r543~0, init_~tmp___38~0, init_~r124~0, init_~tmp___39~0, init_~r134~0, init_~tmp___40~0, init_~r144~0, init_~tmp___41~0, init_~r154~0, init_~tmp___42~0, init_~r214~0, init_~tmp___43~0, init_~r234~0, init_~tmp___44~0, init_~r244~0, init_~tmp___45~0, init_~r254~0, init_~tmp___46~0, init_~r314~0, init_~tmp___47~0, init_~r324~0, init_~tmp___48~0, init_~r344~0, init_~tmp___49~0, init_~r354~0, init_~tmp___50~0, init_~r414~0, init_~tmp___51~0, init_~r424~0, init_~tmp___52~0, init_~r434~0, init_~tmp___53~0, init_~r454~0, init_~tmp___54~0, init_~r514~0, init_~tmp___55~0, init_~r524~0, init_~tmp___56~0, init_~r534~0, init_~tmp___57~0, init_~r544~0, init_~tmp___58~0, init_~tmp___59~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r151~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r251~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r351~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r451~0;havoc init_~r511~0;havoc init_~r521~0;havoc init_~r531~0;havoc init_~r541~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r152~0;havoc init_~tmp___2~0;havoc init_~r212~0;havoc init_~tmp___3~0;havoc init_~r232~0;havoc init_~tmp___4~0;havoc init_~r242~0;havoc init_~tmp___5~0;havoc init_~r252~0;havoc init_~tmp___6~0;havoc init_~r312~0;havoc init_~tmp___7~0;havoc init_~r322~0;havoc init_~tmp___8~0;havoc init_~r342~0;havoc init_~tmp___9~0;havoc init_~r352~0;havoc init_~tmp___10~0;havoc init_~r412~0;havoc init_~tmp___11~0;havoc init_~r422~0;havoc init_~tmp___12~0;havoc init_~r432~0;havoc init_~tmp___13~0;havoc init_~r452~0;havoc init_~tmp___14~0;havoc init_~r512~0;havoc init_~tmp___15~0;havoc init_~r522~0;havoc init_~tmp___16~0;havoc init_~r532~0;havoc init_~tmp___17~0;havoc init_~r542~0;havoc init_~tmp___18~0;havoc init_~r123~0;havoc init_~tmp___19~0;havoc init_~r133~0;havoc init_~tmp___20~0;havoc init_~r143~0;havoc init_~tmp___21~0;havoc init_~r153~0;havoc init_~tmp___22~0;havoc init_~r213~0;havoc init_~tmp___23~0;havoc init_~r233~0;havoc init_~tmp___24~0;havoc init_~r243~0;havoc init_~tmp___25~0;havoc init_~r253~0;havoc init_~tmp___26~0;havoc init_~r313~0;havoc init_~tmp___27~0;havoc init_~r323~0;havoc init_~tmp___28~0;havoc init_~r343~0;havoc init_~tmp___29~0;havoc init_~r353~0;havoc init_~tmp___30~0;havoc init_~r413~0;havoc init_~tmp___31~0;havoc init_~r423~0;havoc init_~tmp___32~0;havoc init_~r433~0;havoc init_~tmp___33~0;havoc init_~r453~0;havoc init_~tmp___34~0;havoc init_~r513~0;havoc init_~tmp___35~0;havoc init_~r523~0;havoc init_~tmp___36~0;havoc init_~r533~0;havoc init_~tmp___37~0;havoc init_~r543~0;havoc init_~tmp___38~0;havoc init_~r124~0;havoc init_~tmp___39~0;havoc init_~r134~0;havoc init_~tmp___40~0;havoc init_~r144~0;havoc init_~tmp___41~0;havoc init_~r154~0;havoc init_~tmp___42~0;havoc init_~r214~0;havoc init_~tmp___43~0;havoc init_~r234~0;havoc init_~tmp___44~0;havoc init_~r244~0;havoc init_~tmp___45~0;havoc init_~r254~0;havoc init_~tmp___46~0;havoc init_~r314~0;havoc init_~tmp___47~0;havoc init_~r324~0;havoc init_~tmp___48~0;havoc init_~r344~0;havoc init_~tmp___49~0;havoc init_~r354~0;havoc init_~tmp___50~0;havoc init_~r414~0;havoc init_~tmp___51~0;havoc init_~r424~0;havoc init_~tmp___52~0;havoc init_~r434~0;havoc init_~tmp___53~0;havoc init_~r454~0;havoc init_~tmp___54~0;havoc init_~r514~0;havoc init_~tmp___55~0;havoc init_~r524~0;havoc init_~tmp___56~0;havoc init_~r534~0;havoc init_~tmp___57~0;havoc init_~r544~0;havoc init_~tmp___58~0;havoc init_~tmp___59~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r151~0 := ~ep15~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r251~0 := ~ep25~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r351~0 := ~ep35~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0;init_~r451~0 := ~ep45~0;init_~r511~0 := ~ep51~0;init_~r521~0 := ~ep52~0;init_~r531~0 := ~ep53~0;init_~r541~0 := ~ep54~0; 597#L667true assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 65#L686true init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 322#L696true assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 527#L715true init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 409#L725true assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 595#L744true init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 119#L754true assume init_~r151~0 % 256 != 0;init_~tmp___2~0 := 1; 335#L773true init_~r152~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 229#L783true assume init_~r211~0 % 256 != 0;init_~tmp___3~0 := 1; 406#L802true init_~r212~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 641#L812true assume init_~r231~0 % 256 != 0;init_~tmp___4~0 := 1; 135#L831true init_~r232~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 9#L841true assume init_~r241~0 % 256 != 0;init_~tmp___5~0 := 1; 225#L860true init_~r242~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 463#L870true assume init_~r251~0 % 256 != 0;init_~tmp___6~0 := 1; 636#L889true init_~r252~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 539#L899true assume init_~r311~0 % 256 != 0;init_~tmp___7~0 := 1; 24#L918true init_~r312~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 280#L928true assume init_~r321~0 % 256 != 0;init_~tmp___8~0 := 1; 461#L947true init_~r322~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 530#L957true assume init_~r341~0 % 256 != 0;init_~tmp___9~0 := 1; 553#L976true init_~r342~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 615#L986true assume init_~r351~0 % 256 != 0;init_~tmp___10~0 := 1; 274#L1005true init_~r352~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 340#L1015true assume init_~r411~0 % 256 != 0;init_~tmp___11~0 := 1; 365#L1034true init_~r412~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 413#L1044true assume init_~r421~0 % 256 != 0;init_~tmp___12~0 := 1; 612#L1063true init_~r422~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 140#L1073true assume init_~r431~0 % 256 != 0;init_~tmp___13~0 := 1; 337#L1092true init_~r432~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 231#L1102true assume init_~r451~0 % 256 != 0;init_~tmp___14~0 := 1; 431#L1121true init_~r452~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 666#L1131true assume init_~r511~0 % 256 != 0;init_~tmp___15~0 := 1; 137#L1150true init_~r512~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 30#L1160true assume init_~r521~0 % 256 != 0;init_~tmp___16~0 := 1; 248#L1179true init_~r522~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 491#L1189true assume init_~r531~0 % 256 != 0;init_~tmp___17~0 := 1; 662#L1208true init_~r532~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 557#L1218true assume init_~r541~0 % 256 != 0;init_~tmp___18~0 := 1; 44#L1237true init_~r542~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 307#L1247true assume init_~r122~0 % 256 != 0;init_~tmp___19~0 := 1; 488#L1266true init_~r123~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 376#L1276true assume init_~r132~0 % 256 != 0;init_~tmp___20~0 := 1; 581#L1295true init_~r133~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 80#L1305true assume init_~r142~0 % 256 != 0;init_~tmp___21~0 := 1; 304#L1324true init_~r143~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 196#L1334true assume init_~r152~0 % 256 != 0;init_~tmp___22~0 := 1; 368#L1353true init_~r153~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 437#L1363true assume init_~r212~0 % 256 != 0;init_~tmp___23~0 := 1; 102#L1382true init_~r213~0 := (if init_~tmp___23~0 == 0 then 0 else 1); 173#L1392true assume init_~r232~0 % 256 != 0;init_~tmp___24~0 := 1; 185#L1411true init_~r233~0 := (if init_~tmp___24~0 == 0 then 0 else 1); 254#L1421true assume init_~r242~0 % 256 != 0;init_~tmp___25~0 := 1; 623#L1440true init_~r243~0 := (if init_~tmp___25~0 == 0 then 0 else 1); 698#L1450true assume init_~r252~0 % 256 != 0;init_~tmp___26~0 := 1; 160#L1469true init_~r253~0 := (if init_~tmp___26~0 == 0 then 0 else 1); 50#L1479true assume init_~r312~0 % 256 != 0;init_~tmp___27~0 := 1; 271#L1498true init_~r313~0 := (if init_~tmp___27~0 == 0 then 0 else 1); 495#L1508true assume init_~r322~0 % 256 != 0;init_~tmp___28~0 := 1; 689#L1527true init_~r323~0 := (if init_~tmp___28~0 == 0 then 0 else 1); 587#L1537true assume init_~r342~0 % 256 != 0;init_~tmp___29~0 := 1; 46#L1556true init_~r343~0 := (if init_~tmp___29~0 == 0 then 0 else 1); 311#L1566true assume init_~r352~0 % 256 != 0;init_~tmp___30~0 := 1; 517#L1585true init_~r353~0 := (if init_~tmp___30~0 == 0 then 0 else 1); 402#L1595true assume init_~r412~0 % 256 != 0;init_~tmp___31~0 := 1; 584#L1614true init_~r413~0 := (if init_~tmp___31~0 == 0 then 0 else 1); 114#L1624true assume init_~r422~0 % 256 != 0;init_~tmp___32~0 := 1; 325#L1643true init_~r423~0 := (if init_~tmp___32~0 == 0 then 0 else 1); 215#L1653true assume init_~r432~0 % 256 != 0;init_~tmp___33~0 := 1; 400#L1672true init_~r433~0 := (if init_~tmp___33~0 == 0 then 0 else 1); 630#L1682true assume init_~r452~0 % 256 != 0;init_~tmp___34~0 := 1; 124#L1701true init_~r453~0 := (if init_~tmp___34~0 == 0 then 0 else 1); 16#L1711true assume init_~r512~0 % 256 != 0;init_~tmp___35~0 := 1; 210#L1730true init_~r513~0 := (if init_~tmp___35~0 == 0 then 0 else 1); 454#L1740true assume init_~r522~0 % 256 != 0;init_~tmp___36~0 := 1; 644#L1759true init_~r523~0 := (if init_~tmp___36~0 == 0 then 0 else 1); 701#L1769true assume init_~r532~0 % 256 != 0;init_~tmp___37~0 := 1; 15#L1788true init_~r533~0 := (if init_~tmp___37~0 == 0 then 0 else 1); 76#L1798true assume init_~r542~0 % 256 != 0;init_~tmp___38~0 := 1; 451#L1817true init_~r543~0 := (if init_~tmp___38~0 == 0 then 0 else 1); 519#L1827true assume init_~r123~0 % 256 != 0;init_~tmp___39~0 := 1; 542#L1846true init_~r124~0 := (if init_~tmp___39~0 == 0 then 0 else 1); 606#L1856true assume init_~r133~0 % 256 != 0;init_~tmp___40~0 := 1; 72#L1875true init_~r134~0 := (if init_~tmp___40~0 == 0 then 0 else 1); 332#L1885true assume init_~r143~0 % 256 != 0;init_~tmp___41~0 := 1; 536#L1904true init_~r144~0 := (if init_~tmp___41~0 == 0 then 0 else 1); 419#L1914true assume init_~r153~0 % 256 != 0;init_~tmp___42~0 := 1; 603#L1933true init_~r154~0 := (if init_~tmp___42~0 == 0 then 0 else 1); 128#L1943true assume init_~r213~0 % 256 != 0;init_~tmp___43~0 := 1; 344#L1962true init_~r214~0 := (if init_~tmp___43~0 == 0 then 0 else 1); 220#L1972true assume init_~r233~0 % 256 != 0;init_~tmp___44~0 := 1; 415#L1991true init_~r234~0 := (if init_~tmp___44~0 == 0 then 0 else 1); 654#L2001true assume init_~r243~0 % 256 != 0;init_~tmp___45~0 := 1; 127#L2020true init_~r244~0 := (if init_~tmp___45~0 == 0 then 0 else 1); 19#L2030true assume init_~r253~0 % 256 != 0;init_~tmp___46~0 := 1; 238#L2049true init_~r254~0 := (if init_~tmp___46~0 == 0 then 0 else 1); 478#L2059true assume init_~r313~0 % 256 != 0;init_~tmp___47~0 := 1; 647#L2078true init_~r314~0 := (if init_~tmp___47~0 == 0 then 0 else 1); 548#L2088true assume init_~r323~0 % 256 != 0;init_~tmp___48~0 := 1; 32#L2107true init_~r324~0 := (if init_~tmp___48~0 == 0 then 0 else 1); 291#L2117true assume init_~r343~0 % 256 != 0;init_~tmp___49~0 := 1; 473#L2136true init_~r344~0 := (if init_~tmp___49~0 == 0 then 0 else 1); 358#L2146true assume init_~r353~0 % 256 != 0;init_~tmp___50~0 := 1; 562#L2165true init_~r354~0 := (if init_~tmp___50~0 == 0 then 0 else 1); 88#L2175true assume init_~r413~0 % 256 != 0;init_~tmp___51~0 := 1; 284#L2194true init_~r414~0 := (if init_~tmp___51~0 == 0 then 0 else 1); 352#L2204true assume init_~r423~0 % 256 != 0;init_~tmp___52~0 := 1; 378#L2223true init_~r424~0 := (if init_~tmp___52~0 == 0 then 0 else 1); 425#L2233true assume init_~r433~0 % 256 != 0;init_~tmp___53~0 := 1; 87#L2252true init_~r434~0 := (if init_~tmp___53~0 == 0 then 0 else 1); 152#L2262true assume init_~r453~0 % 256 != 0;init_~tmp___54~0 := 1; 349#L2281true init_~r454~0 := (if init_~tmp___54~0 == 0 then 0 else 1); 242#L2291true assume init_~r513~0 % 256 != 0;init_~tmp___55~0 := 1; 443#L2310true init_~r514~0 := (if init_~tmp___55~0 == 0 then 0 else 1); 684#L2320true assume init_~r523~0 % 256 != 0;init_~tmp___56~0 := 1; 146#L2339true init_~r524~0 := (if init_~tmp___56~0 == 0 then 0 else 1); 41#L2349true assume init_~r533~0 % 256 != 0;init_~tmp___57~0 := 1; 266#L2368true init_~r534~0 := (if init_~tmp___57~0 == 0 then 0 else 1); 511#L2378true assume init_~r543~0 % 256 != 0;init_~tmp___58~0 := 1; 677#L2397true init_~r544~0 := (if init_~tmp___58~0 == 0 then 0 else 1); 567#L2407true assume !(~id1~0 != ~id2~0);init_~tmp___59~0 := 0; 573#L2407-1true init_#res := init_~tmp___59~0; 115#L2648true main_#t~ret75 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret75;havoc main_#t~ret75;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p15_old~0 := ~nomsg~0;~p15_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p25_old~0 := ~nomsg~0;~p25_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p35_old~0 := ~nomsg~0;~p35_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0 := 0; 213#L2820-3true [2018-11-10 05:22:37,129 INFO L795 eck$LassoCheckResult]: Loop: 213#L2820-3true assume true; 208#L2820-1true assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_#t~ite3; 282#L190true assume !(~mode1~0 % 256 != 0); 424#L229true assume !(~r1~0 < 3); 449#L229-1true ~mode1~0 := 1; 276#L190-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite4, node2_#t~ite5, node2_#t~ite6, node2_#t~ite7; 481#L253true assume !(~mode2~0 % 256 != 0); 109#L292true assume !(~r2~0 < 4); 106#L292-1true ~mode2~0 := 1; 471#L253-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8, node3_#t~ite9, node3_#t~ite10, node3_#t~ite11; 678#L316true assume !(~mode3~0 % 256 != 0); 297#L355true assume !(~r3~0 < 4); 300#L355-1true ~mode3~0 := 1; 685#L316-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite12, node4_#t~ite13, node4_#t~ite14, node4_#t~ite15; 170#L379true assume !(~mode4~0 % 256 != 0); 503#L418true assume !(~r4~0 < 4); 506#L418-1true ~mode4~0 := 1; 147#L379-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite16, node5_#t~ite17, node5_#t~ite18, node5_#t~ite19; 206#L442true assume !(~mode5~0 % 256 != 0); 691#L481true assume !(~r5~0 < 4); 693#L481-1true ~mode5~0 := 1; 188#L442-2true assume { :end_inline_node5 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p15_old~0 := ~p15_new~0;~p15_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p25_old~0 := ~p25_new~0;~p25_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p35_old~0 := ~p35_new~0;~p35_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 328#L2656true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 326#L2656-1true check_#res := check_~tmp~1; 67#L2712true main_#t~ret76 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret76;havoc main_#t~ret76;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 608#L2880true assume !(assert_~arg % 256 == 0); 226#L2875true assume { :end_inline_assert } true;main_#t~post77 := main_~i2~0;main_~i2~0 := main_#t~post77 + 1;havoc main_#t~post77; 213#L2820-3true [2018-11-10 05:22:37,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:22:37,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1740203620, now seen corresponding path program 1 times [2018-11-10 05:22:37,137 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:22:37,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:22:37,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:22:37,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:22:37,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:22:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:22:37,449 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-10 05:22:37,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:22:37,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:22:37,454 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:22:37,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:22:37,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1970358414, now seen corresponding path program 1 times [2018-11-10 05:22:37,455 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:22:37,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:22:37,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:22:37,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:22:37,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:22:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:22:37,516 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-10 05:22:37,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:22:37,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:22:37,518 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:22:37,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:22:37,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:22:37,530 INFO L87 Difference]: Start difference. First operand 704 states. Second operand 5 states. [2018-11-10 05:22:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:22:37,645 INFO L93 Difference]: Finished difference Result 708 states and 1301 transitions. [2018-11-10 05:22:37,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:22:37,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 708 states and 1301 transitions. [2018-11-10 05:22:37,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 155 [2018-11-10 05:22:37,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 708 states to 699 states and 1283 transitions. [2018-11-10 05:22:37,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 699 [2018-11-10 05:22:37,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 699 [2018-11-10 05:22:37,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 699 states and 1283 transitions. [2018-11-10 05:22:37,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:22:37,670 INFO L705 BuchiCegarLoop]: Abstraction has 699 states and 1283 transitions. [2018-11-10 05:22:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states and 1283 transitions. [2018-11-10 05:22:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2018-11-10 05:22:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-11-10 05:22:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1283 transitions. [2018-11-10 05:22:37,721 INFO L728 BuchiCegarLoop]: Abstraction has 699 states and 1283 transitions. [2018-11-10 05:22:37,721 INFO L608 BuchiCegarLoop]: Abstraction has 699 states and 1283 transitions. [2018-11-10 05:22:37,721 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:22:37,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 699 states and 1283 transitions. [2018-11-10 05:22:37,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 155 [2018-11-10 05:22:37,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:22:37,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:22:37,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:22:37,730 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] [2018-11-10 05:22:37,731 INFO L793 eck$LassoCheckResult]: Stem: 2067#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p15~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p25~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p35~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~p45~0 := 0;~p51~0 := 0;~p52~0 := 0;~p53~0 := 0;~p54~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 1968#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, 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~nondet57, main_#t~nondet58, main_#t~nondet59, main_#t~nondet60, main_#t~nondet61, main_#t~nondet62, main_#t~nondet63, main_#t~nondet64, main_#t~nondet65, main_#t~nondet66, main_#t~nondet67, main_#t~nondet68, main_#t~nondet69, main_#t~nondet70, main_#t~nondet71, main_#t~nondet72, main_#t~nondet73, main_#t~nondet74, main_#t~ret75, main_#t~ret76, main_#t~post77, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep13~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep14~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep15~0 := main_#t~nondet23;havoc main_#t~nondet23;~ep21~0 := main_#t~nondet24;havoc main_#t~nondet24;~ep23~0 := main_#t~nondet25;havoc main_#t~nondet25;~ep24~0 := main_#t~nondet26;havoc main_#t~nondet26;~ep25~0 := main_#t~nondet27;havoc main_#t~nondet27;~ep31~0 := main_#t~nondet28;havoc main_#t~nondet28;~ep32~0 := main_#t~nondet29;havoc main_#t~nondet29;~ep34~0 := main_#t~nondet30;havoc main_#t~nondet30;~ep35~0 := main_#t~nondet31;havoc main_#t~nondet31;~ep41~0 := main_#t~nondet32;havoc main_#t~nondet32;~ep42~0 := main_#t~nondet33;havoc main_#t~nondet33;~ep43~0 := main_#t~nondet34;havoc main_#t~nondet34;~ep45~0 := main_#t~nondet35;havoc main_#t~nondet35;~ep51~0 := main_#t~nondet36;havoc main_#t~nondet36;~ep52~0 := main_#t~nondet37;havoc main_#t~nondet37;~ep53~0 := main_#t~nondet38;havoc main_#t~nondet38;~ep54~0 := main_#t~nondet39;havoc main_#t~nondet39;~id1~0 := main_#t~nondet40;havoc main_#t~nondet40;~r1~0 := main_#t~nondet41;havoc main_#t~nondet41;~st1~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl1~0 := main_#t~nondet43;havoc main_#t~nondet43;~m1~0 := main_#t~nondet44;havoc main_#t~nondet44;~max1~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode1~0 := main_#t~nondet46;havoc main_#t~nondet46;~id2~0 := main_#t~nondet47;havoc main_#t~nondet47;~r2~0 := main_#t~nondet48;havoc main_#t~nondet48;~st2~0 := main_#t~nondet49;havoc main_#t~nondet49;~nl2~0 := main_#t~nondet50;havoc main_#t~nondet50;~m2~0 := main_#t~nondet51;havoc main_#t~nondet51;~max2~0 := main_#t~nondet52;havoc main_#t~nondet52;~mode2~0 := main_#t~nondet53;havoc main_#t~nondet53;~id3~0 := main_#t~nondet54;havoc main_#t~nondet54;~r3~0 := main_#t~nondet55;havoc main_#t~nondet55;~st3~0 := main_#t~nondet56;havoc main_#t~nondet56;~nl3~0 := main_#t~nondet57;havoc main_#t~nondet57;~m3~0 := main_#t~nondet58;havoc main_#t~nondet58;~max3~0 := main_#t~nondet59;havoc main_#t~nondet59;~mode3~0 := main_#t~nondet60;havoc main_#t~nondet60;~id4~0 := main_#t~nondet61;havoc main_#t~nondet61;~r4~0 := main_#t~nondet62;havoc main_#t~nondet62;~st4~0 := main_#t~nondet63;havoc main_#t~nondet63;~nl4~0 := main_#t~nondet64;havoc main_#t~nondet64;~m4~0 := main_#t~nondet65;havoc main_#t~nondet65;~max4~0 := main_#t~nondet66;havoc main_#t~nondet66;~mode4~0 := main_#t~nondet67;havoc main_#t~nondet67;~id5~0 := main_#t~nondet68;havoc main_#t~nondet68;~r5~0 := main_#t~nondet69;havoc main_#t~nondet69;~st5~0 := main_#t~nondet70;havoc main_#t~nondet70;~nl5~0 := main_#t~nondet71;havoc main_#t~nondet71;~m5~0 := main_#t~nondet72;havoc main_#t~nondet72;~max5~0 := main_#t~nondet73;havoc main_#t~nondet73;~mode5~0 := main_#t~nondet74;havoc main_#t~nondet74;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r151~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r251~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r351~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r451~0, init_~r511~0, init_~r521~0, init_~r531~0, init_~r541~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r152~0, init_~tmp___2~0, init_~r212~0, init_~tmp___3~0, init_~r232~0, init_~tmp___4~0, init_~r242~0, init_~tmp___5~0, init_~r252~0, init_~tmp___6~0, init_~r312~0, init_~tmp___7~0, init_~r322~0, init_~tmp___8~0, init_~r342~0, init_~tmp___9~0, init_~r352~0, init_~tmp___10~0, init_~r412~0, init_~tmp___11~0, init_~r422~0, init_~tmp___12~0, init_~r432~0, init_~tmp___13~0, init_~r452~0, init_~tmp___14~0, init_~r512~0, init_~tmp___15~0, init_~r522~0, init_~tmp___16~0, init_~r532~0, init_~tmp___17~0, init_~r542~0, init_~tmp___18~0, init_~r123~0, init_~tmp___19~0, init_~r133~0, init_~tmp___20~0, init_~r143~0, init_~tmp___21~0, init_~r153~0, init_~tmp___22~0, init_~r213~0, init_~tmp___23~0, init_~r233~0, init_~tmp___24~0, init_~r243~0, init_~tmp___25~0, init_~r253~0, init_~tmp___26~0, init_~r313~0, init_~tmp___27~0, init_~r323~0, init_~tmp___28~0, init_~r343~0, init_~tmp___29~0, init_~r353~0, init_~tmp___30~0, init_~r413~0, init_~tmp___31~0, init_~r423~0, init_~tmp___32~0, init_~r433~0, init_~tmp___33~0, init_~r453~0, init_~tmp___34~0, init_~r513~0, init_~tmp___35~0, init_~r523~0, init_~tmp___36~0, init_~r533~0, init_~tmp___37~0, init_~r543~0, init_~tmp___38~0, init_~r124~0, init_~tmp___39~0, init_~r134~0, init_~tmp___40~0, init_~r144~0, init_~tmp___41~0, init_~r154~0, init_~tmp___42~0, init_~r214~0, init_~tmp___43~0, init_~r234~0, init_~tmp___44~0, init_~r244~0, init_~tmp___45~0, init_~r254~0, init_~tmp___46~0, init_~r314~0, init_~tmp___47~0, init_~r324~0, init_~tmp___48~0, init_~r344~0, init_~tmp___49~0, init_~r354~0, init_~tmp___50~0, init_~r414~0, init_~tmp___51~0, init_~r424~0, init_~tmp___52~0, init_~r434~0, init_~tmp___53~0, init_~r454~0, init_~tmp___54~0, init_~r514~0, init_~tmp___55~0, init_~r524~0, init_~tmp___56~0, init_~r534~0, init_~tmp___57~0, init_~r544~0, init_~tmp___58~0, init_~tmp___59~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r151~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r251~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r351~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r451~0;havoc init_~r511~0;havoc init_~r521~0;havoc init_~r531~0;havoc init_~r541~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r152~0;havoc init_~tmp___2~0;havoc init_~r212~0;havoc init_~tmp___3~0;havoc init_~r232~0;havoc init_~tmp___4~0;havoc init_~r242~0;havoc init_~tmp___5~0;havoc init_~r252~0;havoc init_~tmp___6~0;havoc init_~r312~0;havoc init_~tmp___7~0;havoc init_~r322~0;havoc init_~tmp___8~0;havoc init_~r342~0;havoc init_~tmp___9~0;havoc init_~r352~0;havoc init_~tmp___10~0;havoc init_~r412~0;havoc init_~tmp___11~0;havoc init_~r422~0;havoc init_~tmp___12~0;havoc init_~r432~0;havoc init_~tmp___13~0;havoc init_~r452~0;havoc init_~tmp___14~0;havoc init_~r512~0;havoc init_~tmp___15~0;havoc init_~r522~0;havoc init_~tmp___16~0;havoc init_~r532~0;havoc init_~tmp___17~0;havoc init_~r542~0;havoc init_~tmp___18~0;havoc init_~r123~0;havoc init_~tmp___19~0;havoc init_~r133~0;havoc init_~tmp___20~0;havoc init_~r143~0;havoc init_~tmp___21~0;havoc init_~r153~0;havoc init_~tmp___22~0;havoc init_~r213~0;havoc init_~tmp___23~0;havoc init_~r233~0;havoc init_~tmp___24~0;havoc init_~r243~0;havoc init_~tmp___25~0;havoc init_~r253~0;havoc init_~tmp___26~0;havoc init_~r313~0;havoc init_~tmp___27~0;havoc init_~r323~0;havoc init_~tmp___28~0;havoc init_~r343~0;havoc init_~tmp___29~0;havoc init_~r353~0;havoc init_~tmp___30~0;havoc init_~r413~0;havoc init_~tmp___31~0;havoc init_~r423~0;havoc init_~tmp___32~0;havoc init_~r433~0;havoc init_~tmp___33~0;havoc init_~r453~0;havoc init_~tmp___34~0;havoc init_~r513~0;havoc init_~tmp___35~0;havoc init_~r523~0;havoc init_~tmp___36~0;havoc init_~r533~0;havoc init_~tmp___37~0;havoc init_~r543~0;havoc init_~tmp___38~0;havoc init_~r124~0;havoc init_~tmp___39~0;havoc init_~r134~0;havoc init_~tmp___40~0;havoc init_~r144~0;havoc init_~tmp___41~0;havoc init_~r154~0;havoc init_~tmp___42~0;havoc init_~r214~0;havoc init_~tmp___43~0;havoc init_~r234~0;havoc init_~tmp___44~0;havoc init_~r244~0;havoc init_~tmp___45~0;havoc init_~r254~0;havoc init_~tmp___46~0;havoc init_~r314~0;havoc init_~tmp___47~0;havoc init_~r324~0;havoc init_~tmp___48~0;havoc init_~r344~0;havoc init_~tmp___49~0;havoc init_~r354~0;havoc init_~tmp___50~0;havoc init_~r414~0;havoc init_~tmp___51~0;havoc init_~r424~0;havoc init_~tmp___52~0;havoc init_~r434~0;havoc init_~tmp___53~0;havoc init_~r454~0;havoc init_~tmp___54~0;havoc init_~r514~0;havoc init_~tmp___55~0;havoc init_~r524~0;havoc init_~tmp___56~0;havoc init_~r534~0;havoc init_~tmp___57~0;havoc init_~r544~0;havoc init_~tmp___58~0;havoc init_~tmp___59~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r151~0 := ~ep15~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r251~0 := ~ep25~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r351~0 := ~ep35~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0;init_~r451~0 := ~ep45~0;init_~r511~0 := ~ep51~0;init_~r521~0 := ~ep52~0;init_~r531~0 := ~ep53~0;init_~r541~0 := ~ep54~0; 1969#L667 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 1470#L686 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 1593#L696 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 1591#L715 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 2018#L725 assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 1700#L744 init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 1696#L754 assume init_~r151~0 % 256 != 0;init_~tmp___2~0 := 1; 1620#L773 init_~r152~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 1847#L783 assume init_~r211~0 % 256 != 0;init_~tmp___3~0 := 1; 1695#L802 init_~r212~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 2014#L812 assume init_~r231~0 % 256 != 0;init_~tmp___4~0 := 1; 1451#L831 init_~r232~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 1444#L841 assume init_~r241~0 % 256 != 0;init_~tmp___5~0 := 1; 1445#L860 init_~r242~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 1843#L870 assume init_~r251~0 % 256 != 0;init_~tmp___6~0 := 1; 1491#L889 init_~r252~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 2083#L899 assume init_~r311~0 % 256 != 0;init_~tmp___7~0 := 1; 1485#L918 init_~r312~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 1486#L928 assume init_~r321~0 % 256 != 0;init_~tmp___8~0 := 1; 1483#L947 init_~r322~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 2056#L957 assume init_~r341~0 % 256 != 0;init_~tmp___9~0 := 1; 1910#L976 init_~r342~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 2090#L986 assume init_~r351~0 % 256 != 0;init_~tmp___10~0 := 1; 1478#L1005 init_~r352~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 1905#L1015 assume init_~r411~0 % 256 != 0;init_~tmp___11~0 := 1; 1904#L1034 init_~r412~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 1967#L1044 assume init_~r421~0 % 256 != 0;init_~tmp___12~0 := 1; 1736#L1063 init_~r422~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 1730#L1073 assume init_~r431~0 % 256 != 0;init_~tmp___13~0 := 1; 1731#L1092 init_~r432~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 1850#L1102 assume init_~r451~0 % 256 != 0;init_~tmp___14~0 := 1; 1729#L1121 init_~r452~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 2037#L1131 assume init_~r511~0 % 256 != 0;init_~tmp___15~0 := 1; 1500#L1150 init_~r512~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 1501#L1160 assume init_~r521~0 % 256 != 0;init_~tmp___16~0 := 1; 1503#L1179 init_~r522~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 1879#L1189 assume init_~r531~0 % 256 != 0;init_~tmp___17~0 := 1; 1494#L1208 init_~r532~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 2093#L1218 assume init_~r541~0 % 256 != 0;init_~tmp___18~0 := 1; 1540#L1237 init_~r542~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 1541#L1247 assume init_~r122~0 % 256 != 0;init_~tmp___19~0 := 1; 1538#L1266 init_~r123~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 1976#L1276 assume init_~r132~0 % 256 != 0;init_~tmp___20~0 := 1; 1628#L1295 init_~r133~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 1624#L1305 assume init_~r142~0 % 256 != 0;init_~tmp___21~0 := 1; 1528#L1324 init_~r143~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 1808#L1334 assume init_~r152~0 % 256 != 0;init_~tmp___22~0 := 1; 1676#L1353 init_~r153~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 1970#L1363 assume init_~r212~0 % 256 != 0;init_~tmp___23~0 := 1; 1667#L1382 init_~r213~0 := (if init_~tmp___23~0 == 0 then 0 else 1); 1668#L1392 assume init_~r232~0 % 256 != 0;init_~tmp___24~0 := 1; 1658#L1411 init_~r233~0 := (if init_~tmp___24~0 == 0 then 0 else 1); 1793#L1421 assume init_~r242~0 % 256 != 0;init_~tmp___25~0 := 1; 1768#L1440 init_~r243~0 := (if init_~tmp___25~0 == 0 then 0 else 1); 2118#L1450 assume init_~r252~0 % 256 != 0;init_~tmp___26~0 := 1; 1570#L1469 init_~r253~0 := (if init_~tmp___26~0 == 0 then 0 else 1); 1554#L1479 assume init_~r312~0 % 256 != 0;init_~tmp___27~0 := 1; 1555#L1498 init_~r313~0 := (if init_~tmp___27~0 == 0 then 0 else 1); 1902#L1508 assume init_~r322~0 % 256 != 0;init_~tmp___28~0 := 1; 1553#L1527 init_~r323~0 := (if init_~tmp___28~0 == 0 then 0 else 1); 2106#L1537 assume init_~r342~0 % 256 != 0;init_~tmp___29~0 := 1; 1443#L1556 init_~r343~0 := (if init_~tmp___29~0 == 0 then 0 else 1); 1547#L1566 assume init_~r352~0 % 256 != 0;init_~tmp___30~0 := 1; 1604#L1585 init_~r353~0 := (if init_~tmp___30~0 == 0 then 0 else 1); 2010#L1595 assume init_~r412~0 % 256 != 0;init_~tmp___31~0 := 1; 1684#L1614 init_~r413~0 := (if init_~tmp___31~0 == 0 then 0 else 1); 1685#L1624 assume init_~r422~0 % 256 != 0;init_~tmp___32~0 := 1; 1600#L1643 init_~r423~0 := (if init_~tmp___32~0 == 0 then 0 else 1); 1832#L1653 assume init_~r432~0 % 256 != 0;init_~tmp___33~0 := 1; 1679#L1672 init_~r433~0 := (if init_~tmp___33~0 == 0 then 0 else 1); 2008#L1682 assume init_~r452~0 % 256 != 0;init_~tmp___34~0 := 1; 1431#L1701 init_~r453~0 := (if init_~tmp___34~0 == 0 then 0 else 1); 1463#L1711 assume init_~r512~0 % 256 != 0;init_~tmp___35~0 := 1; 1464#L1730 init_~r513~0 := (if init_~tmp___35~0 == 0 then 0 else 1); 1827#L1740 assume init_~r522~0 % 256 != 0;init_~tmp___36~0 := 1; 1468#L1759 init_~r523~0 := (if init_~tmp___36~0 == 0 then 0 else 1); 2123#L1769 assume init_~r532~0 % 256 != 0;init_~tmp___37~0 := 1; 1461#L1788 init_~r533~0 := (if init_~tmp___37~0 == 0 then 0 else 1); 1462#L1798 assume init_~r542~0 % 256 != 0;init_~tmp___38~0 := 1; 1454#L1817 init_~r543~0 := (if init_~tmp___38~0 == 0 then 0 else 1); 2051#L1827 assume init_~r123~0 % 256 != 0;init_~tmp___39~0 := 1; 1614#L1846 init_~r124~0 := (if init_~tmp___39~0 == 0 then 0 else 1); 2084#L1856 assume init_~r133~0 % 256 != 0;init_~tmp___40~0 := 1; 1448#L1875 init_~r134~0 := (if init_~tmp___40~0 == 0 then 0 else 1); 1605#L1885 assume init_~r143~0 % 256 != 0;init_~tmp___41~0 := 1; 1608#L1904 init_~r144~0 := (if init_~tmp___41~0 == 0 then 0 else 1); 2029#L1914 assume init_~r153~0 % 256 != 0;init_~tmp___42~0 := 1; 1717#L1933 init_~r154~0 := (if init_~tmp___42~0 == 0 then 0 else 1); 1710#L1943 assume init_~r213~0 % 256 != 0;init_~tmp___43~0 := 1; 1711#L1962 init_~r214~0 := (if init_~tmp___43~0 == 0 then 0 else 1); 1835#L1972 assume init_~r233~0 % 256 != 0;init_~tmp___44~0 := 1; 1713#L1991 init_~r234~0 := (if init_~tmp___44~0 == 0 then 0 else 1); 2022#L2001 assume init_~r243~0 % 256 != 0;init_~tmp___45~0 := 1; 1475#L2020 init_~r244~0 := (if init_~tmp___45~0 == 0 then 0 else 1); 1471#L2030 assume init_~r253~0 % 256 != 0;init_~tmp___46~0 := 1; 1472#L2049 init_~r254~0 := (if init_~tmp___46~0 == 0 then 0 else 1); 1860#L2059 assume init_~r313~0 % 256 != 0;init_~tmp___47~0 := 1; 1516#L2078 init_~r314~0 := (if init_~tmp___47~0 == 0 then 0 else 1); 2088#L2088 assume init_~r323~0 % 256 != 0;init_~tmp___48~0 := 1; 1507#L2107 init_~r324~0 := (if init_~tmp___48~0 == 0 then 0 else 1); 1508#L2117 assume init_~r343~0 % 256 != 0;init_~tmp___49~0 := 1; 1513#L2136 init_~r344~0 := (if init_~tmp___49~0 == 0 then 0 else 1); 1957#L2146 assume init_~r353~0 % 256 != 0;init_~tmp___50~0 := 1; 1921#L2165 init_~r354~0 := (if init_~tmp___50~0 == 0 then 0 else 1); 1638#L2175 assume init_~r413~0 % 256 != 0;init_~tmp___51~0 := 1; 1497#L2194 init_~r414~0 := (if init_~tmp___51~0 == 0 then 0 else 1); 1917#L2204 assume init_~r423~0 % 256 != 0;init_~tmp___52~0 := 1; 1642#L2223 init_~r424~0 := (if init_~tmp___52~0 == 0 then 0 else 1); 1979#L2233 assume init_~r433~0 % 256 != 0;init_~tmp___53~0 := 1; 1636#L2252 init_~r434~0 := (if init_~tmp___53~0 == 0 then 0 else 1); 1637#L2262 assume init_~r453~0 % 256 != 0;init_~tmp___54~0 := 1; 1629#L2281 init_~r454~0 := (if init_~tmp___54~0 == 0 then 0 else 1); 1867#L2291 assume init_~r513~0 % 256 != 0;init_~tmp___55~0 := 1; 1751#L2310 init_~r514~0 := (if init_~tmp___55~0 == 0 then 0 else 1); 2047#L2320 assume init_~r523~0 % 256 != 0;init_~tmp___56~0 := 1; 1525#L2339 init_~r524~0 := (if init_~tmp___56~0 == 0 then 0 else 1); 1531#L2349 assume init_~r533~0 % 256 != 0;init_~tmp___57~0 := 1; 1532#L2368 init_~r534~0 := (if init_~tmp___57~0 == 0 then 0 else 1); 1896#L2378 assume init_~r543~0 % 256 != 0;init_~tmp___58~0 := 1; 1519#L2397 init_~r544~0 := (if init_~tmp___58~0 == 0 then 0 else 1); 2098#L2407 assume !(~id1~0 != ~id2~0);init_~tmp___59~0 := 0; 1566#L2407-1 init_#res := init_~tmp___59~0; 1687#L2648 main_#t~ret75 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret75;havoc main_#t~ret75;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p15_old~0 := ~nomsg~0;~p15_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p25_old~0 := ~nomsg~0;~p25_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p35_old~0 := ~nomsg~0;~p35_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0 := 0; 1688#L2820-3 [2018-11-10 05:22:37,731 INFO L795 eck$LassoCheckResult]: Loop: 1688#L2820-3 assume true; 1822#L2820-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_#t~ite3; 1823#L190 assume !(~mode1~0 % 256 != 0); 1915#L229 assume !(~r1~0 < 3); 1764#L229-1 ~mode1~0 := 1; 1907#L190-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite4, node2_#t~ite5, node2_#t~ite6, node2_#t~ite7; 1908#L253 assume !(~mode2~0 % 256 != 0); 1673#L292 assume !(~r2~0 < 4); 1660#L292-1 ~mode2~0 := 1; 1669#L253-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8, node3_#t~ite9, node3_#t~ite10, node3_#t~ite11; 2062#L316 assume !(~mode3~0 % 256 != 0); 1927#L355 assume !(~r3~0 < 4); 1928#L355-1 ~mode3~0 := 1; 1778#L316-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite12, node4_#t~ite13, node4_#t~ite14, node4_#t~ite15; 1772#L379 assume !(~mode4~0 % 256 != 0); 1773#L418 assume !(~r4~0 < 4); 2071#L418-1 ~mode4~0 := 1; 1743#L379-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite16, node5_#t~ite17, node5_#t~ite18, node5_#t~ite19; 1744#L442 assume !(~mode5~0 % 256 != 0); 1821#L481 assume !(~r5~0 < 4); 1558#L481-1 ~mode5~0 := 1; 1794#L442-2 assume { :end_inline_node5 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p15_old~0 := ~p15_new~0;~p15_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p25_old~0 := ~p25_new~0;~p25_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p35_old~0 := ~p35_new~0;~p35_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1795#L2656 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 1601#L2657 assume ~st1~0 + ~nl1~0 <= 1; 1432#L2658 assume ~st2~0 + ~nl2~0 <= 1; 1433#L2659 assume ~st3~0 + ~nl3~0 <= 1; 1678#L2660 assume ~st4~0 + ~nl4~0 <= 1; 2105#L2661 assume ~st5~0 + ~nl5~0 <= 1; 2122#L2662 assume ~r1~0 >= 4; 1833#L2666 assume ~r1~0 < 4; 1681#L2671 assume ~r1~0 >= 4; 1898#L2676 assume ~r1~0 < 4;check_~tmp~1 := 1; 1438#L2656-1 check_#res := check_~tmp~1; 1597#L2712 main_#t~ret76 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret76;havoc main_#t~ret76;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1598#L2880 assume !(assert_~arg % 256 == 0); 1842#L2875 assume { :end_inline_assert } true;main_#t~post77 := main_~i2~0;main_~i2~0 := main_#t~post77 + 1;havoc main_#t~post77; 1688#L2820-3 [2018-11-10 05:22:37,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:22:37,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1740203620, now seen corresponding path program 2 times [2018-11-10 05:22:37,732 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:22:37,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:22:37,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:22:37,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:22:37,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:22:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:22:37,864 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-10 05:22:37,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:22:37,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:22:37,865 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:22:37,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:22:37,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1592661646, now seen corresponding path program 1 times [2018-11-10 05:22:37,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:22:37,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:22:37,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:22:37,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:22:37,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:22:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:22:37,893 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-10 05:22:37,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:22:37,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:22:37,894 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:22:37,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:22:37,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:22:37,895 INFO L87 Difference]: Start difference. First operand 699 states and 1283 transitions. cyclomatic complexity: 585 Second operand 3 states. [2018-11-10 05:22:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:22:37,951 INFO L93 Difference]: Finished difference Result 828 states and 1493 transitions. [2018-11-10 05:22:37,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:22:37,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 828 states and 1493 transitions. [2018-11-10 05:22:37,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 284 [2018-11-10 05:22:37,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 828 states to 828 states and 1493 transitions. [2018-11-10 05:22:37,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 828 [2018-11-10 05:22:37,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 828 [2018-11-10 05:22:37,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 828 states and 1493 transitions. [2018-11-10 05:22:37,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:22:37,965 INFO L705 BuchiCegarLoop]: Abstraction has 828 states and 1493 transitions. [2018-11-10 05:22:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states and 1493 transitions. [2018-11-10 05:22:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2018-11-10 05:22:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-11-10 05:22:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1493 transitions. [2018-11-10 05:22:37,978 INFO L728 BuchiCegarLoop]: Abstraction has 828 states and 1493 transitions. [2018-11-10 05:22:37,978 INFO L608 BuchiCegarLoop]: Abstraction has 828 states and 1493 transitions. [2018-11-10 05:22:37,978 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:22:37,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 828 states and 1493 transitions. [2018-11-10 05:22:37,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 284 [2018-11-10 05:22:37,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:22:37,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:22:37,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:22:37,985 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] [2018-11-10 05:22:37,985 INFO L793 eck$LassoCheckResult]: Stem: 3606#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p15~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p25~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p35~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~p45~0 := 0;~p51~0 := 0;~p52~0 := 0;~p53~0 := 0;~p54~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 3506#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, 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~nondet57, main_#t~nondet58, main_#t~nondet59, main_#t~nondet60, main_#t~nondet61, main_#t~nondet62, main_#t~nondet63, main_#t~nondet64, main_#t~nondet65, main_#t~nondet66, main_#t~nondet67, main_#t~nondet68, main_#t~nondet69, main_#t~nondet70, main_#t~nondet71, main_#t~nondet72, main_#t~nondet73, main_#t~nondet74, main_#t~ret75, main_#t~ret76, main_#t~post77, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep13~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep14~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep15~0 := main_#t~nondet23;havoc main_#t~nondet23;~ep21~0 := main_#t~nondet24;havoc main_#t~nondet24;~ep23~0 := main_#t~nondet25;havoc main_#t~nondet25;~ep24~0 := main_#t~nondet26;havoc main_#t~nondet26;~ep25~0 := main_#t~nondet27;havoc main_#t~nondet27;~ep31~0 := main_#t~nondet28;havoc main_#t~nondet28;~ep32~0 := main_#t~nondet29;havoc main_#t~nondet29;~ep34~0 := main_#t~nondet30;havoc main_#t~nondet30;~ep35~0 := main_#t~nondet31;havoc main_#t~nondet31;~ep41~0 := main_#t~nondet32;havoc main_#t~nondet32;~ep42~0 := main_#t~nondet33;havoc main_#t~nondet33;~ep43~0 := main_#t~nondet34;havoc main_#t~nondet34;~ep45~0 := main_#t~nondet35;havoc main_#t~nondet35;~ep51~0 := main_#t~nondet36;havoc main_#t~nondet36;~ep52~0 := main_#t~nondet37;havoc main_#t~nondet37;~ep53~0 := main_#t~nondet38;havoc main_#t~nondet38;~ep54~0 := main_#t~nondet39;havoc main_#t~nondet39;~id1~0 := main_#t~nondet40;havoc main_#t~nondet40;~r1~0 := main_#t~nondet41;havoc main_#t~nondet41;~st1~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl1~0 := main_#t~nondet43;havoc main_#t~nondet43;~m1~0 := main_#t~nondet44;havoc main_#t~nondet44;~max1~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode1~0 := main_#t~nondet46;havoc main_#t~nondet46;~id2~0 := main_#t~nondet47;havoc main_#t~nondet47;~r2~0 := main_#t~nondet48;havoc main_#t~nondet48;~st2~0 := main_#t~nondet49;havoc main_#t~nondet49;~nl2~0 := main_#t~nondet50;havoc main_#t~nondet50;~m2~0 := main_#t~nondet51;havoc main_#t~nondet51;~max2~0 := main_#t~nondet52;havoc main_#t~nondet52;~mode2~0 := main_#t~nondet53;havoc main_#t~nondet53;~id3~0 := main_#t~nondet54;havoc main_#t~nondet54;~r3~0 := main_#t~nondet55;havoc main_#t~nondet55;~st3~0 := main_#t~nondet56;havoc main_#t~nondet56;~nl3~0 := main_#t~nondet57;havoc main_#t~nondet57;~m3~0 := main_#t~nondet58;havoc main_#t~nondet58;~max3~0 := main_#t~nondet59;havoc main_#t~nondet59;~mode3~0 := main_#t~nondet60;havoc main_#t~nondet60;~id4~0 := main_#t~nondet61;havoc main_#t~nondet61;~r4~0 := main_#t~nondet62;havoc main_#t~nondet62;~st4~0 := main_#t~nondet63;havoc main_#t~nondet63;~nl4~0 := main_#t~nondet64;havoc main_#t~nondet64;~m4~0 := main_#t~nondet65;havoc main_#t~nondet65;~max4~0 := main_#t~nondet66;havoc main_#t~nondet66;~mode4~0 := main_#t~nondet67;havoc main_#t~nondet67;~id5~0 := main_#t~nondet68;havoc main_#t~nondet68;~r5~0 := main_#t~nondet69;havoc main_#t~nondet69;~st5~0 := main_#t~nondet70;havoc main_#t~nondet70;~nl5~0 := main_#t~nondet71;havoc main_#t~nondet71;~m5~0 := main_#t~nondet72;havoc main_#t~nondet72;~max5~0 := main_#t~nondet73;havoc main_#t~nondet73;~mode5~0 := main_#t~nondet74;havoc main_#t~nondet74;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r151~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r251~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r351~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r451~0, init_~r511~0, init_~r521~0, init_~r531~0, init_~r541~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r152~0, init_~tmp___2~0, init_~r212~0, init_~tmp___3~0, init_~r232~0, init_~tmp___4~0, init_~r242~0, init_~tmp___5~0, init_~r252~0, init_~tmp___6~0, init_~r312~0, init_~tmp___7~0, init_~r322~0, init_~tmp___8~0, init_~r342~0, init_~tmp___9~0, init_~r352~0, init_~tmp___10~0, init_~r412~0, init_~tmp___11~0, init_~r422~0, init_~tmp___12~0, init_~r432~0, init_~tmp___13~0, init_~r452~0, init_~tmp___14~0, init_~r512~0, init_~tmp___15~0, init_~r522~0, init_~tmp___16~0, init_~r532~0, init_~tmp___17~0, init_~r542~0, init_~tmp___18~0, init_~r123~0, init_~tmp___19~0, init_~r133~0, init_~tmp___20~0, init_~r143~0, init_~tmp___21~0, init_~r153~0, init_~tmp___22~0, init_~r213~0, init_~tmp___23~0, init_~r233~0, init_~tmp___24~0, init_~r243~0, init_~tmp___25~0, init_~r253~0, init_~tmp___26~0, init_~r313~0, init_~tmp___27~0, init_~r323~0, init_~tmp___28~0, init_~r343~0, init_~tmp___29~0, init_~r353~0, init_~tmp___30~0, init_~r413~0, init_~tmp___31~0, init_~r423~0, init_~tmp___32~0, init_~r433~0, init_~tmp___33~0, init_~r453~0, init_~tmp___34~0, init_~r513~0, init_~tmp___35~0, init_~r523~0, init_~tmp___36~0, init_~r533~0, init_~tmp___37~0, init_~r543~0, init_~tmp___38~0, init_~r124~0, init_~tmp___39~0, init_~r134~0, init_~tmp___40~0, init_~r144~0, init_~tmp___41~0, init_~r154~0, init_~tmp___42~0, init_~r214~0, init_~tmp___43~0, init_~r234~0, init_~tmp___44~0, init_~r244~0, init_~tmp___45~0, init_~r254~0, init_~tmp___46~0, init_~r314~0, init_~tmp___47~0, init_~r324~0, init_~tmp___48~0, init_~r344~0, init_~tmp___49~0, init_~r354~0, init_~tmp___50~0, init_~r414~0, init_~tmp___51~0, init_~r424~0, init_~tmp___52~0, init_~r434~0, init_~tmp___53~0, init_~r454~0, init_~tmp___54~0, init_~r514~0, init_~tmp___55~0, init_~r524~0, init_~tmp___56~0, init_~r534~0, init_~tmp___57~0, init_~r544~0, init_~tmp___58~0, init_~tmp___59~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r151~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r251~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r351~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r451~0;havoc init_~r511~0;havoc init_~r521~0;havoc init_~r531~0;havoc init_~r541~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r152~0;havoc init_~tmp___2~0;havoc init_~r212~0;havoc init_~tmp___3~0;havoc init_~r232~0;havoc init_~tmp___4~0;havoc init_~r242~0;havoc init_~tmp___5~0;havoc init_~r252~0;havoc init_~tmp___6~0;havoc init_~r312~0;havoc init_~tmp___7~0;havoc init_~r322~0;havoc init_~tmp___8~0;havoc init_~r342~0;havoc init_~tmp___9~0;havoc init_~r352~0;havoc init_~tmp___10~0;havoc init_~r412~0;havoc init_~tmp___11~0;havoc init_~r422~0;havoc init_~tmp___12~0;havoc init_~r432~0;havoc init_~tmp___13~0;havoc init_~r452~0;havoc init_~tmp___14~0;havoc init_~r512~0;havoc init_~tmp___15~0;havoc init_~r522~0;havoc init_~tmp___16~0;havoc init_~r532~0;havoc init_~tmp___17~0;havoc init_~r542~0;havoc init_~tmp___18~0;havoc init_~r123~0;havoc init_~tmp___19~0;havoc init_~r133~0;havoc init_~tmp___20~0;havoc init_~r143~0;havoc init_~tmp___21~0;havoc init_~r153~0;havoc init_~tmp___22~0;havoc init_~r213~0;havoc init_~tmp___23~0;havoc init_~r233~0;havoc init_~tmp___24~0;havoc init_~r243~0;havoc init_~tmp___25~0;havoc init_~r253~0;havoc init_~tmp___26~0;havoc init_~r313~0;havoc init_~tmp___27~0;havoc init_~r323~0;havoc init_~tmp___28~0;havoc init_~r343~0;havoc init_~tmp___29~0;havoc init_~r353~0;havoc init_~tmp___30~0;havoc init_~r413~0;havoc init_~tmp___31~0;havoc init_~r423~0;havoc init_~tmp___32~0;havoc init_~r433~0;havoc init_~tmp___33~0;havoc init_~r453~0;havoc init_~tmp___34~0;havoc init_~r513~0;havoc init_~tmp___35~0;havoc init_~r523~0;havoc init_~tmp___36~0;havoc init_~r533~0;havoc init_~tmp___37~0;havoc init_~r543~0;havoc init_~tmp___38~0;havoc init_~r124~0;havoc init_~tmp___39~0;havoc init_~r134~0;havoc init_~tmp___40~0;havoc init_~r144~0;havoc init_~tmp___41~0;havoc init_~r154~0;havoc init_~tmp___42~0;havoc init_~r214~0;havoc init_~tmp___43~0;havoc init_~r234~0;havoc init_~tmp___44~0;havoc init_~r244~0;havoc init_~tmp___45~0;havoc init_~r254~0;havoc init_~tmp___46~0;havoc init_~r314~0;havoc init_~tmp___47~0;havoc init_~r324~0;havoc init_~tmp___48~0;havoc init_~r344~0;havoc init_~tmp___49~0;havoc init_~r354~0;havoc init_~tmp___50~0;havoc init_~r414~0;havoc init_~tmp___51~0;havoc init_~r424~0;havoc init_~tmp___52~0;havoc init_~r434~0;havoc init_~tmp___53~0;havoc init_~r454~0;havoc init_~tmp___54~0;havoc init_~r514~0;havoc init_~tmp___55~0;havoc init_~r524~0;havoc init_~tmp___56~0;havoc init_~r534~0;havoc init_~tmp___57~0;havoc init_~r544~0;havoc init_~tmp___58~0;havoc init_~tmp___59~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r151~0 := ~ep15~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r251~0 := ~ep25~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r351~0 := ~ep35~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0;init_~r451~0 := ~ep45~0;init_~r511~0 := ~ep51~0;init_~r521~0 := ~ep52~0;init_~r531~0 := ~ep53~0;init_~r541~0 := ~ep54~0; 3507#L667 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 3005#L686 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 3128#L696 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 3126#L715 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 3556#L725 assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 3235#L744 init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 3231#L754 assume init_~r151~0 % 256 != 0;init_~tmp___2~0 := 1; 3155#L773 init_~r152~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 3383#L783 assume init_~r211~0 % 256 != 0;init_~tmp___3~0 := 1; 3230#L802 init_~r212~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 3552#L812 assume init_~r231~0 % 256 != 0;init_~tmp___4~0 := 1; 2984#L831 init_~r232~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 2979#L841 assume init_~r241~0 % 256 != 0;init_~tmp___5~0 := 1; 2980#L860 init_~r242~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 3378#L870 assume init_~r251~0 % 256 != 0;init_~tmp___6~0 := 1; 3026#L889 init_~r252~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 3623#L899 assume init_~r311~0 % 256 != 0;init_~tmp___7~0 := 1; 3020#L918 init_~r312~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 3021#L928 assume init_~r321~0 % 256 != 0;init_~tmp___8~0 := 1; 3018#L947 init_~r322~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 3595#L957 assume init_~r341~0 % 256 != 0;init_~tmp___9~0 := 1; 3448#L976 init_~r342~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 3630#L986 assume init_~r351~0 % 256 != 0;init_~tmp___10~0 := 1; 3013#L1005 init_~r352~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 3443#L1015 assume init_~r411~0 % 256 != 0;init_~tmp___11~0 := 1; 3442#L1034 init_~r412~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 3505#L1044 assume init_~r421~0 % 256 != 0;init_~tmp___12~0 := 1; 3271#L1063 init_~r422~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 3265#L1073 assume init_~r431~0 % 256 != 0;init_~tmp___13~0 := 1; 3266#L1092 init_~r432~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 3385#L1102 assume init_~r451~0 % 256 != 0;init_~tmp___14~0 := 1; 3264#L1121 init_~r452~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 3576#L1131 assume init_~r511~0 % 256 != 0;init_~tmp___15~0 := 1; 3035#L1150 init_~r512~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 3036#L1160 assume init_~r521~0 % 256 != 0;init_~tmp___16~0 := 1; 3038#L1179 init_~r522~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 3413#L1189 assume init_~r531~0 % 256 != 0;init_~tmp___17~0 := 1; 3029#L1208 init_~r532~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 3633#L1218 assume init_~r541~0 % 256 != 0;init_~tmp___18~0 := 1; 3075#L1237 init_~r542~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 3076#L1247 assume init_~r122~0 % 256 != 0;init_~tmp___19~0 := 1; 3073#L1266 init_~r123~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 3514#L1276 assume init_~r132~0 % 256 != 0;init_~tmp___20~0 := 1; 3163#L1295 init_~r133~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 3157#L1305 assume init_~r142~0 % 256 != 0;init_~tmp___21~0 := 1; 3060#L1324 init_~r143~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 3342#L1334 assume init_~r152~0 % 256 != 0;init_~tmp___22~0 := 1; 3209#L1353 init_~r153~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 3508#L1363 assume init_~r212~0 % 256 != 0;init_~tmp___23~0 := 1; 3196#L1382 init_~r213~0 := (if init_~tmp___23~0 == 0 then 0 else 1); 3197#L1392 assume init_~r232~0 % 256 != 0;init_~tmp___24~0 := 1; 3193#L1411 init_~r233~0 := (if init_~tmp___24~0 == 0 then 0 else 1); 3324#L1421 assume init_~r242~0 % 256 != 0;init_~tmp___25~0 := 1; 3303#L1440 init_~r243~0 := (if init_~tmp___25~0 == 0 then 0 else 1); 3657#L1450 assume init_~r252~0 % 256 != 0;init_~tmp___26~0 := 1; 3105#L1469 init_~r253~0 := (if init_~tmp___26~0 == 0 then 0 else 1); 3089#L1479 assume init_~r312~0 % 256 != 0;init_~tmp___27~0 := 1; 3090#L1498 init_~r313~0 := (if init_~tmp___27~0 == 0 then 0 else 1); 3440#L1508 assume init_~r322~0 % 256 != 0;init_~tmp___28~0 := 1; 3088#L1527 init_~r323~0 := (if init_~tmp___28~0 == 0 then 0 else 1); 3646#L1537 assume init_~r342~0 % 256 != 0;init_~tmp___29~0 := 1; 2978#L1556 init_~r343~0 := (if init_~tmp___29~0 == 0 then 0 else 1); 3080#L1566 assume init_~r352~0 % 256 != 0;init_~tmp___30~0 := 1; 3139#L1585 init_~r353~0 := (if init_~tmp___30~0 == 0 then 0 else 1); 3548#L1595 assume init_~r412~0 % 256 != 0;init_~tmp___31~0 := 1; 3219#L1614 init_~r413~0 := (if init_~tmp___31~0 == 0 then 0 else 1); 3220#L1624 assume init_~r422~0 % 256 != 0;init_~tmp___32~0 := 1; 3135#L1643 init_~r423~0 := (if init_~tmp___32~0 == 0 then 0 else 1); 3368#L1653 assume init_~r432~0 % 256 != 0;init_~tmp___33~0 := 1; 3213#L1672 init_~r433~0 := (if init_~tmp___33~0 == 0 then 0 else 1); 3546#L1682 assume init_~r452~0 % 256 != 0;init_~tmp___34~0 := 1; 2966#L1701 init_~r453~0 := (if init_~tmp___34~0 == 0 then 0 else 1); 2998#L1711 assume init_~r512~0 % 256 != 0;init_~tmp___35~0 := 1; 2999#L1730 init_~r513~0 := (if init_~tmp___35~0 == 0 then 0 else 1); 3362#L1740 assume init_~r522~0 % 256 != 0;init_~tmp___36~0 := 1; 3003#L1759 init_~r523~0 := (if init_~tmp___36~0 == 0 then 0 else 1); 3663#L1769 assume init_~r532~0 % 256 != 0;init_~tmp___37~0 := 1; 2996#L1788 init_~r533~0 := (if init_~tmp___37~0 == 0 then 0 else 1); 2997#L1798 assume init_~r542~0 % 256 != 0;init_~tmp___38~0 := 1; 2989#L1817 init_~r543~0 := (if init_~tmp___38~0 == 0 then 0 else 1); 3590#L1827 assume init_~r123~0 % 256 != 0;init_~tmp___39~0 := 1; 3149#L1846 init_~r124~0 := (if init_~tmp___39~0 == 0 then 0 else 1); 3625#L1856 assume init_~r133~0 % 256 != 0;init_~tmp___40~0 := 1; 2986#L1875 init_~r134~0 := (if init_~tmp___40~0 == 0 then 0 else 1); 3141#L1885 assume init_~r143~0 % 256 != 0;init_~tmp___41~0 := 1; 3146#L1904 init_~r144~0 := (if init_~tmp___41~0 == 0 then 0 else 1); 3567#L1914 assume init_~r153~0 % 256 != 0;init_~tmp___42~0 := 1; 3252#L1933 init_~r154~0 := (if init_~tmp___42~0 == 0 then 0 else 1); 3245#L1943 assume init_~r213~0 % 256 != 0;init_~tmp___43~0 := 1; 3246#L1962 init_~r214~0 := (if init_~tmp___43~0 == 0 then 0 else 1); 3371#L1972 assume init_~r233~0 % 256 != 0;init_~tmp___44~0 := 1; 3248#L1991 init_~r234~0 := (if init_~tmp___44~0 == 0 then 0 else 1); 3562#L2001 assume init_~r243~0 % 256 != 0;init_~tmp___45~0 := 1; 3010#L2020 init_~r244~0 := (if init_~tmp___45~0 == 0 then 0 else 1); 3006#L2030 assume init_~r253~0 % 256 != 0;init_~tmp___46~0 := 1; 3007#L2049 init_~r254~0 := (if init_~tmp___46~0 == 0 then 0 else 1); 3397#L2059 assume init_~r313~0 % 256 != 0;init_~tmp___47~0 := 1; 3051#L2078 init_~r314~0 := (if init_~tmp___47~0 == 0 then 0 else 1); 3628#L2088 assume init_~r323~0 % 256 != 0;init_~tmp___48~0 := 1; 3042#L2107 init_~r324~0 := (if init_~tmp___48~0 == 0 then 0 else 1); 3043#L2117 assume init_~r343~0 % 256 != 0;init_~tmp___49~0 := 1; 3048#L2136 init_~r344~0 := (if init_~tmp___49~0 == 0 then 0 else 1); 3495#L2146 assume init_~r353~0 % 256 != 0;init_~tmp___50~0 := 1; 3459#L2165 init_~r354~0 := (if init_~tmp___50~0 == 0 then 0 else 1); 3173#L2175 assume init_~r413~0 % 256 != 0;init_~tmp___51~0 := 1; 3032#L2194 init_~r414~0 := (if init_~tmp___51~0 == 0 then 0 else 1); 3455#L2204 assume init_~r423~0 % 256 != 0;init_~tmp___52~0 := 1; 3177#L2223 init_~r424~0 := (if init_~tmp___52~0 == 0 then 0 else 1); 3517#L2233 assume init_~r433~0 % 256 != 0;init_~tmp___53~0 := 1; 3171#L2252 init_~r434~0 := (if init_~tmp___53~0 == 0 then 0 else 1); 3172#L2262 assume init_~r453~0 % 256 != 0;init_~tmp___54~0 := 1; 3164#L2281 init_~r454~0 := (if init_~tmp___54~0 == 0 then 0 else 1); 3404#L2291 assume init_~r513~0 % 256 != 0;init_~tmp___55~0 := 1; 3286#L2310 init_~r514~0 := (if init_~tmp___55~0 == 0 then 0 else 1); 3586#L2320 assume init_~r523~0 % 256 != 0;init_~tmp___56~0 := 1; 3062#L2339 init_~r524~0 := (if init_~tmp___56~0 == 0 then 0 else 1); 3066#L2349 assume init_~r533~0 % 256 != 0;init_~tmp___57~0 := 1; 3067#L2368 init_~r534~0 := (if init_~tmp___57~0 == 0 then 0 else 1); 3433#L2378 assume init_~r543~0 % 256 != 0;init_~tmp___58~0 := 1; 3054#L2397 init_~r544~0 := (if init_~tmp___58~0 == 0 then 0 else 1); 3638#L2407 assume !(~id1~0 != ~id2~0);init_~tmp___59~0 := 0; 3101#L2407-1 init_#res := init_~tmp___59~0; 3222#L2648 main_#t~ret75 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret75;havoc main_#t~ret75;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p15_old~0 := ~nomsg~0;~p15_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p25_old~0 := ~nomsg~0;~p25_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p35_old~0 := ~nomsg~0;~p35_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0 := 0; 3223#L2820-3 [2018-11-10 05:22:37,986 INFO L795 eck$LassoCheckResult]: Loop: 3223#L2820-3 assume true; 3751#L2820-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_#t~ite3; 3750#L190 assume !(~mode1~0 % 256 != 0); 3745#L229 assume !(~r1~0 < 3); 3299#L229-1 ~mode1~0 := 1; 3744#L190-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite4, node2_#t~ite5, node2_#t~ite6, node2_#t~ite7; 3742#L253 assume !(~mode2~0 % 256 != 0); 3743#L292 assume !(~r2~0 < 4); 3727#L292-1 ~mode2~0 := 1; 3724#L253-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8, node3_#t~ite9, node3_#t~ite10, node3_#t~ite11; 3722#L316 assume !(~mode3~0 % 256 != 0); 3718#L355 assume !(~r3~0 < 4); 3711#L355-1 ~mode3~0 := 1; 3710#L316-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite12, node4_#t~ite13, node4_#t~ite14, node4_#t~ite15; 3708#L379 assume !(~mode4~0 % 256 != 0); 3709#L418 assume !(~r4~0 < 4); 3693#L418-1 ~mode4~0 := 1; 3690#L379-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite16, node5_#t~ite17, node5_#t~ite18, node5_#t~ite19; 3688#L442 assume !(~mode5~0 % 256 != 0); 3684#L481 assume !(~r5~0 < 4); 3677#L481-1 ~mode5~0 := 1; 3676#L442-2 assume { :end_inline_node5 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p15_old~0 := ~p15_new~0;~p15_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p25_old~0 := ~p25_new~0;~p25_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p35_old~0 := ~p35_new~0;~p35_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 3675#L2656 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 3674#L2657 assume ~st1~0 + ~nl1~0 <= 1; 3673#L2658 assume ~st2~0 + ~nl2~0 <= 1; 3672#L2659 assume ~st3~0 + ~nl3~0 <= 1; 3671#L2660 assume ~st4~0 + ~nl4~0 <= 1; 3670#L2661 assume ~st5~0 + ~nl5~0 <= 1; 3669#L2662 assume !(~r1~0 >= 4); 3434#L2665 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 == 0; 3435#L2666 assume ~r1~0 < 4; 3668#L2671 assume !(~r1~0 >= 4); 3613#L2675 assume ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0 + ~nl5~0 == 0; 3614#L2676 assume ~r1~0 < 4;check_~tmp~1 := 1; 3763#L2656-1 check_#res := check_~tmp~1; 3762#L2712 main_#t~ret76 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret76;havoc main_#t~ret76;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 3761#L2880 assume !(assert_~arg % 256 == 0); 3758#L2875 assume { :end_inline_assert } true;main_#t~post77 := main_~i2~0;main_~i2~0 := main_#t~post77 + 1;havoc main_#t~post77; 3223#L2820-3 [2018-11-10 05:22:37,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:22:37,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1740203620, now seen corresponding path program 3 times [2018-11-10 05:22:37,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:22:37,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:22:37,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:22:37,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:22:37,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:22:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:22:38,060 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-10 05:22:38,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:22:38,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:22:38,060 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:22:38,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:22:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash -601063694, now seen corresponding path program 1 times [2018-11-10 05:22:38,061 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:22:38,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:22:38,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:22:38,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:22:38,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:22:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:22:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:22:38,486 WARN L179 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 191 [2018-11-10 05:22:38,631 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2018-11-10 05:22:38,641 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:22:38,642 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:22:38,642 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:22:38,642 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:22:38,642 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:22:38,642 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:22:38,642 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:22:38,642 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:22:38,642 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.5_false-unreach-call.4.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2018-11-10 05:22:38,642 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:22:38,643 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:22:38,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,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-10 05:22:38,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:38,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-10 05:22:39,122 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-10 05:22:39,412 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-10 05:22:39,477 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:22:39,477 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/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-10 05:22:39,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:22:39,488 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47130112-3fc8-4770-828b-52ee81473886/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-10 05:22:39,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:22:39,509 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:22:39,622 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:22:39,624 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:22:39,624 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:22:39,624 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:22:39,624 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:22:39,624 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:22:39,624 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:22:39,624 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:22:39,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:22:39,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.5_false-unreach-call.4.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2018-11-10 05:22:39,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:22:39,624 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:22:39,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,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-10 05:22:39,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,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-10 05:22:39,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,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-10 05:22:39,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-10 05:22:39,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,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-10 05:22:39,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,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-10 05:22:39,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,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-10 05:22:39,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-10 05:22:39,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-10 05:22:39,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,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-10 05:22:39,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-10 05:22:39,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-10 05:22:39,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-10 05:22:39,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-10 05:22:39,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-10 05:22:39,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-10 05:22:39,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-10 05:22:39,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-10 05:22:39,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-10 05:22:39,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-10 05:22:39,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-10 05:22:39,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,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-10 05:22:39,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:22:39,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-10 05:22:40,115 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-10 05:22:40,395 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-10 05:22:40,432 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:22:40,435 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:22:40,436 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-10 05:22:40,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,456 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-10 05:22:40,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:22:40,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:22:40,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,460 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-10 05:22:40,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,463 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-10 05:22:40,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,464 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-10 05:22:40,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,466 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-10 05:22:40,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:22:40,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:22:40,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,471 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-10 05:22:40,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:22:40,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:22:40,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,475 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-10 05:22:40,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,477 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-10 05:22:40,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:22:40,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:22:40,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,482 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-10 05:22:40,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,484 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-10 05:22:40,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,486 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-10 05:22:40,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,489 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-10 05:22:40,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,491 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-10 05:22:40,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,493 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-10 05:22:40,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,495 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-10 05:22:40,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,496 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-10 05:22:40,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:22:40,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:22:40,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,500 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-10 05:22:40,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:22:40,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:22:40,503 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,503 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-10 05:22:40,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:22:40,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:22:40,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,507 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-10 05:22:40,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,509 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-10 05:22:40,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:22:40,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:22:40,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,513 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-10 05:22:40,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,515 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-10 05:22:40,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,517 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-10 05:22:40,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,519 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-10 05:22:40,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,522 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-10 05:22:40,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,524 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-10 05:22:40,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,526 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-10 05:22:40,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,528 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-10 05:22:40,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,531 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-10 05:22:40,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,534 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,534 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-10 05:22:40,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,536 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-10 05:22:40,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,538 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-10 05:22:40,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,540 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-10 05:22:40,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,551 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:22:40,552 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-10 05:22:40,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:22:40,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:22:40,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:22:40,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:22:40,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:22:40,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:22:40,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:22:40,554 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:22:40,556 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:22:40,556 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:22:40,558 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:22:40,558 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:22:40,558 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:22:40,559 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2018-11-10 05:22:40,560 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:22:40,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:22:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:22:40,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:22:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:22:40,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:22:40,819 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-10 05:22:40,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-10 05:22:40,827 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 828 states and 1493 transitions. cyclomatic complexity: 666 Second operand 4 states. [2018-11-10 05:22:40,927 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 828 states and 1493 transitions. cyclomatic complexity: 666. Second operand 4 states. Result 1111 states and 1962 transitions. Complement of second has 6 states. [2018-11-10 05:22:40,928 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-10 05:22:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:22:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1283 transitions. [2018-11-10 05:22:40,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1283 transitions. Stem has 125 letters. Loop has 38 letters. [2018-11-10 05:22:40,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:22:40,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1283 transitions. Stem has 163 letters. Loop has 38 letters. [2018-11-10 05:22:40,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:22:40,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1283 transitions. Stem has 125 letters. Loop has 76 letters. [2018-11-10 05:22:40,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:22:40,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1111 states and 1962 transitions. [2018-11-10 05:22:40,944 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:22:40,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1111 states to 0 states and 0 transitions. [2018-11-10 05:22:40,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:22:40,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:22:40,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:22:40,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:22:40,944 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:22:40,945 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:22:40,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:22:40,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:22:40,945 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2018-11-10 05:22:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:22:40,945 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 05:22:40,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 05:22:40,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 05:22:40,945 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:22:40,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 05:22:40,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:22:40,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:22:40,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:22:40,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:22:40,946 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:22:40,946 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:22:40,946 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:22:40,946 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:22:40,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:22:40,946 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:22:40,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:22:40,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:22:40 BoogieIcfgContainer [2018-11-10 05:22:40,960 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:22:40,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:22:40,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:22:40,961 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:22:40,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:22:36" (3/4) ... [2018-11-10 05:22:40,964 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:22:40,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:22:40,964 INFO L168 Benchmark]: Toolchain (without parser) took 5823.72 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.5 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -263.3 MB). Peak memory consumption was 71.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:22:40,965 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:22:40,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.11 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 900.1 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2018-11-10 05:22:40,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 900.1 MB in the beginning and 1.1 GB in the end (delta: -235.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:22:40,966 INFO L168 Benchmark]: Boogie Preprocessor took 63.09 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:22:40,966 INFO L168 Benchmark]: RCFGBuilder took 1269.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.5 MB in the end (delta: 216.3 MB). Peak memory consumption was 216.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:22:40,967 INFO L168 Benchmark]: BuchiAutomizer took 3993.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 911.5 MB in the beginning and 1.2 GB in the end (delta: -302.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:22:40,967 INFO L168 Benchmark]: Witness Printer took 3.26 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:22:40,970 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.11 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 900.1 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 900.1 MB in the beginning and 1.1 GB in the end (delta: -235.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.09 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1269.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.5 MB in the end (delta: 216.3 MB). Peak memory consumption was 216.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3993.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 911.5 MB in the beginning and 1.2 GB in the end (delta: -302.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.26 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 828 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4056 SDtfs, 1755 SDslu, 5393 SDs, 0 SdLazy, 36 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital255 mio100 ax123 hnf104 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq231 hnf85 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...