./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/diff-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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-8bd4bc6 [2020-07-29 03:25:41,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:25:41,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:25:41,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:25:41,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:25:41,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:25:41,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:25:41,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:25:41,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:25:41,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:25:41,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:25:41,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:25:41,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:25:41,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:25:41,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:25:41,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:25:41,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:25:41,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:25:41,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:25:41,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:25:41,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:25:41,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:25:41,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:25:41,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:25:41,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:25:41,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:25:41,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:25:41,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:25:41,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:25:41,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:25:41,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:25:41,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:25:41,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:25:41,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:25:41,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:25:41,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:25:41,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:25:41,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:25:41,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:25:41,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:25:41,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:25:41,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:25:41,914 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:25:41,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:25:41,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:25:41,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:25:41,921 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:25:41,921 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:25:41,921 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:25:41,922 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:25:41,922 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:25:41,922 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:25:41,922 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:25:41,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:25:41,923 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:25:41,924 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:25:41,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:25:41,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:25:41,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:25:41,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:25:41,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:25:41,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:25:41,927 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:25:41,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:25:41,927 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:25:41,928 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:25:41,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:25:41,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:25:41,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:25:41,929 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:25:41,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:25:41,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:25:41,930 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:25:41,931 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:25:41,933 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:25:41,934 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 [2020-07-29 03:25:42,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:25:42,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:25:42,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:25:42,297 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:25:42,300 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:25:42,301 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2020-07-29 03:25:42,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06eb15165/b5974f8f913848ad8336323270099f3a/FLAGeccdb0b9e [2020-07-29 03:25:42,858 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:25:42,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2020-07-29 03:25:42,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06eb15165/b5974f8f913848ad8336323270099f3a/FLAGeccdb0b9e [2020-07-29 03:25:43,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06eb15165/b5974f8f913848ad8336323270099f3a [2020-07-29 03:25:43,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:25:43,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:25:43,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:43,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:25:43,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:25:43,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508fcd00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43, skipping insertion in model container [2020-07-29 03:25:43,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:25:43,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:25:43,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:43,664 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:25:43,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:43,799 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:25:43,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43 WrapperNode [2020-07-29 03:25:43,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:43,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:43,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:25:43,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:25:43,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:43,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:25:43,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:25:43,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:25:43,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:25:43,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:25:43,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:25:43,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:25:43,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (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 [2020-07-29 03:25:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:25:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:25:43,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:25:43,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:25:43,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:25:43,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:25:44,525 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:25:44,525 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-29 03:25:44,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:44 BoogieIcfgContainer [2020-07-29 03:25:44,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:25:44,531 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:25:44,531 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:25:44,535 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:25:44,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:44,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:25:43" (1/3) ... [2020-07-29 03:25:44,538 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79de7a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:44, skipping insertion in model container [2020-07-29 03:25:44,538 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:44,538 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (2/3) ... [2020-07-29 03:25:44,539 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79de7a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:44, skipping insertion in model container [2020-07-29 03:25:44,539 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:44,539 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:44" (3/3) ... [2020-07-29 03:25:44,541 INFO L371 chiAutomizerObserver]: Analyzing ICFG diff-alloca-2.i [2020-07-29 03:25:44,598 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:25:44,598 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:25:44,598 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:25:44,599 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:25:44,599 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:25:44,599 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:25:44,600 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:25:44,600 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:25:44,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-29 03:25:44,647 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 03:25:44,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:44,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:44,655 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:25:44,655 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:44,655 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:25:44,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-29 03:25:44,660 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 03:25:44,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:44,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:44,661 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:25:44,661 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:44,670 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 [2020-07-29 03:25:44,671 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 [2020-07-29 03:25:44,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:44,679 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 03:25:44,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:44,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985071501] [2020-07-29 03:25:44,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,795 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,815 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,841 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:44,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:44,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-07-29 03:25:44,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:44,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309567055] [2020-07-29 03:25:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,855 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,862 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,865 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:44,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:44,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-07-29 03:25:44,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:44,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712690262] [2020-07-29 03:25:44,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,932 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:45,340 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2020-07-29 03:25:45,541 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-07-29 03:25:45,559 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:45,560 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:45,560 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:45,560 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:45,561 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:45,561 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:45,562 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:45,562 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:45,562 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration1_Lasso [2020-07-29 03:25:45,562 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:45,563 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:45,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,950 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-07-29 03:25:46,820 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:46,827 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) [2020-07-29 03:25:46,844 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 [2020-07-29 03:25:46,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:46,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:46,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:46,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:46,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:46,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:46,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:46,862 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:46,955 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 [2020-07-29 03:25:46,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:46,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:46,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:46,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:46,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:46,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:46,963 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 [2020-07-29 03:25:46,969 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) [2020-07-29 03:25:47,004 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 [2020-07-29 03:25:47,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:47,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:47,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,010 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) [2020-07-29 03:25:47,049 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 [2020-07-29 03:25:47,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:47,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,059 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) [2020-07-29 03:25:47,096 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 [2020-07-29 03:25:47,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:47,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,106 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 [2020-07-29 03:25:47,144 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 [2020-07-29 03:25:47,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:47,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:47,155 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 [2020-07-29 03:25:47,182 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 [2020-07-29 03:25:47,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:47,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:47,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:47,187 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,216 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 [2020-07-29 03:25:47,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:47,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:47,226 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,255 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 [2020-07-29 03:25:47,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:47,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:47,271 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,321 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 [2020-07-29 03:25:47,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:47,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:47,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:47,330 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,388 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 [2020-07-29 03:25:47,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:47,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:47,398 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) [2020-07-29 03:25:47,445 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 [2020-07-29 03:25:47,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:47,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:47,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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 [2020-07-29 03:25:47,485 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 [2020-07-29 03:25:47,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:47,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:47,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:47,491 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,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 [2020-07-29 03:25:47,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:47,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:47,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:47,524 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 [2020-07-29 03:25:47,558 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 [2020-07-29 03:25:47,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:47,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:47,575 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,609 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 [2020-07-29 03:25:47,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:47,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:47,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:47,838 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-07-29 03:25:47,838 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 19 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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,845 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:47,853 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:47,854 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:47,855 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1, ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~A~0.offset) = 2*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 - 4*ULTIMATE.start_main_~i~1 - 1*ULTIMATE.start_main_~A~0.offset Supporting invariants [] [2020-07-29 03:25:47,938 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2020-07-29 03:25:47,946 INFO L393 LassoCheck]: Loop: "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;" "main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13;" [2020-07-29 03:25:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:47,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:25:48,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:48,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:48,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:48,064 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {30#unseeded} is VALID [2020-07-29 03:25:48,064 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#unseeded} 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; {30#unseeded} is VALID [2020-07-29 03:25:48,065 INFO L280 TraceCheckUtils]: 2: Hoare triple {30#unseeded} assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); {30#unseeded} is VALID [2020-07-29 03:25:48,066 INFO L280 TraceCheckUtils]: 3: Hoare triple {30#unseeded} assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); {30#unseeded} is VALID [2020-07-29 03:25:48,067 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#unseeded} 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; {94#(and (= |ULTIMATE.start_main_#t~malloc10.base| ULTIMATE.start_main_~A~0.base) unseeded)} is VALID [2020-07-29 03:25:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:48,081 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:25:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:48,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:48,123 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#(and (>= oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc10.base|)) (* (- 4) ULTIMATE.start_main_~i~1) (* (- 1) ULTIMATE.start_main_~A~0.offset))) (= |ULTIMATE.start_main_#t~malloc10.base| ULTIMATE.start_main_~A~0.base))} 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; {115#(and (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc10.base|)) (+ ULTIMATE.start_main_~A~0.offset oldRank0 (* 4 ULTIMATE.start_main_~i~1))) (<= (+ ULTIMATE.start_main_~A~0.offset (* 4 ULTIMATE.start_main_~i~1) 4) (select |#length| ULTIMATE.start_main_~A~0.base)) (<= 0 (+ ULTIMATE.start_main_~A~0.offset (* 4 ULTIMATE.start_main_~i~1))) (= |ULTIMATE.start_main_#t~malloc10.base| ULTIMATE.start_main_~A~0.base))} is VALID [2020-07-29 03:25:48,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {115#(and (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc10.base|)) (+ ULTIMATE.start_main_~A~0.offset oldRank0 (* 4 ULTIMATE.start_main_~i~1))) (<= (+ ULTIMATE.start_main_~A~0.offset (* 4 ULTIMATE.start_main_~i~1) 4) (select |#length| ULTIMATE.start_main_~A~0.base)) (<= 0 (+ ULTIMATE.start_main_~A~0.offset (* 4 ULTIMATE.start_main_~i~1))) (= |ULTIMATE.start_main_#t~malloc10.base| ULTIMATE.start_main_~A~0.base))} main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; {97#(and (or (and (> oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc10.base|)) (* (- 4) ULTIMATE.start_main_~i~1) (* (- 1) ULTIMATE.start_main_~A~0.offset))) (>= oldRank0 0)) unseeded) (= |ULTIMATE.start_main_#t~malloc10.base| ULTIMATE.start_main_~A~0.base))} is VALID [2020-07-29 03:25:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:48,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:48,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:48,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:48,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,172 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 [2020-07-29 03:25:48,174 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 3 states. [2020-07-29 03:25:48,421 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 3 states. Result 45 states and 72 transitions. Complement of second has 8 states. [2020-07-29 03:25:48,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:48,421 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:48,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-29 03:25:48,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 03:25:48,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:48,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:48,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:48,437 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:48,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:48,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:48,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 72 transitions. [2020-07-29 03:25:48,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:25:48,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:48,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:48,443 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states. [2020-07-29 03:25:48,447 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 03:25:48,451 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 03:25:48,452 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:48,455 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:48,459 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:48,460 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 72 transitions. cyclomatic complexity: 34 [2020-07-29 03:25:48,462 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:25:48,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:48,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:48,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:48,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:48,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:48,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:48,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:48,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:48,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:48,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:25:48,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:25:48,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:25:48,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:48,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:48,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:48,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:48,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:48,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:48,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:48,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:48,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:48,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:48,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:48,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:48,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:48,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:48,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:48,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:48,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:48,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:48,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:48,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:48,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:48,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:48,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:48,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:48,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:48,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:48,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:48,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:48,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:48,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:48,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:48,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:48,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:48,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:48,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:48,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:48,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:48,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:48,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:48,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:48,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:48,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:48,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:48,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:48,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:48,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:48,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:48,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:48,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:48,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:48,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:48,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:48,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:48,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:48,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:48,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:48,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:48,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:48,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:48,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 72 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:48,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,491 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2020-07-29 03:25:48,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:48,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:48,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:25:48,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 72 transitions. cyclomatic complexity: 34 [2020-07-29 03:25:48,500 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:25:48,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 17 states and 25 transitions. [2020-07-29 03:25:48,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 03:25:48,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 03:25:48,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2020-07-29 03:25:48,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:48,507 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-07-29 03:25:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2020-07-29 03:25:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 03:25:48,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:48,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 25 transitions. Second operand 17 states. [2020-07-29 03:25:48,532 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 25 transitions. Second operand 17 states. [2020-07-29 03:25:48,535 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 17 states. [2020-07-29 03:25:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:48,539 INFO L93 Difference]: Finished difference Result 17 states and 25 transitions. [2020-07-29 03:25:48,540 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2020-07-29 03:25:48,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:48,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:48,541 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states and 25 transitions. [2020-07-29 03:25:48,541 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states and 25 transitions. [2020-07-29 03:25:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:48,542 INFO L93 Difference]: Finished difference Result 17 states and 25 transitions. [2020-07-29 03:25:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2020-07-29 03:25:48,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:48,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:48,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:48,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:25:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2020-07-29 03:25:48,546 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-07-29 03:25:48,546 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-07-29 03:25:48,546 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:25:48,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2020-07-29 03:25:48,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:25:48,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:48,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:48,547 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:48,547 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:48,548 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 185#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; 186#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 176#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 177#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; 180#L549-3 assume !(main_~i~1 < main_~Alen~0); 181#L549-4 main_~i~2 := 0; 182#L554-3 [2020-07-29 03:25:48,548 INFO L796 eck$LassoCheckResult]: Loop: 182#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; 190#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 182#L554-3 [2020-07-29 03:25:48,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:48,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-07-29 03:25:48,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:48,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319714640] [2020-07-29 03:25:48,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:48,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {230#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {230#true} is VALID [2020-07-29 03:25:48,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {230#true} 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; {230#true} is VALID [2020-07-29 03:25:48,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {230#true} assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); {232#(<= 1 ULTIMATE.start_main_~Alen~0)} is VALID [2020-07-29 03:25:48,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {232#(<= 1 ULTIMATE.start_main_~Alen~0)} assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); {232#(<= 1 ULTIMATE.start_main_~Alen~0)} is VALID [2020-07-29 03:25:48,621 INFO L280 TraceCheckUtils]: 4: Hoare triple {232#(<= 1 ULTIMATE.start_main_~Alen~0)} 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; {233#(and (= 0 ULTIMATE.start_main_~i~1) (<= 1 ULTIMATE.start_main_~Alen~0))} is VALID [2020-07-29 03:25:48,623 INFO L280 TraceCheckUtils]: 5: Hoare triple {233#(and (= 0 ULTIMATE.start_main_~i~1) (<= 1 ULTIMATE.start_main_~Alen~0))} assume !(main_~i~1 < main_~Alen~0); {231#false} is VALID [2020-07-29 03:25:48,623 INFO L280 TraceCheckUtils]: 6: Hoare triple {231#false} main_~i~2 := 0; {231#false} is VALID [2020-07-29 03:25:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:48,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319714640] [2020-07-29 03:25:48,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:48,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:25:48,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182604319] [2020-07-29 03:25:48,629 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-07-29 03:25:48,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:48,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090247662] [2020-07-29 03:25:48,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:48,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:48,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:48,644 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:48,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:48,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:25:48,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:25:48,686 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 03:25:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:48,764 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 03:25:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:25:48,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:48,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:48,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2020-07-29 03:25:48,777 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:25:48,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2020-07-29 03:25:48,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 03:25:48,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 03:25:48,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-07-29 03:25:48,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:48,778 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 03:25:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-07-29 03:25:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-29 03:25:48,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:48,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand 17 states. [2020-07-29 03:25:48,781 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand 17 states. [2020-07-29 03:25:48,781 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 17 states. [2020-07-29 03:25:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:48,782 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 03:25:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 03:25:48,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:48,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:48,783 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states and 25 transitions. [2020-07-29 03:25:48,783 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states and 25 transitions. [2020-07-29 03:25:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:48,785 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 03:25:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 03:25:48,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:48,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:48,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:48,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:25:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-07-29 03:25:48,787 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 03:25:48,787 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 03:25:48,787 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:25:48,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-07-29 03:25:48,788 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:25:48,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:48,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:48,789 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:48,789 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:48,789 INFO L794 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 263#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; 264#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 254#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 255#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; 258#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; 256#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 257#L549-3 assume !(main_~i~1 < main_~Alen~0); 259#L549-4 main_~i~2 := 0; 260#L554-3 [2020-07-29 03:25:48,790 INFO L796 eck$LassoCheckResult]: Loop: 260#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; 267#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 260#L554-3 [2020-07-29 03:25:48,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:48,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2020-07-29 03:25:48,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:48,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067897401] [2020-07-29 03:25:48,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:48,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:48,824 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:48,833 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:48,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:48,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2020-07-29 03:25:48,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:48,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314618175] [2020-07-29 03:25:48,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:48,846 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:48,856 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:48,859 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2020-07-29 03:25:48,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:48,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286782906] [2020-07-29 03:25:48,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:48,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:48,961 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:48,966 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:49,341 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2020-07-29 03:25:49,545 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-07-29 03:25:49,548 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:49,548 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:49,548 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:49,548 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:49,548 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:49,549 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:49,549 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:49,549 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:49,549 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration3_Lasso [2020-07-29 03:25:49,549 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:49,549 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:49,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:49,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:49,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:49,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:49,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:49,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:49,867 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2020-07-29 03:25:49,900 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:49,901 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:49,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:49,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:49,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:49,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:49,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:49,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:49,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:50,683 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:50,686 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) [2020-07-29 03:25:50,701 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 [2020-07-29 03:25:50,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:50,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:50,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:50,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:50,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:50,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:50,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:50,707 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) [2020-07-29 03:25:50,745 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 [2020-07-29 03:25:50,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:50,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:50,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:50,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:50,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:50,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:50,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:50,750 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 [2020-07-29 03:25:50,787 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 [2020-07-29 03:25:50,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:50,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:50,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:50,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:50,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:50,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:50,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:50,791 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) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:50,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 [2020-07-29 03:25:50,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:50,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:50,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:50,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:50,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:50,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:50,821 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) [2020-07-29 03:25:50,843 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 [2020-07-29 03:25:50,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:50,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:50,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:50,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:50,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:50,851 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 [2020-07-29 03:25:50,857 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 [2020-07-29 03:25:50,889 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 [2020-07-29 03:25:50,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:50,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:50,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:50,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:50,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:50,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:50,914 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:50,953 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-07-29 03:25:50,954 INFO L444 ModelExtractionUtils]: 15 out of 28 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:50,957 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:50,959 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:25:50,959 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:50,960 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 - 4*ULTIMATE.start_main_~i~2 Supporting invariants [1*ULTIMATE.start_main_~B~0.offset >= 0] [2020-07-29 03:25:51,031 INFO L297 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2020-07-29 03:25:51,042 INFO L393 LassoCheck]: Loop: "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;" "main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15;" [2020-07-29 03:25:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:51,046 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:25:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:51,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:25:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:51,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:51,140 INFO L280 TraceCheckUtils]: 0: Hoare triple {316#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {316#unseeded} is VALID [2020-07-29 03:25:51,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {316#unseeded} 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; {316#unseeded} is VALID [2020-07-29 03:25:51,141 INFO L280 TraceCheckUtils]: 2: Hoare triple {316#unseeded} assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); {316#unseeded} is VALID [2020-07-29 03:25:51,141 INFO L280 TraceCheckUtils]: 3: Hoare triple {316#unseeded} assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); {316#unseeded} is VALID [2020-07-29 03:25:51,143 INFO L280 TraceCheckUtils]: 4: Hoare triple {316#unseeded} 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; {391#(and (>= ULTIMATE.start_main_~B~0.offset 0) unseeded (= ULTIMATE.start_main_~B~0.base |ULTIMATE.start_main_#t~malloc11.base|))} is VALID [2020-07-29 03:25:51,143 INFO L280 TraceCheckUtils]: 5: Hoare triple {391#(and (>= ULTIMATE.start_main_~B~0.offset 0) unseeded (= ULTIMATE.start_main_~B~0.base |ULTIMATE.start_main_#t~malloc11.base|))} 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; {391#(and (>= ULTIMATE.start_main_~B~0.offset 0) unseeded (= ULTIMATE.start_main_~B~0.base |ULTIMATE.start_main_#t~malloc11.base|))} is VALID [2020-07-29 03:25:51,144 INFO L280 TraceCheckUtils]: 6: Hoare triple {391#(and (>= ULTIMATE.start_main_~B~0.offset 0) unseeded (= ULTIMATE.start_main_~B~0.base |ULTIMATE.start_main_#t~malloc11.base|))} main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; {391#(and (>= ULTIMATE.start_main_~B~0.offset 0) unseeded (= ULTIMATE.start_main_~B~0.base |ULTIMATE.start_main_#t~malloc11.base|))} is VALID [2020-07-29 03:25:51,145 INFO L280 TraceCheckUtils]: 7: Hoare triple {391#(and (>= ULTIMATE.start_main_~B~0.offset 0) unseeded (= ULTIMATE.start_main_~B~0.base |ULTIMATE.start_main_#t~malloc11.base|))} assume !(main_~i~1 < main_~Alen~0); {391#(and (>= ULTIMATE.start_main_~B~0.offset 0) unseeded (= ULTIMATE.start_main_~B~0.base |ULTIMATE.start_main_#t~malloc11.base|))} is VALID [2020-07-29 03:25:51,146 INFO L280 TraceCheckUtils]: 8: Hoare triple {391#(and (>= ULTIMATE.start_main_~B~0.offset 0) unseeded (= ULTIMATE.start_main_~B~0.base |ULTIMATE.start_main_#t~malloc11.base|))} main_~i~2 := 0; {391#(and (>= ULTIMATE.start_main_~B~0.offset 0) unseeded (= ULTIMATE.start_main_~B~0.base |ULTIMATE.start_main_#t~malloc11.base|))} is VALID [2020-07-29 03:25:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:51,154 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:25:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:51,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:51,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {392#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (* (- 4) ULTIMATE.start_main_~i~2))) (>= ULTIMATE.start_main_~B~0.offset 0) (= ULTIMATE.start_main_~B~0.base |ULTIMATE.start_main_#t~malloc11.base|))} 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#(and (<= (+ ULTIMATE.start_main_~B~0.offset (* 4 ULTIMATE.start_main_~i~2) 4) (select |#length| ULTIMATE.start_main_~B~0.base)) (<= 0 ULTIMATE.start_main_~B~0.offset) (= ULTIMATE.start_main_~B~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (+ oldRank0 (* 4 ULTIMATE.start_main_~i~2))))} is VALID [2020-07-29 03:25:51,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {424#(and (<= (+ ULTIMATE.start_main_~B~0.offset (* 4 ULTIMATE.start_main_~i~2) 4) (select |#length| ULTIMATE.start_main_~B~0.base)) (<= 0 ULTIMATE.start_main_~B~0.offset) (= ULTIMATE.start_main_~B~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (+ oldRank0 (* 4 ULTIMATE.start_main_~i~2))))} main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; {394#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) (* (- 4) ULTIMATE.start_main_~i~2)))) unseeded) (>= ULTIMATE.start_main_~B~0.offset 0) (= ULTIMATE.start_main_~B~0.base |ULTIMATE.start_main_#t~malloc11.base|))} is VALID [2020-07-29 03:25:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:51,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:51,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:51,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:51,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,214 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:25:51,214 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 4 states. [2020-07-29 03:25:51,362 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 25 states and 39 transitions. Complement of second has 7 states. [2020-07-29 03:25:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:51,362 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:51,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. cyclomatic complexity: 10 [2020-07-29 03:25:51,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:51,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:51,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:25:51,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:51,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:51,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:51,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 39 transitions. [2020-07-29 03:25:51,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:25:51,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:51,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:51,366 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 24 transitions. cyclomatic complexity: 10 [2020-07-29 03:25:51,368 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:25:51,368 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:25:51,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:51,369 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:51,369 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 39 transitions. cyclomatic complexity: 18 [2020-07-29 03:25:51,370 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 03:25:51,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:51,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:51,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:51,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:51,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:51,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:51,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:51,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:51,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:51,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:25:51,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:25:51,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:25:51,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:51,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:51,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:51,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:51,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:51,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:51,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:51,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:51,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:51,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:51,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:51,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:51,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:51,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:51,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:51,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:51,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:51,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:51,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:51,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:51,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:51,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:51,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:51,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:51,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:51,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:51,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:51,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:51,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:51,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:51,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:51,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:51,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:51,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:51,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:51,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:51,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:51,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:51,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:51,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:51,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:51,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:51,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:51,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:51,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:51,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,387 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:25:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-29 03:25:51,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:51,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:51,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:51,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:51,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. cyclomatic complexity: 18 [2020-07-29 03:25:51,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:25:51,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2020-07-29 03:25:51,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:25:51,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 03:25:51,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2020-07-29 03:25:51,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:51,392 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 03:25:51,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2020-07-29 03:25:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-29 03:25:51,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:51,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 26 transitions. Second operand 18 states. [2020-07-29 03:25:51,394 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 26 transitions. Second operand 18 states. [2020-07-29 03:25:51,394 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 18 states. [2020-07-29 03:25:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,395 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2020-07-29 03:25:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2020-07-29 03:25:51,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:51,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:51,396 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states and 26 transitions. [2020-07-29 03:25:51,396 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states and 26 transitions. [2020-07-29 03:25:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,397 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2020-07-29 03:25:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2020-07-29 03:25:51,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:51,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:51,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:51,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 03:25:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2020-07-29 03:25:51,399 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 03:25:51,399 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 03:25:51,399 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:25:51,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2020-07-29 03:25:51,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:25:51,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:51,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:51,400 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:51,400 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:25:51,401 INFO L794 eck$LassoCheckResult]: Stem: 477#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 474#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; 475#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 465#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 466#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; 469#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; 467#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 468#L549-3 assume !(main_~i~1 < main_~Alen~0); 470#L549-4 main_~i~2 := 0; 471#L554-3 assume !(main_~i~2 < main_~Blen~0); 481#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; 482#L519-2 [2020-07-29 03:25:51,401 INFO L796 eck$LassoCheckResult]: Loop: 482#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 473#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 476#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; 480#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 482#L519-2 [2020-07-29 03:25:51,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2020-07-29 03:25:51,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:51,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650652638] [2020-07-29 03:25:51,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:51,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {522#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {522#true} is VALID [2020-07-29 03:25:51,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {522#true} 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; {522#true} is VALID [2020-07-29 03:25:51,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {522#true} assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); {522#true} is VALID [2020-07-29 03:25:51,471 INFO L280 TraceCheckUtils]: 3: Hoare triple {522#true} assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); {524#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,472 INFO L280 TraceCheckUtils]: 4: Hoare triple {524#(<= 1 ULTIMATE.start_main_~Blen~0)} 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; {524#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,474 INFO L280 TraceCheckUtils]: 5: Hoare triple {524#(<= 1 ULTIMATE.start_main_~Blen~0)} 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; {524#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,475 INFO L280 TraceCheckUtils]: 6: Hoare triple {524#(<= 1 ULTIMATE.start_main_~Blen~0)} main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; {524#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,476 INFO L280 TraceCheckUtils]: 7: Hoare triple {524#(<= 1 ULTIMATE.start_main_~Blen~0)} assume !(main_~i~1 < main_~Alen~0); {524#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,478 INFO L280 TraceCheckUtils]: 8: Hoare triple {524#(<= 1 ULTIMATE.start_main_~Blen~0)} main_~i~2 := 0; {525#(and (= 0 ULTIMATE.start_main_~i~2) (<= 1 ULTIMATE.start_main_~Blen~0))} is VALID [2020-07-29 03:25:51,479 INFO L280 TraceCheckUtils]: 9: Hoare triple {525#(and (= 0 ULTIMATE.start_main_~i~2) (<= 1 ULTIMATE.start_main_~Blen~0))} assume !(main_~i~2 < main_~Blen~0); {523#false} is VALID [2020-07-29 03:25:51,479 INFO L280 TraceCheckUtils]: 10: Hoare triple {523#false} 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; {523#false} is VALID [2020-07-29 03:25:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:25:51,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650652638] [2020-07-29 03:25:51,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:51,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:25:51,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824623597] [2020-07-29 03:25:51,481 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:51,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 1 times [2020-07-29 03:25:51,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:51,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485260597] [2020-07-29 03:25:51,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:51,489 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:51,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:51,497 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:51,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:51,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:25:51,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:25:51,621 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 03:25:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,704 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 03:25:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:25:51,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:51,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:51,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2020-07-29 03:25:51,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:25:51,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2020-07-29 03:25:51,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 03:25:51,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 03:25:51,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2020-07-29 03:25:51,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:51,731 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 03:25:51,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2020-07-29 03:25:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-29 03:25:51,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:51,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 26 transitions. Second operand 18 states. [2020-07-29 03:25:51,738 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 26 transitions. Second operand 18 states. [2020-07-29 03:25:51,738 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 18 states. [2020-07-29 03:25:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,741 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 03:25:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-07-29 03:25:51,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:51,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:51,742 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states and 26 transitions. [2020-07-29 03:25:51,742 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states and 26 transitions. [2020-07-29 03:25:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,748 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 03:25:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-07-29 03:25:51,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:51,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:51,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:51,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 03:25:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-07-29 03:25:51,752 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 03:25:51,752 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 03:25:51,752 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:25:51,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-07-29 03:25:51,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:25:51,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:51,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:51,754 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:51,755 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:25:51,755 INFO L794 eck$LassoCheckResult]: Stem: 559#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 556#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; 557#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 547#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 548#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; 551#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; 549#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 550#L549-3 assume !(main_~i~1 < main_~Alen~0); 552#L549-4 main_~i~2 := 0; 553#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; 561#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 562#L554-3 assume !(main_~i~2 < main_~Blen~0); 563#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; 564#L519-2 [2020-07-29 03:25:51,755 INFO L796 eck$LassoCheckResult]: Loop: 564#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 555#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 558#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; 560#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 564#L519-2 [2020-07-29 03:25:51,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:51,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2020-07-29 03:25:51,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:51,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237501744] [2020-07-29 03:25:51,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:51,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:51,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:51,815 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:51,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:51,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 2 times [2020-07-29 03:25:51,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:51,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255858783] [2020-07-29 03:25:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:51,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:51,827 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:51,830 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:51,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:51,830 INFO L82 PathProgramCache]: Analyzing trace with hash -796463931, now seen corresponding path program 1 times [2020-07-29 03:25:51,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:51,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59289395] [2020-07-29 03:25:51,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:51,925 INFO L280 TraceCheckUtils]: 0: Hoare triple {610#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {610#true} is VALID [2020-07-29 03:25:51,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {610#true} 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; {610#true} is VALID [2020-07-29 03:25:51,926 INFO L280 TraceCheckUtils]: 2: Hoare triple {610#true} assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); {610#true} is VALID [2020-07-29 03:25:51,927 INFO L280 TraceCheckUtils]: 3: Hoare triple {610#true} assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); {612#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,927 INFO L280 TraceCheckUtils]: 4: Hoare triple {612#(<= 1 ULTIMATE.start_main_~Blen~0)} 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; {612#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {612#(<= 1 ULTIMATE.start_main_~Blen~0)} 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; {612#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,928 INFO L280 TraceCheckUtils]: 6: Hoare triple {612#(<= 1 ULTIMATE.start_main_~Blen~0)} main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; {612#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,929 INFO L280 TraceCheckUtils]: 7: Hoare triple {612#(<= 1 ULTIMATE.start_main_~Blen~0)} assume !(main_~i~1 < main_~Alen~0); {612#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,929 INFO L280 TraceCheckUtils]: 8: Hoare triple {612#(<= 1 ULTIMATE.start_main_~Blen~0)} main_~i~2 := 0; {612#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,930 INFO L280 TraceCheckUtils]: 9: Hoare triple {612#(<= 1 ULTIMATE.start_main_~Blen~0)} 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; {612#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,930 INFO L280 TraceCheckUtils]: 10: Hoare triple {612#(<= 1 ULTIMATE.start_main_~Blen~0)} main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; {612#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,931 INFO L280 TraceCheckUtils]: 11: Hoare triple {612#(<= 1 ULTIMATE.start_main_~Blen~0)} assume !(main_~i~2 < main_~Blen~0); {612#(<= 1 ULTIMATE.start_main_~Blen~0)} is VALID [2020-07-29 03:25:51,932 INFO L280 TraceCheckUtils]: 12: Hoare triple {612#(<= 1 ULTIMATE.start_main_~Blen~0)} 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; {613#(<= 1 ULTIMATE.start_diff_~l2~0)} is VALID [2020-07-29 03:25:51,934 INFO L280 TraceCheckUtils]: 13: Hoare triple {613#(<= 1 ULTIMATE.start_diff_~l2~0)} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {614#(and (<= 1 ULTIMATE.start_diff_~l2~0) (= 0 ULTIMATE.start_diff_~j~0) (= 0 ULTIMATE.start_diff_~found~0))} is VALID [2020-07-29 03:25:51,934 INFO L280 TraceCheckUtils]: 14: Hoare triple {614#(and (<= 1 ULTIMATE.start_diff_~l2~0) (= 0 ULTIMATE.start_diff_~j~0) (= 0 ULTIMATE.start_diff_~found~0))} assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); {611#false} is VALID [2020-07-29 03:25:51,935 INFO L280 TraceCheckUtils]: 15: Hoare triple {611#false} 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; {611#false} is VALID [2020-07-29 03:25:51,935 INFO L280 TraceCheckUtils]: 16: Hoare triple {611#false} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {611#false} is VALID [2020-07-29 03:25:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 03:25:51,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59289395] [2020-07-29 03:25:51,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:51,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:25:51,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100126319] [2020-07-29 03:25:52,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:52,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:25:52,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:25:52,076 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-07-29 03:25:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:52,198 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2020-07-29 03:25:52,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:25:52,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:25:52,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:52,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2020-07-29 03:25:52,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:25:52,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 28 transitions. [2020-07-29 03:25:52,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 03:25:52,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 03:25:52,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2020-07-29 03:25:52,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:52,230 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-07-29 03:25:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2020-07-29 03:25:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-07-29 03:25:52,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:52,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 28 transitions. Second operand 19 states. [2020-07-29 03:25:52,233 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 28 transitions. Second operand 19 states. [2020-07-29 03:25:52,233 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 19 states. [2020-07-29 03:25:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:52,234 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2020-07-29 03:25:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2020-07-29 03:25:52,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:52,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:52,234 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states and 28 transitions. [2020-07-29 03:25:52,235 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states and 28 transitions. [2020-07-29 03:25:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:52,236 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2020-07-29 03:25:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2020-07-29 03:25:52,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:52,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:52,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:52,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 03:25:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2020-07-29 03:25:52,238 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 03:25:52,238 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 03:25:52,238 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:25:52,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2020-07-29 03:25:52,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:25:52,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:52,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:52,239 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:52,239 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:52,239 INFO L794 eck$LassoCheckResult]: Stem: 651#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 648#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; 649#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 639#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 640#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; 643#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; 641#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 642#L549-3 assume !(main_~i~1 < main_~Alen~0); 644#L549-4 main_~i~2 := 0; 645#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; 652#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 653#L554-3 assume !(main_~i~2 < main_~Blen~0); 656#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; 657#L519-2 [2020-07-29 03:25:52,239 INFO L796 eck$LassoCheckResult]: Loop: 657#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 650#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); 646#L523 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 647#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 654#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; 655#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 657#L519-2 [2020-07-29 03:25:52,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:52,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 2 times [2020-07-29 03:25:52,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:52,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396312430] [2020-07-29 03:25:52,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,279 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,284 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1860447319, now seen corresponding path program 1 times [2020-07-29 03:25:52,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:52,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041491241] [2020-07-29 03:25:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:52,309 INFO L280 TraceCheckUtils]: 0: Hoare triple {703#true} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {703#true} is VALID [2020-07-29 03:25:52,310 INFO L280 TraceCheckUtils]: 1: Hoare triple {703#true} 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); {703#true} is VALID [2020-07-29 03:25:52,311 INFO L280 TraceCheckUtils]: 2: Hoare triple {703#true} assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; {705#(= 1 ULTIMATE.start_diff_~found~0)} is VALID [2020-07-29 03:25:52,311 INFO L280 TraceCheckUtils]: 3: Hoare triple {705#(= 1 ULTIMATE.start_diff_~found~0)} assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); {705#(= 1 ULTIMATE.start_diff_~found~0)} is VALID [2020-07-29 03:25:52,312 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#(= 1 ULTIMATE.start_diff_~found~0)} 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; {704#false} is VALID [2020-07-29 03:25:52,313 INFO L280 TraceCheckUtils]: 5: Hoare triple {704#false} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {704#false} is VALID [2020-07-29 03:25:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:52,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041491241] [2020-07-29 03:25:52,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:52,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:25:52,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642330000] [2020-07-29 03:25:52,314 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:25:52,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:52,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:25:52,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:25:52,315 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 03:25:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:52,365 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-07-29 03:25:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:25:52,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:52,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:52,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2020-07-29 03:25:52,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 03:25:52,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2020-07-29 03:25:52,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-29 03:25:52,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-29 03:25:52,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2020-07-29 03:25:52,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:52,377 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-29 03:25:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2020-07-29 03:25:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-29 03:25:52,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:52,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 30 transitions. Second operand 21 states. [2020-07-29 03:25:52,378 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 30 transitions. Second operand 21 states. [2020-07-29 03:25:52,379 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 21 states. [2020-07-29 03:25:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:52,380 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-07-29 03:25:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2020-07-29 03:25:52,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:52,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:52,380 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states and 30 transitions. [2020-07-29 03:25:52,380 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states and 30 transitions. [2020-07-29 03:25:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:52,382 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-07-29 03:25:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2020-07-29 03:25:52,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:52,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:52,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:52,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 03:25:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2020-07-29 03:25:52,383 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-07-29 03:25:52,383 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-07-29 03:25:52,384 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:25:52,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-07-29 03:25:52,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 03:25:52,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:52,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:52,385 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:52,385 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:52,385 INFO L794 eck$LassoCheckResult]: Stem: 742#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 739#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; 740#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 729#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 730#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; 733#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; 731#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 732#L549-3 assume !(main_~i~1 < main_~Alen~0); 734#L549-4 main_~i~2 := 0; 735#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); 746#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; 747#L519-2 [2020-07-29 03:25:52,385 INFO L796 eck$LassoCheckResult]: Loop: 747#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 748#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); 736#L523 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 737#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 741#L522-2 assume !(0 == diff_~found~0); 745#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 747#L519-2 [2020-07-29 03:25:52,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:52,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 3 times [2020-07-29 03:25:52,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:52,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583098921] [2020-07-29 03:25:52,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,415 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,420 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:52,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1860447257, now seen corresponding path program 1 times [2020-07-29 03:25:52,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:52,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173098186] [2020-07-29 03:25:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,426 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,432 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:52,432 INFO L82 PathProgramCache]: Analyzing trace with hash -896094976, now seen corresponding path program 1 times [2020-07-29 03:25:52,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:52,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278298444] [2020-07-29 03:25:52,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,450 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,470 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,484 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:53,365 WARN L193 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 141 [2020-07-29 03:25:53,721 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-07-29 03:25:53,725 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:53,725 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:53,725 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:53,725 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:53,725 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:53,726 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:53,726 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:53,726 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:53,726 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration7_Lasso [2020-07-29 03:25:53,726 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:53,726 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:53,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,457 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 108 [2020-07-29 03:25:54,610 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2020-07-29 03:25:54,615 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:54,616 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:54,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:55,360 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2020-07-29 03:25:55,880 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-07-29 03:25:56,237 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:56,239 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:56,242 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 [2020-07-29 03:25:56,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:56,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:56,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:56,246 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:56,273 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 [2020-07-29 03:25:56,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:56,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:56,281 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:56,308 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 [2020-07-29 03:25:56,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:56,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:56,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:56,315 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:56,340 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 [2020-07-29 03:25:56,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:56,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:56,346 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:56,370 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 [2020-07-29 03:25:56,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:56,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:56,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:56,375 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:56,398 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 [2020-07-29 03:25:56,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:56,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:56,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:56,407 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 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 [2020-07-29 03:25:56,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 [2020-07-29 03:25:56,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:56,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:56,438 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 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 [2020-07-29 03:25:56,466 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 [2020-07-29 03:25:56,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:56,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:56,482 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 [2020-07-29 03:25:56,515 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 [2020-07-29 03:25:56,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:56,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:56,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:56,519 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 [2020-07-29 03:25:56,543 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 [2020-07-29 03:25:56,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:56,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:56,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:56,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:56,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:56,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:56,608 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:56,723 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2020-07-29 03:25:56,723 INFO L444 ModelExtractionUtils]: 48 out of 76 variables were initially zero. Simplification set additionally 24 variables to zero. 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) [2020-07-29 03:25:56,728 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:56,732 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:25:56,732 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:56,733 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, v_rep(select #length ULTIMATE.start_diff_~A.base)_1) = -4*ULTIMATE.start_diff_~i~0 + 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_1 Supporting invariants [1*ULTIMATE.start_diff_~A.offset >= 0] [2020-07-29 03:25:56,904 INFO L297 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2020-07-29 03:25:56,910 INFO L393 LassoCheck]: Loop: "assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0;" "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);" "assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1;" "assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);" "assume !(0 == diff_~found~0);" "diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7;" [2020-07-29 03:25:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:56,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:25:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:56,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:25:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:56,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:57,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {805#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {805#unseeded} is VALID [2020-07-29 03:25:57,038 INFO L280 TraceCheckUtils]: 1: Hoare triple {805#unseeded} 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; {805#unseeded} is VALID [2020-07-29 03:25:57,041 INFO L280 TraceCheckUtils]: 2: Hoare triple {805#unseeded} assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); {805#unseeded} is VALID [2020-07-29 03:25:57,041 INFO L280 TraceCheckUtils]: 3: Hoare triple {805#unseeded} assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); {805#unseeded} is VALID [2020-07-29 03:25:57,043 INFO L280 TraceCheckUtils]: 4: Hoare triple {805#unseeded} 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; {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} is VALID [2020-07-29 03:25:57,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} 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; {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} is VALID [2020-07-29 03:25:57,044 INFO L280 TraceCheckUtils]: 6: Hoare triple {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} is VALID [2020-07-29 03:25:57,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} assume !(main_~i~1 < main_~Alen~0); {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} is VALID [2020-07-29 03:25:57,046 INFO L280 TraceCheckUtils]: 8: Hoare triple {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} main_~i~2 := 0; {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} is VALID [2020-07-29 03:25:57,047 INFO L280 TraceCheckUtils]: 9: Hoare triple {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} 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; {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} is VALID [2020-07-29 03:25:57,047 INFO L280 TraceCheckUtils]: 10: Hoare triple {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} is VALID [2020-07-29 03:25:57,048 INFO L280 TraceCheckUtils]: 11: Hoare triple {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} assume !(main_~i~2 < main_~Blen~0); {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} is VALID [2020-07-29 03:25:57,049 INFO L280 TraceCheckUtils]: 12: Hoare triple {965#(and (<= 0 ULTIMATE.start_main_~A~0.offset) unseeded)} 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; {944#(and (>= ULTIMATE.start_diff_~A.offset 0) unseeded)} is VALID [2020-07-29 03:25:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:57,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:57,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:57,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {945#(and (>= ULTIMATE.start_diff_~A.offset 0) (>= oldRank0 (+ (* (- 4) ULTIMATE.start_diff_~i~0) (select |#length| ULTIMATE.start_diff_~A.base))))} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {945#(and (>= ULTIMATE.start_diff_~A.offset 0) (>= oldRank0 (+ (* (- 4) ULTIMATE.start_diff_~i~0) (select |#length| ULTIMATE.start_diff_~A.base))))} is VALID [2020-07-29 03:25:57,102 INFO L280 TraceCheckUtils]: 1: Hoare triple {945#(and (>= ULTIMATE.start_diff_~A.offset 0) (>= oldRank0 (+ (* (- 4) ULTIMATE.start_diff_~i~0) (select |#length| ULTIMATE.start_diff_~A.base))))} 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); {993#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} is VALID [2020-07-29 03:25:57,103 INFO L280 TraceCheckUtils]: 2: Hoare triple {993#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; {993#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} is VALID [2020-07-29 03:25:57,104 INFO L280 TraceCheckUtils]: 3: Hoare triple {993#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); {993#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} is VALID [2020-07-29 03:25:57,106 INFO L280 TraceCheckUtils]: 4: Hoare triple {993#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} assume !(0 == diff_~found~0); {993#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} is VALID [2020-07-29 03:25:57,107 INFO L280 TraceCheckUtils]: 5: Hoare triple {993#(and (<= 0 ULTIMATE.start_diff_~A.offset) (<= (+ (* 4 ULTIMATE.start_diff_~i~0) ULTIMATE.start_diff_~A.offset 4) (select |#length| ULTIMATE.start_diff_~A.base)) (<= (select |#length| ULTIMATE.start_diff_~A.base) (+ (* 4 ULTIMATE.start_diff_~i~0) oldRank0)))} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {947#(and (or (and (> oldRank0 (+ (* (- 4) ULTIMATE.start_diff_~i~0) (select |#length| ULTIMATE.start_diff_~A.base))) (>= oldRank0 0)) unseeded) (>= ULTIMATE.start_diff_~A.offset 0))} is VALID [2020-07-29 03:25:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:57,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:25:57,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:57,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:57,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,129 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:25:57,130 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-07-29 03:25:57,239 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 29 states and 40 transitions. Complement of second has 7 states. [2020-07-29 03:25:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:57,240 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:57,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. cyclomatic complexity: 10 [2020-07-29 03:25:57,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:57,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:57,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:25:57,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:57,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:57,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:57,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. [2020-07-29 03:25:57,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:57,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:57,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:57,244 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 10 [2020-07-29 03:25:57,246 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:25:57,246 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:25:57,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:57,247 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:57,247 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 40 transitions. cyclomatic complexity: 15 [2020-07-29 03:25:57,248 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:57,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:57,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:57,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:57,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:25:57,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:25:57,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:25:57,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:57,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:57,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:57,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:25:57,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:25:57,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:25:57,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:25:57,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:25:57,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:25:57,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:57,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:57,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:57,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:57,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:57,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:57,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:25:57,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:25:57,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:25:57,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:57,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:57,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:57,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 6 letters. [2020-07-29 03:25:57,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 03:25:57,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2020-07-29 03:25:57,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 6 letters. [2020-07-29 03:25:57,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 03:25:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2020-07-29 03:25:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:57,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:57,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 6 letters. [2020-07-29 03:25:57,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 03:25:57,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2020-07-29 03:25:57,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 6 letters. [2020-07-29 03:25:57,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 03:25:57,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2020-07-29 03:25:57,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:25:57,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:25:57,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:25:57,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:57,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:57,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:57,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:57,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:57,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:57,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,262 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:25:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-07-29 03:25:57,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:57,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 19 letters. Loop has 6 letters. [2020-07-29 03:25:57,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 13 letters. Loop has 12 letters. [2020-07-29 03:25:57,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:57,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. cyclomatic complexity: 15 [2020-07-29 03:25:57,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:57,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2020-07-29 03:25:57,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:25:57,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:25:57,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-07-29 03:25:57,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:57,267 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-07-29 03:25:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-07-29 03:25:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-07-29 03:25:57,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:57,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 34 transitions. Second operand 24 states. [2020-07-29 03:25:57,269 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 34 transitions. Second operand 24 states. [2020-07-29 03:25:57,270 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 24 states. [2020-07-29 03:25:57,270 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:57,273 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2020-07-29 03:25:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2020-07-29 03:25:57,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:57,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:57,274 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states and 34 transitions. [2020-07-29 03:25:57,274 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states and 34 transitions. [2020-07-29 03:25:57,275 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:57,276 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2020-07-29 03:25:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2020-07-29 03:25:57,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:57,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:57,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:57,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 03:25:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-07-29 03:25:57,278 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 03:25:57,278 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 03:25:57,278 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:25:57,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-07-29 03:25:57,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:57,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:57,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:57,280 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:57,280 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:57,280 INFO L794 eck$LassoCheckResult]: Stem: 1062#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1059#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; 1060#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1047#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1048#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; 1051#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; 1049#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1050#L549-3 assume !(main_~i~1 < main_~Alen~0); 1052#L549-4 main_~i~2 := 0; 1053#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; 1065#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1066#L554-3 assume !(main_~i~2 < main_~Blen~0); 1067#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; 1068#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1055#L523-2 [2020-07-29 03:25:57,280 INFO L796 eck$LassoCheckResult]: Loop: 1055#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); 1054#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1055#L523-2 [2020-07-29 03:25:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1313217434, now seen corresponding path program 1 times [2020-07-29 03:25:57,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:57,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964314355] [2020-07-29 03:25:57,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,294 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,313 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:57,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:57,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 1 times [2020-07-29 03:25:57,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:57,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657487685] [2020-07-29 03:25:57,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,320 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,322 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:57,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:57,323 INFO L82 PathProgramCache]: Analyzing trace with hash -718428993, now seen corresponding path program 1 times [2020-07-29 03:25:57,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:57,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262013765] [2020-07-29 03:25:57,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:57,354 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:57,359 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:58,147 WARN L193 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 147 [2020-07-29 03:25:58,472 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-07-29 03:25:58,476 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:58,476 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:58,476 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:58,476 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:58,477 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:58,477 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:58,477 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:58,477 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:58,477 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration8_Lasso [2020-07-29 03:25:58,477 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:58,478 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:58,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:58,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:58,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:58,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:58,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:58,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:58,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:58,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:58,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:58,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:58,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:58,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,306 WARN L193 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2020-07-29 03:25:59,452 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2020-07-29 03:25:59,457 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:59,458 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:59,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:00,216 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2020-07-29 03:26:00,739 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-07-29 03:26:01,075 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:01,075 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 03:26:01,079 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 [2020-07-29 03:26:01,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:01,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,087 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) [2020-07-29 03:26:01,108 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 [2020-07-29 03:26:01,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:01,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,115 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 [2020-07-29 03:26:01,139 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 [2020-07-29 03:26:01,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:01,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:01,145 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) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,169 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 [2020-07-29 03:26:01,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:01,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:01,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:01,174 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) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,197 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 [2020-07-29 03:26:01,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:01,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:01,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:01,200 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) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,223 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 [2020-07-29 03:26:01,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:01,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:01,229 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) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,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 [2020-07-29 03:26:01,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:01,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:01,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:01,257 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) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,279 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 [2020-07-29 03:26:01,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:01,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:01,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:01,282 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) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,305 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 [2020-07-29 03:26:01,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:01,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:01,312 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 [2020-07-29 03:26:01,341 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 [2020-07-29 03:26:01,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:01,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:01,352 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 [2020-07-29 03:26:01,383 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 [2020-07-29 03:26:01,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:01,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:01,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:01,387 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 [2020-07-29 03:26:01,410 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 [2020-07-29 03:26:01,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:01,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:01,457 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:01,496 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 03:26:01,496 INFO L444 ModelExtractionUtils]: 29 out of 82 variables were initially zero. Simplification set additionally 50 variables to zero. 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 [2020-07-29 03:26:01,498 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:01,500 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:01,500 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:01,501 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 [] [2020-07-29 03:26:01,645 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2020-07-29 03:26:01,648 INFO L393 LassoCheck]: Loop: "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);" "assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4;" [2020-07-29 03:26:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:01,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {1206#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1206#unseeded} is VALID [2020-07-29 03:26:01,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {1206#unseeded} 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; {1206#unseeded} is VALID [2020-07-29 03:26:01,720 INFO L280 TraceCheckUtils]: 2: Hoare triple {1206#unseeded} assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); {1206#unseeded} is VALID [2020-07-29 03:26:01,721 INFO L280 TraceCheckUtils]: 3: Hoare triple {1206#unseeded} assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); {1206#unseeded} is VALID [2020-07-29 03:26:01,721 INFO L280 TraceCheckUtils]: 4: Hoare triple {1206#unseeded} 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; {1206#unseeded} is VALID [2020-07-29 03:26:01,722 INFO L280 TraceCheckUtils]: 5: Hoare triple {1206#unseeded} 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; {1206#unseeded} is VALID [2020-07-29 03:26:01,722 INFO L280 TraceCheckUtils]: 6: Hoare triple {1206#unseeded} main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; {1206#unseeded} is VALID [2020-07-29 03:26:01,723 INFO L280 TraceCheckUtils]: 7: Hoare triple {1206#unseeded} assume !(main_~i~1 < main_~Alen~0); {1206#unseeded} is VALID [2020-07-29 03:26:01,723 INFO L280 TraceCheckUtils]: 8: Hoare triple {1206#unseeded} main_~i~2 := 0; {1206#unseeded} is VALID [2020-07-29 03:26:01,724 INFO L280 TraceCheckUtils]: 9: Hoare triple {1206#unseeded} 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; {1206#unseeded} is VALID [2020-07-29 03:26:01,724 INFO L280 TraceCheckUtils]: 10: Hoare triple {1206#unseeded} main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; {1206#unseeded} is VALID [2020-07-29 03:26:01,724 INFO L280 TraceCheckUtils]: 11: Hoare triple {1206#unseeded} assume !(main_~i~2 < main_~Blen~0); {1206#unseeded} is VALID [2020-07-29 03:26:01,725 INFO L280 TraceCheckUtils]: 12: Hoare triple {1206#unseeded} 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; {1206#unseeded} is VALID [2020-07-29 03:26:01,725 INFO L280 TraceCheckUtils]: 13: Hoare triple {1206#unseeded} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {1206#unseeded} is VALID [2020-07-29 03:26:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:01,751 INFO L280 TraceCheckUtils]: 0: Hoare triple {1209#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_diff_~j~0) ULTIMATE.start_diff_~l2~0))} 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); {1408#(and (<= ULTIMATE.start_diff_~l2~0 (+ ULTIMATE.start_diff_~j~0 oldRank0)) (< ULTIMATE.start_diff_~j~0 ULTIMATE.start_diff_~l2~0))} is VALID [2020-07-29 03:26:01,753 INFO L280 TraceCheckUtils]: 1: Hoare triple {1408#(and (<= ULTIMATE.start_diff_~l2~0 (+ ULTIMATE.start_diff_~j~0 oldRank0)) (< ULTIMATE.start_diff_~j~0 ULTIMATE.start_diff_~l2~0))} assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; {1364#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_diff_~j~0) ULTIMATE.start_diff_~l2~0))) unseeded)} is VALID [2020-07-29 03:26:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:01,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:01,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:01,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:26:01,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,766 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 [2020-07-29 03:26:01,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-29 03:26:01,824 INFO L75 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. [2020-07-29 03:26:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:01,825 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:01,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. cyclomatic complexity: 13 [2020-07-29 03:26:01,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:01,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:01,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:01,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:01,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:01,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:01,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2020-07-29 03:26:01,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:01,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:01,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:01,828 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 33 transitions. cyclomatic complexity: 13 [2020-07-29 03:26:01,829 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:01,829 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:01,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:01,830 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:01,830 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 63 transitions. cyclomatic complexity: 23 [2020-07-29 03:26:01,831 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:01,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:26:01,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:26:01,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 23 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:26:01,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:26:01,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:26:01,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 23 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:26:01,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 13 Stem has 46 letters. Loop has 46 letters. [2020-07-29 03:26:01,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 46 letters. [2020-07-29 03:26:01,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 23 Stem has 46 letters. Loop has 46 letters. [2020-07-29 03:26:01,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:26:01,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:26:01,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 23 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:26:01,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:01,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:01,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:01,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:01,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:01,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 23 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:01,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:26:01,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:26:01,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 23 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:26:01,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:26:01,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:26:01,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 23 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:26:01,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 33 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:26:01,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:26:01,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 23 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:26:01,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,844 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2020-07-29 03:26:01,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:26:01,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:01,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:26:01,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. cyclomatic complexity: 23 [2020-07-29 03:26:01,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:01,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 35 states and 49 transitions. [2020-07-29 03:26:01,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:26:01,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:26:01,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2020-07-29 03:26:01,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:01,852 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2020-07-29 03:26:01,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2020-07-29 03:26:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2020-07-29 03:26:01,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:01,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states and 49 transitions. Second operand 28 states. [2020-07-29 03:26:01,854 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states and 49 transitions. Second operand 28 states. [2020-07-29 03:26:01,854 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 28 states. [2020-07-29 03:26:01,855 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:01,857 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2020-07-29 03:26:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2020-07-29 03:26:01,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:01,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:01,858 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 35 states and 49 transitions. [2020-07-29 03:26:01,858 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 35 states and 49 transitions. [2020-07-29 03:26:01,859 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:01,861 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2020-07-29 03:26:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2020-07-29 03:26:01,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:01,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:01,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:01,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 03:26:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-07-29 03:26:01,863 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-07-29 03:26:01,863 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-07-29 03:26:01,863 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:26:01,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2020-07-29 03:26:01,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:01,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:01,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:01,865 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] [2020-07-29 03:26:01,865 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:01,865 INFO L794 eck$LassoCheckResult]: Stem: 1483#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1479#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; 1480#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1468#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1469#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; 1472#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; 1470#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1471#L549-3 assume !(main_~i~1 < main_~Alen~0); 1473#L549-4 main_~i~2 := 0; 1474#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; 1484#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1485#L554-3 assume !(main_~i~2 < main_~Blen~0); 1487#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; 1488#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1490#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); 1477#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1478#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1493#L522-2 assume !(0 == diff_~found~0); 1486#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1489#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1476#L523-2 [2020-07-29 03:26:01,866 INFO L796 eck$LassoCheckResult]: Loop: 1476#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); 1475#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1476#L523-2 [2020-07-29 03:26:01,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:01,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2007293386, now seen corresponding path program 1 times [2020-07-29 03:26:01,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:01,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208427030] [2020-07-29 03:26:01,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {1662#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1662#true} is VALID [2020-07-29 03:26:01,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {1662#true} 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; {1662#true} is VALID [2020-07-29 03:26:01,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {1662#true} assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); {1662#true} is VALID [2020-07-29 03:26:01,930 INFO L280 TraceCheckUtils]: 3: Hoare triple {1662#true} assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); {1662#true} is VALID [2020-07-29 03:26:01,930 INFO L280 TraceCheckUtils]: 4: Hoare triple {1662#true} 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; {1662#true} is VALID [2020-07-29 03:26:01,930 INFO L280 TraceCheckUtils]: 5: Hoare triple {1662#true} 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; {1662#true} is VALID [2020-07-29 03:26:01,930 INFO L280 TraceCheckUtils]: 6: Hoare triple {1662#true} main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; {1662#true} is VALID [2020-07-29 03:26:01,931 INFO L280 TraceCheckUtils]: 7: Hoare triple {1662#true} assume !(main_~i~1 < main_~Alen~0); {1662#true} is VALID [2020-07-29 03:26:01,931 INFO L280 TraceCheckUtils]: 8: Hoare triple {1662#true} main_~i~2 := 0; {1662#true} is VALID [2020-07-29 03:26:01,932 INFO L280 TraceCheckUtils]: 9: Hoare triple {1662#true} 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; {1662#true} is VALID [2020-07-29 03:26:01,932 INFO L280 TraceCheckUtils]: 10: Hoare triple {1662#true} main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; {1662#true} is VALID [2020-07-29 03:26:01,933 INFO L280 TraceCheckUtils]: 11: Hoare triple {1662#true} assume !(main_~i~2 < main_~Blen~0); {1662#true} is VALID [2020-07-29 03:26:01,933 INFO L280 TraceCheckUtils]: 12: Hoare triple {1662#true} 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; {1662#true} is VALID [2020-07-29 03:26:01,934 INFO L280 TraceCheckUtils]: 13: Hoare triple {1662#true} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {1664#(= 0 ULTIMATE.start_diff_~found~0)} is VALID [2020-07-29 03:26:01,935 INFO L280 TraceCheckUtils]: 14: Hoare triple {1664#(= 0 ULTIMATE.start_diff_~found~0)} 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); {1664#(= 0 ULTIMATE.start_diff_~found~0)} is VALID [2020-07-29 03:26:01,936 INFO L280 TraceCheckUtils]: 15: Hoare triple {1664#(= 0 ULTIMATE.start_diff_~found~0)} assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; {1664#(= 0 ULTIMATE.start_diff_~found~0)} is VALID [2020-07-29 03:26:01,936 INFO L280 TraceCheckUtils]: 16: Hoare triple {1664#(= 0 ULTIMATE.start_diff_~found~0)} assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); {1664#(= 0 ULTIMATE.start_diff_~found~0)} is VALID [2020-07-29 03:26:01,937 INFO L280 TraceCheckUtils]: 17: Hoare triple {1664#(= 0 ULTIMATE.start_diff_~found~0)} assume !(0 == diff_~found~0); {1663#false} is VALID [2020-07-29 03:26:01,937 INFO L280 TraceCheckUtils]: 18: Hoare triple {1663#false} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {1663#false} is VALID [2020-07-29 03:26:01,937 INFO L280 TraceCheckUtils]: 19: Hoare triple {1663#false} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {1663#false} is VALID [2020-07-29 03:26:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 03:26:01,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208427030] [2020-07-29 03:26:01,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:01,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:26:01,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011392086] [2020-07-29 03:26:01,941 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:01,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:01,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 2 times [2020-07-29 03:26:01,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:01,942 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905857440] [2020-07-29 03:26:01,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:01,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:01,948 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:01,949 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:02,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:02,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:26:02,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:26:02,084 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 16 Second operand 3 states. [2020-07-29 03:26:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:02,132 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2020-07-29 03:26:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:26:02,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:02,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:02,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2020-07-29 03:26:02,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:02,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 41 transitions. [2020-07-29 03:26:02,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:26:02,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:26:02,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2020-07-29 03:26:02,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:02,177 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2020-07-29 03:26:02,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2020-07-29 03:26:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-29 03:26:02,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:02,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 41 transitions. Second operand 28 states. [2020-07-29 03:26:02,182 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 41 transitions. Second operand 28 states. [2020-07-29 03:26:02,182 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand 28 states. [2020-07-29 03:26:02,182 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:02,184 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2020-07-29 03:26:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-07-29 03:26:02,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:02,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:02,186 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states and 41 transitions. [2020-07-29 03:26:02,186 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states and 41 transitions. [2020-07-29 03:26:02,187 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:02,188 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2020-07-29 03:26:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-07-29 03:26:02,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:02,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:02,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:02,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 03:26:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-29 03:26:02,195 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-29 03:26:02,195 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-29 03:26:02,195 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 03:26:02,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2020-07-29 03:26:02,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:02,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:02,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:02,196 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] [2020-07-29 03:26:02,196 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:02,197 INFO L794 eck$LassoCheckResult]: Stem: 1712#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1708#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; 1709#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1697#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1698#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; 1701#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; 1699#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1700#L549-3 assume !(main_~i~1 < main_~Alen~0); 1702#L549-4 main_~i~2 := 0; 1703#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; 1713#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1714#L554-3 assume !(main_~i~2 < main_~Blen~0); 1717#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; 1718#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1720#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); 1706#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1707#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1722#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; 1716#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1719#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1705#L523-2 [2020-07-29 03:26:02,197 INFO L796 eck$LassoCheckResult]: Loop: 1705#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); 1704#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1705#L523-2 [2020-07-29 03:26:02,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:02,197 INFO L82 PathProgramCache]: Analyzing trace with hash -2007295308, now seen corresponding path program 1 times [2020-07-29 03:26:02,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:02,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019610107] [2020-07-29 03:26:02,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:02,300 INFO L280 TraceCheckUtils]: 0: Hoare triple {1876#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1876#true} is VALID [2020-07-29 03:26:02,300 INFO L280 TraceCheckUtils]: 1: Hoare triple {1876#true} 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; {1876#true} is VALID [2020-07-29 03:26:02,300 INFO L280 TraceCheckUtils]: 2: Hoare triple {1876#true} assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); {1876#true} is VALID [2020-07-29 03:26:02,301 INFO L280 TraceCheckUtils]: 3: Hoare triple {1876#true} assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); {1876#true} is VALID [2020-07-29 03:26:02,302 INFO L280 TraceCheckUtils]: 4: Hoare triple {1876#true} 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; {1878#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:02,302 INFO L280 TraceCheckUtils]: 5: Hoare triple {1878#(= 0 ULTIMATE.start_main_~i~1)} 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; {1878#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:02,308 INFO L280 TraceCheckUtils]: 6: Hoare triple {1878#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; {1879#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:02,311 INFO L280 TraceCheckUtils]: 7: Hoare triple {1879#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < main_~Alen~0); {1880#(<= ULTIMATE.start_main_~Alen~0 1)} is VALID [2020-07-29 03:26:02,313 INFO L280 TraceCheckUtils]: 8: Hoare triple {1880#(<= ULTIMATE.start_main_~Alen~0 1)} main_~i~2 := 0; {1880#(<= ULTIMATE.start_main_~Alen~0 1)} is VALID [2020-07-29 03:26:02,316 INFO L280 TraceCheckUtils]: 9: Hoare triple {1880#(<= ULTIMATE.start_main_~Alen~0 1)} 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; {1880#(<= ULTIMATE.start_main_~Alen~0 1)} is VALID [2020-07-29 03:26:02,316 INFO L280 TraceCheckUtils]: 10: Hoare triple {1880#(<= ULTIMATE.start_main_~Alen~0 1)} main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; {1880#(<= ULTIMATE.start_main_~Alen~0 1)} is VALID [2020-07-29 03:26:02,317 INFO L280 TraceCheckUtils]: 11: Hoare triple {1880#(<= ULTIMATE.start_main_~Alen~0 1)} assume !(main_~i~2 < main_~Blen~0); {1880#(<= ULTIMATE.start_main_~Alen~0 1)} is VALID [2020-07-29 03:26:02,318 INFO L280 TraceCheckUtils]: 12: Hoare triple {1880#(<= ULTIMATE.start_main_~Alen~0 1)} 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; {1881#(and (= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} is VALID [2020-07-29 03:26:02,318 INFO L280 TraceCheckUtils]: 13: Hoare triple {1881#(and (= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {1881#(and (= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} is VALID [2020-07-29 03:26:02,321 INFO L280 TraceCheckUtils]: 14: Hoare triple {1881#(and (= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} 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); {1881#(and (= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} is VALID [2020-07-29 03:26:02,323 INFO L280 TraceCheckUtils]: 15: Hoare triple {1881#(and (= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; {1881#(and (= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} is VALID [2020-07-29 03:26:02,324 INFO L280 TraceCheckUtils]: 16: Hoare triple {1881#(and (= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); {1881#(and (= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} is VALID [2020-07-29 03:26:02,325 INFO L280 TraceCheckUtils]: 17: Hoare triple {1881#(and (= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} 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; {1881#(and (= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} is VALID [2020-07-29 03:26:02,326 INFO L280 TraceCheckUtils]: 18: Hoare triple {1881#(and (= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {1882#(<= ULTIMATE.start_diff_~l1~0 ULTIMATE.start_diff_~i~0)} is VALID [2020-07-29 03:26:02,327 INFO L280 TraceCheckUtils]: 19: Hoare triple {1882#(<= ULTIMATE.start_diff_~l1~0 ULTIMATE.start_diff_~i~0)} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {1877#false} is VALID [2020-07-29 03:26:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 03:26:02,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019610107] [2020-07-29 03:26:02,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586643442] [2020-07-29 03:26:02,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:02,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:26:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:02,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:02,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {1876#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1876#true} is VALID [2020-07-29 03:26:02,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {1876#true} 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; {1876#true} is VALID [2020-07-29 03:26:02,568 INFO L280 TraceCheckUtils]: 2: Hoare triple {1876#true} assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); {1876#true} is VALID [2020-07-29 03:26:02,569 INFO L280 TraceCheckUtils]: 3: Hoare triple {1876#true} assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); {1876#true} is VALID [2020-07-29 03:26:02,570 INFO L280 TraceCheckUtils]: 4: Hoare triple {1876#true} 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; {1898#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:26:02,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {1898#(<= ULTIMATE.start_main_~i~1 0)} 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; {1898#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:26:02,571 INFO L280 TraceCheckUtils]: 6: Hoare triple {1898#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; {1879#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:02,571 INFO L280 TraceCheckUtils]: 7: Hoare triple {1879#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < main_~Alen~0); {1880#(<= ULTIMATE.start_main_~Alen~0 1)} is VALID [2020-07-29 03:26:02,572 INFO L280 TraceCheckUtils]: 8: Hoare triple {1880#(<= ULTIMATE.start_main_~Alen~0 1)} main_~i~2 := 0; {1880#(<= ULTIMATE.start_main_~Alen~0 1)} is VALID [2020-07-29 03:26:02,572 INFO L280 TraceCheckUtils]: 9: Hoare triple {1880#(<= ULTIMATE.start_main_~Alen~0 1)} 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; {1880#(<= ULTIMATE.start_main_~Alen~0 1)} is VALID [2020-07-29 03:26:02,573 INFO L280 TraceCheckUtils]: 10: Hoare triple {1880#(<= ULTIMATE.start_main_~Alen~0 1)} main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; {1880#(<= ULTIMATE.start_main_~Alen~0 1)} is VALID [2020-07-29 03:26:02,573 INFO L280 TraceCheckUtils]: 11: Hoare triple {1880#(<= ULTIMATE.start_main_~Alen~0 1)} assume !(main_~i~2 < main_~Blen~0); {1880#(<= ULTIMATE.start_main_~Alen~0 1)} is VALID [2020-07-29 03:26:02,574 INFO L280 TraceCheckUtils]: 12: Hoare triple {1880#(<= ULTIMATE.start_main_~Alen~0 1)} 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; {1923#(and (<= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} is VALID [2020-07-29 03:26:02,574 INFO L280 TraceCheckUtils]: 13: Hoare triple {1923#(and (<= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {1923#(and (<= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} is VALID [2020-07-29 03:26:02,575 INFO L280 TraceCheckUtils]: 14: Hoare triple {1923#(and (<= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} 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); {1923#(and (<= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} is VALID [2020-07-29 03:26:02,576 INFO L280 TraceCheckUtils]: 15: Hoare triple {1923#(and (<= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; {1923#(and (<= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} is VALID [2020-07-29 03:26:02,577 INFO L280 TraceCheckUtils]: 16: Hoare triple {1923#(and (<= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); {1923#(and (<= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} is VALID [2020-07-29 03:26:02,578 INFO L280 TraceCheckUtils]: 17: Hoare triple {1923#(and (<= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} 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; {1923#(and (<= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} is VALID [2020-07-29 03:26:02,579 INFO L280 TraceCheckUtils]: 18: Hoare triple {1923#(and (<= 0 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; {1942#(and (<= 1 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} is VALID [2020-07-29 03:26:02,579 INFO L280 TraceCheckUtils]: 19: Hoare triple {1942#(and (<= 1 ULTIMATE.start_diff_~i~0) (<= ULTIMATE.start_diff_~l1~0 1))} assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; {1877#false} is VALID [2020-07-29 03:26:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 03:26:02,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:02,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-29 03:26:02,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507396919] [2020-07-29 03:26:02,581 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:02,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:02,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 3 times [2020-07-29 03:26:02,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:02,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550038516] [2020-07-29 03:26:02,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:02,586 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:02,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:02,590 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:02,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:02,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 03:26:02,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-29 03:26:02,658 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 15 Second operand 10 states. [2020-07-29 03:26:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:03,000 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2020-07-29 03:26:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 03:26:03,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 03:26:03,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:03,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 68 transitions. [2020-07-29 03:26:03,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:03,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 31 states and 40 transitions. [2020-07-29 03:26:03,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:26:03,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:26:03,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2020-07-29 03:26:03,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:03,061 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-07-29 03:26:03,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2020-07-29 03:26:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-07-29 03:26:03,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:03,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 40 transitions. Second operand 30 states. [2020-07-29 03:26:03,064 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 40 transitions. Second operand 30 states. [2020-07-29 03:26:03,064 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand 30 states. [2020-07-29 03:26:03,065 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:03,066 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2020-07-29 03:26:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2020-07-29 03:26:03,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:03,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:03,067 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states and 40 transitions. [2020-07-29 03:26:03,067 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states and 40 transitions. [2020-07-29 03:26:03,068 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:03,069 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2020-07-29 03:26:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2020-07-29 03:26:03,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:03,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:03,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:03,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 03:26:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-07-29 03:26:03,071 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-29 03:26:03,071 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-29 03:26:03,071 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 03:26:03,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2020-07-29 03:26:03,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:03,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:03,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:03,072 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] [2020-07-29 03:26:03,072 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:03,073 INFO L794 eck$LassoCheckResult]: Stem: 2023#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2019#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; 2020#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 2007#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 2008#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; 2011#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; 2009#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 2010#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; 2012#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 2032#L549-3 assume !(main_~i~1 < main_~Alen~0); 2013#L549-4 main_~i~2 := 0; 2014#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; 2026#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 2027#L554-3 assume !(main_~i~2 < main_~Blen~0); 2028#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; 2029#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 2031#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); 2017#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 2018#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 2033#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; 2025#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 2030#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 2016#L523-2 [2020-07-29 03:26:03,073 INFO L796 eck$LassoCheckResult]: Loop: 2016#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); 2015#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 2016#L523-2 [2020-07-29 03:26:03,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:03,073 INFO L82 PathProgramCache]: Analyzing trace with hash 633938194, now seen corresponding path program 2 times [2020-07-29 03:26:03,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:03,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628826183] [2020-07-29 03:26:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:03,091 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:03,106 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:03,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:03,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:03,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 4 times [2020-07-29 03:26:03,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:03,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031910009] [2020-07-29 03:26:03,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:03,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:03,119 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:03,120 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:03,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:03,121 INFO L82 PathProgramCache]: Analyzing trace with hash -670749641, now seen corresponding path program 3 times [2020-07-29 03:26:03,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:03,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535006531] [2020-07-29 03:26:03,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:03,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:03,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:03,162 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:04,373 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 253 DAG size of output: 195 [2020-07-29 03:26:04,897 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-07-29 03:26:04,900 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:04,901 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:04,901 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:04,901 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:04,901 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:04,901 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:04,901 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:04,901 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:04,901 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration11_Lasso [2020-07-29 03:26:04,901 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:04,901 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:04,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:05,182 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:317) 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) [2020-07-29 03:26:05,187 INFO L168 Benchmark]: Toolchain (without parser) took 22041.51 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 470.3 MB). Free memory was 958.9 MB in the beginning and 904.3 MB in the end (delta: 54.6 MB). Peak memory consumption was 524.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:05,187 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:05,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 651.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:05,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:05,188 INFO L168 Benchmark]: Boogie Preprocessor took 33.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:05,189 INFO L168 Benchmark]: RCFGBuilder took 624.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:05,190 INFO L168 Benchmark]: BuchiAutomizer took 20654.67 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 354.4 MB). Free memory was 1.1 GB in the beginning and 904.3 MB in the end (delta: 153.0 MB). Peak memory consumption was 507.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:05,192 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 651.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 624.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20654.67 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 354.4 MB). Free memory was 1.1 GB in the beginning and 904.3 MB in the end (delta: 153.0 MB). Peak memory consumption was 507.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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...