./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/diff-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/diff-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 4654dbed0e523ad65784c661074162c44d8abe4e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 21:25:30,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:25:30,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:25:30,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:25:30,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:25:30,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:25:30,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:25:30,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:25:30,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:25:30,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:25:30,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:25:30,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:25:30,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:25:30,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:25:30,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:25:30,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:25:30,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:25:30,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:25:30,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:25:30,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:25:30,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:25:30,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:25:30,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:25:30,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:25:30,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:25:30,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:25:30,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:25:30,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:25:30,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:25:30,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:25:30,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:25:30,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:25:30,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:25:30,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:25:30,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:25:30,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:25:30,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:25:30,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:25:30,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:25:30,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:25:30,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:25:30,724 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:25:30,742 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:25:30,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:25:30,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:25:30,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:25:30,744 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:25:30,744 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:25:30,745 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:25:30,745 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:25:30,745 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:25:30,746 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:25:30,746 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:25:30,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:25:30,746 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:25:30,747 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:25:30,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:25:30,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:25:30,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:25:30,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:25:30,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:25:30,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:25:30,749 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:25:30,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:25:30,749 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:25:30,750 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:25:30,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:25:30,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:25:30,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:25:30,751 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:25:30,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:25:30,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:25:30,752 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:25:30,752 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:25:30,753 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:25:30,753 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 4654dbed0e523ad65784c661074162c44d8abe4e [2019-11-28 21:25:31,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:25:31,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:25:31,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:25:31,077 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:25:31,078 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:25:31,079 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2019-11-28 21:25:31,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c4e702a/1cbe70f4e22142adb8563cc872b9a99a/FLAG4ed22a2fc [2019-11-28 21:25:31,646 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:25:31,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2019-11-28 21:25:31,662 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c4e702a/1cbe70f4e22142adb8563cc872b9a99a/FLAG4ed22a2fc [2019-11-28 21:25:31,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c4e702a/1cbe70f4e22142adb8563cc872b9a99a [2019-11-28 21:25:31,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:25:31,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:25:31,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:25:31,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:25:31,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:25:31,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:25:31" (1/1) ... [2019-11-28 21:25:31,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51abed86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:31, skipping insertion in model container [2019-11-28 21:25:31,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:25:31" (1/1) ... [2019-11-28 21:25:31,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:25:32,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:25:32,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:25:32,429 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:25:32,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:25:32,536 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:25:32,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32 WrapperNode [2019-11-28 21:25:32,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:25:32,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:25:32,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:25:32,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:25:32,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:25:32,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:25:32,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:25:32,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:25:32,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... [2019-11-28 21:25:32,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:25:32,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:25:32,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:25:32,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:25:32,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 21:25:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 21:25:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 21:25:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:25:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 21:25:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:25:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:25:33,109 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:25:33,109 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-28 21:25:33,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:33 BoogieIcfgContainer [2019-11-28 21:25:33,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:25:33,112 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:25:33,112 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:25:33,117 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:25:33,118 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:33,119 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:25:31" (1/3) ... [2019-11-28 21:25:33,120 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c619cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:25:33, skipping insertion in model container [2019-11-28 21:25:33,120 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:33,121 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:32" (2/3) ... [2019-11-28 21:25:33,121 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c619cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:25:33, skipping insertion in model container [2019-11-28 21:25:33,121 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:33,122 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:33" (3/3) ... [2019-11-28 21:25:33,124 INFO L371 chiAutomizerObserver]: Analyzing ICFG diff-alloca-2.i [2019-11-28 21:25:33,175 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:25:33,175 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:25:33,176 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:25:33,176 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:25:33,176 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:25:33,176 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:25:33,177 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:25:33,177 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:25:33,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 21:25:33,216 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 21:25:33,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:33,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:33,222 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:25:33,222 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:33,223 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:25:33,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 21:25:33,225 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 21:25:33,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:33,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:33,226 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:25:33,226 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:33,235 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#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_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, 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; 18#L539true assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 3#L539-2true assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 14#L542-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 5#L549-3true [2019-11-28 21:25:33,235 INFO L796 eck$LassoCheckResult]: Loop: 5#L549-3true assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 4#L549-2true main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 5#L549-3true [2019-11-28 21:25:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:33,243 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-28 21:25:33,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:33,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988568401] [2019-11-28 21:25:33,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:33,475 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:33,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:33,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-28 21:25:33,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:33,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145704706] [2019-11-28 21:25:33,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:33,501 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:33,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-28 21:25:33,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:33,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292138820] [2019-11-28 21:25:33,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:33,566 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:34,073 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-11-28 21:25:34,227 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-28 21:25:34,244 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:34,245 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:34,245 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:34,245 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:34,246 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:34,246 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:34,246 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:34,246 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:34,247 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration1_Lasso [2019-11-28 21:25:34,247 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:34,247 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:34,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:34,598 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-28 21:25:35,046 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:35,052 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:35,070 INFO L120 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 [2019-11-28 21:25:35,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:35,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:35,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:35,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:35,118 INFO L120 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 [2019-11-28 21:25:35,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:35,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:35,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,151 INFO L120 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 [2019-11-28 21:25:35,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:35,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:35,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:35,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,172 INFO L120 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 [2019-11-28 21:25:35,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:35,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:35,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,199 INFO L120 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 [2019-11-28 21:25:35,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:35,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:35,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,217 INFO L120 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 [2019-11-28 21:25:35,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:35,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:35,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,254 INFO L120 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 [2019-11-28 21:25:35,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:35,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:35,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:35,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:35,278 INFO L120 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 [2019-11-28 21:25:35,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:35,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:35,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:35,319 INFO L120 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 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:35,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:35,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:35,356 INFO L120 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 [2019-11-28 21:25:35,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:35,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:35,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:35,381 INFO L120 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 [2019-11-28 21:25:35,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:35,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:35,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,406 INFO L120 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 [2019-11-28 21:25:35,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:35,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:35,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,431 INFO L120 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 [2019-11-28 21:25:35,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:35,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:35,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:35,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:35,458 INFO L120 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 [2019-11-28 21:25:35,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:35,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:35,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,475 INFO L120 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 [2019-11-28 21:25:35,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:35,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:35,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:35,516 INFO L120 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 [2019-11-28 21:25:35,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:35,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:35,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:35,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:35,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:35,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,555 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:35,698 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-28 21:25:35,698 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:35,768 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:35,772 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:35,772 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:35,773 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~Alen~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~Alen~0 Supporting invariants [] [2019-11-28 21:25:35,809 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2019-11-28 21:25:35,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:35,883 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:25:35,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:35,899 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:25:35,900 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:35,933 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 [2019-11-28 21:25:35,934 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 3 states. [2019-11-28 21:25:35,998 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 3 states. Result 48 states and 75 transitions. Complement of second has 7 states. [2019-11-28 21:25:36,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:25:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2019-11-28 21:25:36,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 21:25:36,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:36,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 21:25:36,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:36,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 21:25:36,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:36,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 75 transitions. [2019-11-28 21:25:36,026 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 21:25:36,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 17 states and 25 transitions. [2019-11-28 21:25:36,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 21:25:36,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 21:25:36,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2019-11-28 21:25:36,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:36,037 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 21:25:36,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2019-11-28 21:25:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 21:25:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:25:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-11-28 21:25:36,072 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 21:25:36,072 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 21:25:36,072 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:25:36,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-11-28 21:25:36,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 21:25:36,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:36,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:36,078 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:36,079 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:36,079 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 165#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_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, 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; 166#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 156#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 157#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 160#L549-3 assume !(main_~i~1 < main_~Alen~0); 161#L549-4 main_~i~2 := 0; 162#L554-3 [2019-11-28 21:25:36,079 INFO L796 eck$LassoCheckResult]: Loop: 162#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 170#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 162#L554-3 [2019-11-28 21:25:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:36,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-28 21:25:36,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:36,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335803183] [2019-11-28 21:25:36,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:36,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335803183] [2019-11-28 21:25:36,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:36,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:25:36,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926161250] [2019-11-28 21:25:36,212 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:36,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:36,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-28 21:25:36,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:36,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855757289] [2019-11-28 21:25:36,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:36,246 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:36,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:36,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:25:36,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:25:36,282 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 21:25:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:36,311 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2019-11-28 21:25:36,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:25:36,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2019-11-28 21:25:36,314 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 21:25:36,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2019-11-28 21:25:36,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 21:25:36,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 21:25:36,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-28 21:25:36,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:36,315 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 21:25:36,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-28 21:25:36,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 21:25:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:25:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-28 21:25:36,318 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 21:25:36,318 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 21:25:36,319 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:25:36,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-28 21:25:36,319 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 21:25:36,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:36,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:36,320 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:36,321 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:36,321 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 207#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_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, 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; 208#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 198#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 199#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 202#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 200#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 201#L549-3 assume !(main_~i~1 < main_~Alen~0); 203#L549-4 main_~i~2 := 0; 204#L554-3 [2019-11-28 21:25:36,321 INFO L796 eck$LassoCheckResult]: Loop: 204#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 211#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 204#L554-3 [2019-11-28 21:25:36,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:36,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2019-11-28 21:25:36,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:36,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25633268] [2019-11-28 21:25:36,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:36,354 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:36,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2019-11-28 21:25:36,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:36,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543556635] [2019-11-28 21:25:36,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:36,366 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:36,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:36,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2019-11-28 21:25:36,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:36,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538512052] [2019-11-28 21:25:36,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:36,447 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:36,801 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-11-28 21:25:36,937 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-28 21:25:36,940 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:36,940 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:36,940 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:36,940 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:36,940 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:36,940 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:36,941 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:36,941 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:36,941 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration3_Lasso [2019-11-28 21:25:36,941 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:36,941 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:36,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:36,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:36,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:36,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:36,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:36,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:37,214 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-28 21:25:37,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:37,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:37,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:37,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:37,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:37,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:37,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:37,429 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-28 21:25:37,739 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:37,739 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:37,748 INFO L120 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 [2019-11-28 21:25:37,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:37,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:37,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:37,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:37,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:37,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:37,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:37,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:37,757 INFO L120 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 [2019-11-28 21:25:37,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:37,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:37,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:37,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:37,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:37,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:37,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:37,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:37,766 INFO L120 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 [2019-11-28 21:25:37,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:37,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:37,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:37,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:37,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:37,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:37,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:37,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:37,789 INFO L120 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 [2019-11-28 21:25:37,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:37,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:37,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:37,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:37,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:37,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:37,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:37,814 INFO L120 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 [2019-11-28 21:25:37,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:37,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:37,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:37,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:37,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:37,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:37,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:37,841 INFO L120 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 [2019-11-28 21:25:37,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:37,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:37,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:37,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:37,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:37,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:37,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:37,861 INFO L120 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 [2019-11-28 21:25:37,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:37,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:37,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:37,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:37,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:37,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:37,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:37,886 INFO L120 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 [2019-11-28 21:25:37,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:37,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:37,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:37,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:37,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:37,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:37,918 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:37,958 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2019-11-28 21:25:37,958 INFO L444 ModelExtractionUtils]: 22 out of 40 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:37,963 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:37,966 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 21:25:37,967 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:37,967 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2, ULTIMATE.start_main_~i~2) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 - 2*ULTIMATE.start_main_~i~2 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 - 2*ULTIMATE.start_main_~Blen~0 >= 0] [2019-11-28 21:25:38,015 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-11-28 21:25:38,018 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:25:38,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:38,067 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 21:25:38,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:38,103 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_77|], 2=[|v_#valid_100|]} [2019-11-28 21:25:38,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 21:25:38,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 21:25:38,144 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:38,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 38 [2019-11-28 21:25:38,146 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:38,188 INFO L614 ElimStorePlain]: treesize reduction 12, result has 77.4 percent of original size [2019-11-28 21:25:38,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-28 21:25:38,205 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:38,223 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:38,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:25:38,237 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 21:25:38,237 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:45 [2019-11-28 21:25:38,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:25:38,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:25:38,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:25:38,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 21:25:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:38,407 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 21:25:38,407 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:38,438 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-28 21:25:38,438 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 21:25:38,518 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 25 states and 39 transitions. Complement of second has 8 states. [2019-11-28 21:25:38,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:38,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 21:25:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2019-11-28 21:25:38,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-28 21:25:38,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:38,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-28 21:25:38,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:38,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 21:25:38,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:38,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2019-11-28 21:25:38,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:25:38,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2019-11-28 21:25:38,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 21:25:38,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 21:25:38,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-28 21:25:38,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:38,525 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 21:25:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-28 21:25:38,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 21:25:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 21:25:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-28 21:25:38,527 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 21:25:38,528 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 21:25:38,528 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:25:38,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-28 21:25:38,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:25:38,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:38,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:38,530 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:38,530 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 21:25:38,531 INFO L794 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 376#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_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, 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; 377#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 367#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 368#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 371#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 369#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 370#L549-3 assume !(main_~i~1 < main_~Alen~0); 372#L549-4 main_~i~2 := 0; 373#L554-3 assume !(main_~i~2 < main_~Blen~0); 383#L554-4 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; 384#L519-2 [2019-11-28 21:25:38,531 INFO L796 eck$LassoCheckResult]: Loop: 384#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 375#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 378#L522-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; 382#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 384#L519-2 [2019-11-28 21:25:38,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:38,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-28 21:25:38,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:38,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384088336] [2019-11-28 21:25:38,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:25:38,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384088336] [2019-11-28 21:25:38,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:38,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:25:38,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59755126] [2019-11-28 21:25:38,595 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:38,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 1 times [2019-11-28 21:25:38,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:38,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33709174] [2019-11-28 21:25:38,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,609 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:38,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:38,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:25:38,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:25:38,740 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 21:25:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:38,768 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-11-28 21:25:38,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:25:38,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-28 21:25:38,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:25:38,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2019-11-28 21:25:38,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 21:25:38,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 21:25:38,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-11-28 21:25:38,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:38,771 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-28 21:25:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-11-28 21:25:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-28 21:25:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 21:25:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-28 21:25:38,774 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 21:25:38,774 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 21:25:38,774 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:25:38,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-28 21:25:38,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 21:25:38,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:38,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:38,776 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:38,776 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 21:25:38,776 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 420#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_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, 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; 421#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 411#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 412#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 415#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 413#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 414#L549-3 assume !(main_~i~1 < main_~Alen~0); 416#L549-4 main_~i~2 := 0; 417#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 424#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 425#L554-3 assume !(main_~i~2 < main_~Blen~0); 427#L554-4 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; 428#L519-2 [2019-11-28 21:25:38,776 INFO L796 eck$LassoCheckResult]: Loop: 428#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 419#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 422#L522-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; 426#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 428#L519-2 [2019-11-28 21:25:38,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:38,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-28 21:25:38,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:38,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873704204] [2019-11-28 21:25:38,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,816 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:38,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 2 times [2019-11-28 21:25:38,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:38,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261060971] [2019-11-28 21:25:38,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:38,829 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:38,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:38,830 INFO L82 PathProgramCache]: Analyzing trace with hash -796463931, now seen corresponding path program 1 times [2019-11-28 21:25:38,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:38,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92298416] [2019-11-28 21:25:38,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 21:25:38,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92298416] [2019-11-28 21:25:38,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:38,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:25:38,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108748864] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 21:25:38,998 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-28 21:25:39,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:39,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 21:25:39,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 21:25:39,034 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 21:25:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:39,090 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2019-11-28 21:25:39,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:25:39,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2019-11-28 21:25:39,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 21:25:39,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 28 transitions. [2019-11-28 21:25:39,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 21:25:39,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 21:25:39,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-11-28 21:25:39,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:39,094 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-28 21:25:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-11-28 21:25:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-28 21:25:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 21:25:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-11-28 21:25:39,098 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-28 21:25:39,098 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-28 21:25:39,098 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:25:39,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-11-28 21:25:39,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 21:25:39,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:39,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:39,100 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:39,100 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:25:39,100 INFO L794 eck$LassoCheckResult]: Stem: 475#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 472#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_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, 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; 473#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 463#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 464#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 467#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 465#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 466#L549-3 assume !(main_~i~1 < main_~Alen~0); 468#L549-4 main_~i~2 := 0; 469#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 476#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 477#L554-3 assume !(main_~i~2 < main_~Blen~0); 480#L554-4 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; 481#L519-2 [2019-11-28 21:25:39,101 INFO L796 eck$LassoCheckResult]: Loop: 481#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 474#L523-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); 470#L523 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 471#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 478#L522-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; 479#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 481#L519-2 [2019-11-28 21:25:39,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 2 times [2019-11-28 21:25:39,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:39,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174853239] [2019-11-28 21:25:39,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:39,136 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:39,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:39,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1860447319, now seen corresponding path program 1 times [2019-11-28 21:25:39,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:39,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705236277] [2019-11-28 21:25:39,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:39,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705236277] [2019-11-28 21:25:39,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:39,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:25:39,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311766363] [2019-11-28 21:25:39,178 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:25:39,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:39,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:25:39,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:25:39,178 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-28 21:25:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:39,211 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-11-28 21:25:39,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:25:39,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2019-11-28 21:25:39,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 21:25:39,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2019-11-28 21:25:39,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-28 21:25:39,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 21:25:39,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2019-11-28 21:25:39,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:39,214 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-28 21:25:39,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2019-11-28 21:25:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-11-28 21:25:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 21:25:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-11-28 21:25:39,219 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 21:25:39,219 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 21:25:39,219 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 21:25:39,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-11-28 21:25:39,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 21:25:39,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:39,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:39,222 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:39,223 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:25:39,223 INFO L794 eck$LassoCheckResult]: Stem: 527#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 524#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_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, 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; 525#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 514#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 515#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 518#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 516#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 517#L549-3 assume !(main_~i~1 < main_~Alen~0); 519#L549-4 main_~i~2 := 0; 520#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 528#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 529#L554-3 assume !(main_~i~2 < main_~Blen~0); 531#L554-4 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; 532#L519-2 [2019-11-28 21:25:39,223 INFO L796 eck$LassoCheckResult]: Loop: 532#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 533#L523-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); 521#L523 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 522#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 526#L522-2 assume !(0 == diff_~found~0); 530#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 532#L519-2 [2019-11-28 21:25:39,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:39,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 3 times [2019-11-28 21:25:39,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:39,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105009119] [2019-11-28 21:25:39,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:39,279 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:39,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:39,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1860447257, now seen corresponding path program 1 times [2019-11-28 21:25:39,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:39,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784773104] [2019-11-28 21:25:39,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:39,290 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:39,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:39,291 INFO L82 PathProgramCache]: Analyzing trace with hash -896094976, now seen corresponding path program 1 times [2019-11-28 21:25:39,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:39,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107635373] [2019-11-28 21:25:39,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:39,333 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:40,009 WARN L192 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 138 [2019-11-28 21:25:40,224 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-11-28 21:25:40,226 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:40,226 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:40,227 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:40,227 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:40,227 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:40,227 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:40,227 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:40,227 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:40,227 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration7_Lasso [2019-11-28 21:25:40,227 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:40,227 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:40,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,843 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 107 [2019-11-28 21:25:40,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:40,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:41,339 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-11-28 21:25:41,787 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 21:25:42,015 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:42,016 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:42,026 INFO L120 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 [2019-11-28 21:25:42,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:42,037 INFO L120 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 [2019-11-28 21:25:42,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:42,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:42,051 INFO L120 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 [2019-11-28 21:25:42,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:42,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:42,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:42,063 INFO L120 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 [2019-11-28 21:25:42,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:42,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:42,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:42,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:42,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:42,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,118 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:42,157 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-28 21:25:42,157 INFO L444 ModelExtractionUtils]: 64 out of 76 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:42,161 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:25:42,164 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:42,164 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:42,164 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2019-11-28 21:25:42,249 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2019-11-28 21:25:42,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:42,283 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:25:42,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:42,298 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:25:42,299 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:25:42,310 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 [2019-11-28 21:25:42,310 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 21:25:42,331 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 40 transitions. Complement of second has 4 states. [2019-11-28 21:25:42,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:25:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2019-11-28 21:25:42,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-28 21:25:42,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:42,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-28 21:25:42,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:42,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 12 letters. [2019-11-28 21:25:42,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:42,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2019-11-28 21:25:42,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:42,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2019-11-28 21:25:42,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 21:25:42,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 21:25:42,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-11-28 21:25:42,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:25:42,337 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 21:25:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-11-28 21:25:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-28 21:25:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 21:25:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-28 21:25:42,344 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-28 21:25:42,344 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-28 21:25:42,344 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 21:25:42,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-28 21:25:42,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:42,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:42,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:42,349 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:42,350 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:42,350 INFO L794 eck$LassoCheckResult]: Stem: 740#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 737#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_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, 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; 738#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 725#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 726#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 729#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 727#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 728#L549-3 assume !(main_~i~1 < main_~Alen~0); 730#L549-4 main_~i~2 := 0; 731#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 743#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 744#L554-3 assume !(main_~i~2 < main_~Blen~0); 745#L554-4 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; 746#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 733#L523-2 [2019-11-28 21:25:42,350 INFO L796 eck$LassoCheckResult]: Loop: 733#L523-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); 732#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 733#L523-2 [2019-11-28 21:25:42,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:42,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1313217434, now seen corresponding path program 1 times [2019-11-28 21:25:42,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:42,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058452154] [2019-11-28 21:25:42,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:42,412 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 1 times [2019-11-28 21:25:42,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:42,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097430816] [2019-11-28 21:25:42,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:42,428 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash -718428993, now seen corresponding path program 1 times [2019-11-28 21:25:42,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:42,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266146915] [2019-11-28 21:25:42,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:42,482 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:43,174 WARN L192 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 144 [2019-11-28 21:25:43,396 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-11-28 21:25:43,398 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:43,399 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:43,399 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:43,399 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:43,399 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:43,399 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:43,399 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:43,399 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:43,399 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration8_Lasso [2019-11-28 21:25:43,399 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:43,399 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:43,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:43,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:44,098 WARN L192 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 120 [2019-11-28 21:25:44,241 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-28 21:25:44,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:44,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:44,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:44,854 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-11-28 21:25:45,294 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-28 21:25:45,353 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:45,353 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,357 INFO L120 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 [2019-11-28 21:25:45,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,399 INFO L120 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 [2019-11-28 21:25:45,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,412 INFO L120 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 [2019-11-28 21:25:45,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:45,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,425 INFO L120 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 [2019-11-28 21:25:45,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:45,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,433 INFO L120 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 [2019-11-28 21:25:45,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,448 INFO L120 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 [2019-11-28 21:25:45,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:45,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,467 INFO L120 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 [2019-11-28 21:25:45,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:45,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:45,490 INFO L120 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 [2019-11-28 21:25:45,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:45,509 INFO L120 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 [2019-11-28 21:25:45,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:45,528 INFO L120 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 [2019-11-28 21:25:45,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:45,541 INFO L120 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 [2019-11-28 21:25:45,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:45,556 INFO L120 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 [2019-11-28 21:25:45,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:45,568 INFO L120 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 [2019-11-28 21:25:45,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,579 INFO L120 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 [2019-11-28 21:25:45,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,593 INFO L120 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 [2019-11-28 21:25:45,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,607 INFO L120 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 [2019-11-28 21:25:45,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:45,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,616 INFO L120 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 [2019-11-28 21:25:45,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:45,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,626 INFO L120 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 [2019-11-28 21:25:45,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:45,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,637 INFO L120 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 [2019-11-28 21:25:45,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:45,674 INFO L120 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 [2019-11-28 21:25:45,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,688 INFO L120 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 [2019-11-28 21:25:45,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,689 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:25:45,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,696 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-28 21:25:45,696 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-28 21:25:45,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,716 INFO L120 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 [2019-11-28 21:25:45,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,731 INFO L120 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 [2019-11-28 21:25:45,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,744 INFO L120 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 [2019-11-28 21:25:45,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:45,761 INFO L120 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 Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,811 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:45,928 INFO L443 ModelExtractionUtils]: Simplification made 37 calls to the SMT solver. [2019-11-28 21:25:45,928 INFO L444 ModelExtractionUtils]: 12 out of 82 variables were initially zero. Simplification set additionally 67 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,935 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:25:45,937 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:45,938 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:45,938 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~j~0, ULTIMATE.start_diff_~l2~0) = -1*ULTIMATE.start_diff_~j~0 + 1*ULTIMATE.start_diff_~l2~0 Supporting invariants [] [2019-11-28 21:25:46,068 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2019-11-28 21:25:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:46,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:25:46,104 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:46,110 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:25:46,110 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:46,122 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 [2019-11-28 21:25:46,122 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 21:25:46,145 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 46 states and 63 transitions. Complement of second has 7 states. [2019-11-28 21:25:46,146 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 [2019-11-28 21:25:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:25:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-11-28 21:25:46,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-28 21:25:46,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:46,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-28 21:25:46,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:46,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-28 21:25:46,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:46,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-11-28 21:25:46,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:46,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 35 states and 49 transitions. [2019-11-28 21:25:46,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 21:25:46,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 21:25:46,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2019-11-28 21:25:46,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:25:46,152 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2019-11-28 21:25:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2019-11-28 21:25:46,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-11-28 21:25:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 21:25:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-11-28 21:25:46,156 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-28 21:25:46,156 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-28 21:25:46,156 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 21:25:46,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-11-28 21:25:46,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:46,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:46,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:46,158 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:46,158 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:46,158 INFO L794 eck$LassoCheckResult]: Stem: 986#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 982#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_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, 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; 983#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 971#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 972#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 975#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 973#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 974#L549-3 assume !(main_~i~1 < main_~Alen~0); 976#L549-4 main_~i~2 := 0; 977#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 988#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 989#L554-3 assume !(main_~i~2 < main_~Blen~0); 990#L554-4 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; 991#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 993#L523-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); 980#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 981#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 996#L522-2 assume !(0 == diff_~found~0); 987#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 992#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 979#L523-2 [2019-11-28 21:25:46,159 INFO L796 eck$LassoCheckResult]: Loop: 979#L523-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); 978#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 979#L523-2 [2019-11-28 21:25:46,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2007293386, now seen corresponding path program 1 times [2019-11-28 21:25:46,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:46,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374123091] [2019-11-28 21:25:46,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 21:25:46,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374123091] [2019-11-28 21:25:46,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:46,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:25:46,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515479313] [2019-11-28 21:25:46,199 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:46,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 2 times [2019-11-28 21:25:46,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:46,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858220095] [2019-11-28 21:25:46,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,210 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:46,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:46,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:25:46,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:25:46,278 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-11-28 21:25:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:46,292 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2019-11-28 21:25:46,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:25:46,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2019-11-28 21:25:46,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:46,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 41 transitions. [2019-11-28 21:25:46,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 21:25:46,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 21:25:46,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2019-11-28 21:25:46,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:25:46,298 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-11-28 21:25:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2019-11-28 21:25:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-11-28 21:25:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 21:25:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-28 21:25:46,304 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-28 21:25:46,305 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-28 21:25:46,305 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 21:25:46,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2019-11-28 21:25:46,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:46,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:46,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:46,307 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:46,307 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:46,308 INFO L794 eck$LassoCheckResult]: Stem: 1050#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1046#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_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, 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; 1047#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1035#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1036#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 1039#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1037#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1038#L549-3 assume !(main_~i~1 < main_~Alen~0); 1040#L549-4 main_~i~2 := 0; 1041#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 1053#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1054#L554-3 assume !(main_~i~2 < main_~Blen~0); 1055#L554-4 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; 1056#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1058#L523-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); 1044#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1045#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1060#L522-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; 1052#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1057#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1043#L523-2 [2019-11-28 21:25:46,308 INFO L796 eck$LassoCheckResult]: Loop: 1043#L523-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); 1042#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1043#L523-2 [2019-11-28 21:25:46,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2007295308, now seen corresponding path program 1 times [2019-11-28 21:25:46,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:46,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112587918] [2019-11-28 21:25:46,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 21:25:46,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112587918] [2019-11-28 21:25:46,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986237881] [2019-11-28 21:25:46,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:25:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:46,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 21:25:46,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 21:25:46,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:25:46,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-11-28 21:25:46,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069603654] [2019-11-28 21:25:46,543 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:46,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 3 times [2019-11-28 21:25:46,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:46,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636336037] [2019-11-28 21:25:46,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,552 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:46,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:46,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 21:25:46,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-28 21:25:46,608 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 15 Second operand 14 states. [2019-11-28 21:25:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:46,795 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2019-11-28 21:25:46,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 21:25:46,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 67 transitions. [2019-11-28 21:25:46,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:46,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 31 states and 40 transitions. [2019-11-28 21:25:46,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 21:25:46,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 21:25:46,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-11-28 21:25:46,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:25:46,799 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-28 21:25:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-11-28 21:25:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-28 21:25:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 21:25:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-11-28 21:25:46,802 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-28 21:25:46,803 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-28 21:25:46,803 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 21:25:46,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-11-28 21:25:46,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:25:46,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:46,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:46,804 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:46,805 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:46,805 INFO L794 eck$LassoCheckResult]: Stem: 1212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1208#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_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, 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; 1209#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1196#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1197#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 1200#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1198#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1199#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1201#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1221#L549-3 assume !(main_~i~1 < main_~Alen~0); 1202#L549-4 main_~i~2 := 0; 1203#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 1213#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1214#L554-3 assume !(main_~i~2 < main_~Blen~0); 1217#L554-4 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; 1218#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1220#L523-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); 1206#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1207#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1222#L522-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; 1216#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1219#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1205#L523-2 [2019-11-28 21:25:46,805 INFO L796 eck$LassoCheckResult]: Loop: 1205#L523-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); 1204#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1205#L523-2 [2019-11-28 21:25:46,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,806 INFO L82 PathProgramCache]: Analyzing trace with hash 633938194, now seen corresponding path program 2 times [2019-11-28 21:25:46,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:46,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790134210] [2019-11-28 21:25:46,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,842 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:46,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 4 times [2019-11-28 21:25:46,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:46,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444525723] [2019-11-28 21:25:46,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,851 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:46,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash -670749641, now seen corresponding path program 3 times [2019-11-28 21:25:46,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:46,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295003187] [2019-11-28 21:25:46,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,896 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:48,175 WARN L192 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 253 DAG size of output: 196 [2019-11-28 21:25:48,605 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-11-28 21:25:48,610 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:48,610 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:48,610 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:48,610 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:48,610 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:48,610 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:48,610 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:48,610 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:48,611 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration11_Lasso [2019-11-28 21:25:48,611 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:48,611 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:48,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,869 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 21:25:48,872 INFO L168 Benchmark]: Toolchain (without parser) took 16927.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 385.4 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 506.1 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:48,873 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:25:48,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:48,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:48,875 INFO L168 Benchmark]: Boogie Preprocessor took 38.38 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. [2019-11-28 21:25:48,876 INFO L168 Benchmark]: RCFGBuilder took 483.06 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:48,876 INFO L168 Benchmark]: BuchiAutomizer took 15759.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.7 MB). Peak memory consumption was 500.0 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:48,879 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 590.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.38 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 483.06 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15759.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.7 MB). Peak memory consumption was 500.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...