./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/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 986c31897144a5b76f321e97eaa1d3383cce25ed ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 10:33:30,746 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:33:30,747 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:33:30,753 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:33:30,753 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:33:30,754 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:33:30,755 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:33:30,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:33:30,757 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:33:30,758 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:33:30,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:33:30,758 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:33:30,759 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:33:30,760 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:33:30,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:33:30,761 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:33:30,762 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:33:30,763 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:33:30,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:33:30,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:33:30,766 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:33:30,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:33:30,769 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:33:30,769 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:33:30,769 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:33:30,770 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:33:30,771 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:33:30,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:33:30,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:33:30,772 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:33:30,773 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:33:30,773 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:33:30,773 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:33:30,773 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:33:30,774 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:33:30,775 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:33:30,775 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 10:33:30,786 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:33:30,786 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:33:30,787 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:33:30,787 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:33:30,787 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:33:30,788 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 10:33:30,788 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 10:33:30,788 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 10:33:30,788 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 10:33:30,788 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 10:33:30,788 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 10:33:30,788 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:33:30,789 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:33:30,789 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:33:30,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:33:30,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:33:30,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:33:30,789 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 10:33:30,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 10:33:30,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 10:33:30,790 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:33:30,790 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:33:30,790 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 10:33:30,790 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:33:30,791 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 10:33:30,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:33:30,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:33:30,791 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 10:33:30,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:33:30,791 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:33:30,792 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 10:33:30,792 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 10:33:30,793 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_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/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 -> 986c31897144a5b76f321e97eaa1d3383cce25ed [2018-11-28 10:33:30,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:33:30,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:33:30,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:33:30,830 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:33:30,830 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:33:30,830 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-11-28 10:33:30,873 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/bin-2019/uautomizer/data/1b4ad2071/dad9f657c2fd4a4bbf211f88603ddb56/FLAG458d9e14f [2018-11-28 10:33:31,299 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:33:31,300 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-11-28 10:33:31,306 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/bin-2019/uautomizer/data/1b4ad2071/dad9f657c2fd4a4bbf211f88603ddb56/FLAG458d9e14f [2018-11-28 10:33:31,316 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/bin-2019/uautomizer/data/1b4ad2071/dad9f657c2fd4a4bbf211f88603ddb56 [2018-11-28 10:33:31,318 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:33:31,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:33:31,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:31,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:33:31,322 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:33:31,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70334e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31, skipping insertion in model container [2018-11-28 10:33:31,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:33:31,353 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:33:31,540 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:31,549 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:33:31,618 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:31,647 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:33:31,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31 WrapperNode [2018-11-28 10:33:31,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:31,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:31,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:33:31,648 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:33:31,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:31,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:33:31,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:33:31,686 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:33:31,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... [2018-11-28 10:33:31,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:33:31,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:33:31,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:33:31,709 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:33:31,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d19ea0e-3fe4-4b41-8ad0-0db604ade21e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:33:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 10:33:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 10:33:31,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 10:33:31,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:33:31,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:33:31,971 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:33:31,971 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 10:33:31,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:31 BoogieIcfgContainer [2018-11-28 10:33:31,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:33:31,972 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 10:33:31,973 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 10:33:31,976 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 10:33:31,977 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:33:31,977 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 10:33:31" (1/3) ... [2018-11-28 10:33:31,978 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4720f3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:33:31, skipping insertion in model container [2018-11-28 10:33:31,978 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:33:31,978 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:31" (2/3) ... [2018-11-28 10:33:31,979 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4720f3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:33:31, skipping insertion in model container [2018-11-28 10:33:31,979 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:33:31,979 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:31" (3/3) ... [2018-11-28 10:33:31,980 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-11-28 10:33:32,030 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:33:32,031 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 10:33:32,031 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 10:33:32,031 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 10:33:32,031 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:33:32,031 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:33:32,031 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 10:33:32,032 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:33:32,032 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 10:33:32,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 10:33:32,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:33:32,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:32,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:32,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:33:32,069 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 10:33:32,070 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 10:33:32,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 10:33:32,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:33:32,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:32,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:32,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:33:32,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 10:33:32,079 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 5#L567true assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 9#L567-2true assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 4#L570-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 7#L547-2true [2018-11-28 10:33:32,079 INFO L796 eck$LassoCheckResult]: Loop: 7#L547-2true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 16#L551-2true assume !true; 3#L550-2true assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 6#L557-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 7#L547-2true [2018-11-28 10:33:32,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,084 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-28 10:33:32,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:32,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2018-11-28 10:33:32,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:32,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:32,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:32,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:33:32,202 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:33:32,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 10:33:32,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 10:33:32,213 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-28 10:33:32,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:32,217 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-11-28 10:33:32,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 10:33:32,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-11-28 10:33:32,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:33:32,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2018-11-28 10:33:32,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 10:33:32,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 10:33:32,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2018-11-28 10:33:32,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:33:32,224 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-28 10:33:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2018-11-28 10:33:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 10:33:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 10:33:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-11-28 10:33:32,241 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-28 10:33:32,241 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-28 10:33:32,241 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 10:33:32,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2018-11-28 10:33:32,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 10:33:32,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:32,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:32,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:33:32,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 10:33:32,243 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 39#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 43#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 40#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 41#L547-2 [2018-11-28 10:33:32,243 INFO L796 eck$LassoCheckResult]: Loop: 41#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 45#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 36#L550-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 37#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 41#L547-2 [2018-11-28 10:33:32,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,243 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-28 10:33:32,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:32,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2018-11-28 10:33:32,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:32,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2018-11-28 10:33:32,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:32,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:32,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:32,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:33:32,464 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-11-28 10:33:32,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:33:32,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:33:32,497 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-28 10:33:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:32,535 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2018-11-28 10:33:32,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:33:32,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2018-11-28 10:33:32,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 10:33:32,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2018-11-28 10:33:32,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 10:33:32,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 10:33:32,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2018-11-28 10:33:32,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:33:32,538 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-28 10:33:32,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2018-11-28 10:33:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-28 10:33:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 10:33:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-11-28 10:33:32,540 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 10:33:32,540 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 10:33:32,540 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 10:33:32,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-11-28 10:33:32,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 10:33:32,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:32,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:32,541 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:33:32,541 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 10:33:32,541 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 75#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 81#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 76#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 77#L547-2 [2018-11-28 10:33:32,541 INFO L796 eck$LassoCheckResult]: Loop: 77#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 82#L551-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 79#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 80#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 72#L550-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 73#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 77#L547-2 [2018-11-28 10:33:32,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,541 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2018-11-28 10:33:32,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:32,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2018-11-28 10:33:32,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:32,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:32,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:32,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:33:32,577 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:33:32,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:33:32,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:33:32,577 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 10:33:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:32,601 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-11-28 10:33:32,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 10:33:32,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-28 10:33:32,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 10:33:32,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-11-28 10:33:32,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 10:33:32,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 10:33:32,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-28 10:33:32,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:33:32,603 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-28 10:33:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-28 10:33:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-11-28 10:33:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 10:33:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-11-28 10:33:32,604 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-28 10:33:32,604 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-28 10:33:32,604 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 10:33:32,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-11-28 10:33:32,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 10:33:32,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:32,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:32,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:33:32,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 10:33:32,605 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 109#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 110#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 117#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 111#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 112#L547-2 [2018-11-28 10:33:32,605 INFO L796 eck$LassoCheckResult]: Loop: 112#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 118#L551-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 114#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 115#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 107#L550-2 assume !(0 == diff_~found~0); 108#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 112#L547-2 [2018-11-28 10:33:32,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,605 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2018-11-28 10:33:32,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:32,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2018-11-28 10:33:32,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:32,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2018-11-28 10:33:32,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:32,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:32,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:32,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:32,957 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-28 10:33:33,070 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-11-28 10:33:33,078 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:33,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:33,078 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:33,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:33,078 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:33:33,079 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:33,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:33,079 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:33,079 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-28 10:33:33,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:33,079 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:33,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,341 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2018-11-28 10:33:33,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:33,735 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:33,739 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:33:33,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,785 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:33:33,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,788 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:33:33,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,824 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:33:33,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,826 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:33:33,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,859 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:33:33,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,860 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:33:33,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:33,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:33,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:33,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:33,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:33,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:33,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:33,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:33,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:33,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:33,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:33,893 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:33:33,927 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 10:33:33,927 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 10:33:33,929 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:33:33,930 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:33:33,931 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:33:33,931 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, v_rep(select #length ULTIMATE.start_diff_~A.base)_1, ULTIMATE.start_diff_~A.offset) = -4*ULTIMATE.start_diff_~i~0 + 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_1 - 1*ULTIMATE.start_diff_~A.offset Supporting invariants [] [2018-11-28 10:33:33,973 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-28 10:33:33,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 10:33:33,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:34,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:34,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:34,053 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:33:34,054 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 10:33:34,091 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 30 transitions. Complement of second has 6 states. [2018-11-28 10:33:34,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:33:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 10:33:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 10:33:34,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-28 10:33:34,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:34,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 10:33:34,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:34,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 12 letters. [2018-11-28 10:33:34,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:34,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2018-11-28 10:33:34,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:33:34,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2018-11-28 10:33:34,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 10:33:34,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 10:33:34,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-11-28 10:33:34,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:33:34,095 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-28 10:33:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-11-28 10:33:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-28 10:33:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 10:33:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-11-28 10:33:34,096 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-11-28 10:33:34,096 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-11-28 10:33:34,096 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 10:33:34,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2018-11-28 10:33:34,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:33:34,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:34,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:34,097 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 10:33:34,097 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 10:33:34,097 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 258#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 264#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 261#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 262#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 266#L551-2 [2018-11-28 10:33:34,097 INFO L796 eck$LassoCheckResult]: Loop: 266#L551-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 265#L551 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 266#L551-2 [2018-11-28 10:33:34,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:34,097 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2018-11-28 10:33:34,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:34,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:34,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:34,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:34,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:34,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2018-11-28 10:33:34,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:34,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:34,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:34,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:34,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:34,116 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2018-11-28 10:33:34,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:34,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:34,392 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2018-11-28 10:33:34,498 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-28 10:33:34,500 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:34,500 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:34,500 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:34,500 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:34,500 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:33:34,500 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:34,500 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:34,500 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:34,500 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-28 10:33:34,500 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:34,501 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:34,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,725 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2018-11-28 10:33:34,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:34,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:35,110 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:35,110 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:33:35,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:35,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:35,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:35,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:35,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:35,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:35,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:35,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:35,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:35,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:35,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:35,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:35,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:35,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:35,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:35,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:35,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:35,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:35,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:35,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:35,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:35,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:35,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:35,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:35,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:35,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:35,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:35,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:35,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:35,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:35,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:35,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:35,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:35,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:35,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:35,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:35,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:35,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:35,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:35,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:35,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:35,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:35,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:35,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:35,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:35,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:35,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:35,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:35,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:35,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:35,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:35,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:35,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:35,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:35,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:35,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:35,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:35,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:35,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:35,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:35,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:35,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:35,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:35,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:35,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:35,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:35,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:35,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:35,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:35,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:35,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:35,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:35,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:35,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:35,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:35,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:35,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:35,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:35,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:35,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:35,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:35,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:35,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:35,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:35,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:35,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:35,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:35,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:35,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:35,139 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:33:35,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:35,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:35,148 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:33:35,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:35,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:35,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:35,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:35,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:35,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:35,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:35,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:35,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:35,188 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:33:35,237 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 10:33:35,237 INFO L444 ModelExtractionUtils]: 65 out of 73 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 10:33:35,237 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:33:35,238 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:33:35,239 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:33:35,239 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~B.offset, ULTIMATE.start_diff_~j~0, v_rep(select #length ULTIMATE.start_diff_~B.base)_2) = -1*ULTIMATE.start_diff_~B.offset - 4*ULTIMATE.start_diff_~j~0 + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_2 Supporting invariants [] [2018-11-28 10:33:35,302 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-28 10:33:35,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 10:33:35,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:35,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:35,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:35,364 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:33:35,364 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 10:33:35,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2018-11-28 10:33:35,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:33:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:33:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 10:33:35,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 10:33:35,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:35,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 10:33:35,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:35,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 10:33:35,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:35,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2018-11-28 10:33:35,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:33:35,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2018-11-28 10:33:35,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 10:33:35,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 10:33:35,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2018-11-28 10:33:35,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 10:33:35,401 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2018-11-28 10:33:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2018-11-28 10:33:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-11-28 10:33:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 10:33:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-28 10:33:35,403 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-28 10:33:35,403 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-28 10:33:35,403 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 10:33:35,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-28 10:33:35,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 10:33:35,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:35,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:35,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:33:35,410 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 10:33:35,410 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 421#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 422#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 430#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 423#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 424#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 432#L551-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 437#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 434#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 419#L550-2 assume !(0 == diff_~found~0); 420#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 431#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 427#L551-2 [2018-11-28 10:33:35,410 INFO L796 eck$LassoCheckResult]: Loop: 427#L551-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 426#L551 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 427#L551-2 [2018-11-28 10:33:35,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2018-11-28 10:33:35,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:35,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:35,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:35,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:35,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:35,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:35,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2018-11-28 10:33:35,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:35,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:35,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:35,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:35,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2018-11-28 10:33:35,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:35,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:35,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:35,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:33:35,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:35,967 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 140 [2018-11-28 10:33:36,071 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-11-28 10:33:36,072 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:36,073 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:36,073 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:36,073 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:36,073 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:33:36,073 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:36,073 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:36,073 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:36,073 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-28 10:33:36,073 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:36,073 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:36,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,345 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2018-11-28 10:33:36,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:36,753 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:36,754 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:33:36,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:36,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:36,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:36,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:36,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:36,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:36,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:36,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:36,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:36,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:36,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:36,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:36,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:36,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:36,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:36,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:36,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:36,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:36,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:36,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:36,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:36,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:36,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:36,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:36,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:36,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:36,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:36,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:36,764 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:33:36,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:36,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:36,765 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:33:36,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:36,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:36,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:36,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:36,770 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:33:36,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:36,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:36,771 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:33:36,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:36,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:36,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:36,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:36,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:36,776 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 10:33:36,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:36,778 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 10:33:36,779 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 10:33:36,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:36,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:36,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:36,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:36,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:36,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:36,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:36,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:36,811 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:33:36,840 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 10:33:36,841 INFO L444 ModelExtractionUtils]: 63 out of 73 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 10:33:36,841 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:33:36,842 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:33:36,842 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:33:36,842 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-11-28 10:33:36,891 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2018-11-28 10:33:36,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:36,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:36,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:36,927 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:33:36,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 10:33:36,942 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 36 states and 51 transitions. Complement of second has 7 states. [2018-11-28 10:33:36,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:33:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:33:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 10:33:36,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 10:33:36,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:36,944 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 10:33:36,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:36,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:36,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:36,979 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:33:36,979 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 10:33:36,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 36 states and 51 transitions. Complement of second has 7 states. [2018-11-28 10:33:36,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:33:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:33:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 10:33:36,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 10:33:36,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:36,992 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 10:33:37,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:37,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:37,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:33:37,027 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 10:33:37,028 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 10:33:37,044 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 34 states and 51 transitions. Complement of second has 6 states. [2018-11-28 10:33:37,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 10:33:37,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 10:33:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-28 10:33:37,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 10:33:37,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:37,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-28 10:33:37,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:37,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-28 10:33:37,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:37,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 51 transitions. [2018-11-28 10:33:37,048 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:33:37,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2018-11-28 10:33:37,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 10:33:37,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 10:33:37,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 10:33:37,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:33:37,048 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:37,048 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:37,048 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:37,049 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 10:33:37,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 10:33:37,049 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:33:37,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 10:33:37,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 10:33:37 BoogieIcfgContainer [2018-11-28 10:33:37,057 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 10:33:37,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:33:37,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:33:37,058 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:33:37,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:31" (3/4) ... [2018-11-28 10:33:37,061 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 10:33:37,062 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:33:37,062 INFO L168 Benchmark]: Toolchain (without parser) took 5743.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -122.0 MB). Peak memory consumption was 94.5 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:37,063 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:37,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:37,064 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.43 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:37,064 INFO L168 Benchmark]: Boogie Preprocessor took 22.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:37,064 INFO L168 Benchmark]: RCFGBuilder took 263.57 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:37,065 INFO L168 Benchmark]: BuchiAutomizer took 5084.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 106.3 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:37,065 INFO L168 Benchmark]: Witness Printer took 4.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:37,068 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.43 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 263.57 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5084.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 106.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[A] + -1 * A and consists of 4 locations. One deterministic module has affine ranking function -1 * B + -4 * j + unknown-#length-unknown[B] and consists of 4 locations. One nondeterministic module has affine ranking function l2 + -1 * j 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 5.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 113 SDtfs, 127 SDslu, 53 SDs, 0 SdLazy, 70 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital273 mio100 ax100 hnf98 lsp90 ukn87 mio100 lsp53 div100 bol100 ite100 ukn100 eq182 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...