./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sum10-1.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/reducercommutativity/sum10-1.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 78e5d6b90ccf383f71b677cd9b9ca234bb8ccddb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:25:04,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:25:04,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:25:04,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:25:04,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:25:04,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:25:04,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:25:04,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:25:04,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:25:04,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:25:04,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:25:04,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:25:04,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:25:04,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:25:04,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:25:04,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:25:04,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:25:04,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:25:04,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:25:04,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:25:04,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:25:04,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:25:04,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:25:04,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:25:04,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:25:04,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:25:04,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:25:04,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:25:04,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:25:04,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:25:04,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:25:04,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:25:04,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:25:04,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:25:04,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:25:04,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:25:04,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:25:04,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:25:04,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:25:04,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:25:04,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:25:04,860 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:04,882 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:25:04,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:25:04,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:25:04,884 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:25:04,884 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:25:04,885 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:25:04,885 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:25:04,885 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:25:04,886 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:25:04,886 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:25:04,887 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:25:04,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:25:04,888 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:25:04,888 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:25:04,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:25:04,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:25:04,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:25:04,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:25:04,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:25:04,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:25:04,890 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:25:04,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:25:04,891 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:25:04,891 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:25:04,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:25:04,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:25:04,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:25:04,892 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:25:04,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:25:04,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:25:04,893 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:25:04,895 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:25:04,897 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:25:04,897 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 -> 78e5d6b90ccf383f71b677cd9b9ca234bb8ccddb [2020-07-29 03:25:05,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:25:05,199 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:25:05,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:25:05,204 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:25:05,205 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:25:05,206 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum10-1.i [2020-07-29 03:25:05,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f03631abf/60e306d542014c55b38f03c0046a34ff/FLAGc9e4f8549 [2020-07-29 03:25:05,808 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:25:05,809 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum10-1.i [2020-07-29 03:25:05,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f03631abf/60e306d542014c55b38f03c0046a34ff/FLAGc9e4f8549 [2020-07-29 03:25:06,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f03631abf/60e306d542014c55b38f03c0046a34ff [2020-07-29 03:25:06,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:25:06,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:25:06,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:06,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:25:06,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:25:06,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:06" (1/1) ... [2020-07-29 03:25:06,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11461533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:06, skipping insertion in model container [2020-07-29 03:25:06,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:06" (1/1) ... [2020-07-29 03:25:06,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:25:06,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:25:06,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:06,417 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:25:06,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:06,519 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:25:06,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:06 WrapperNode [2020-07-29 03:25:06,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:06,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:06,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:25:06,522 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:25:06,531 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:06" (1/1) ... [2020-07-29 03:25:06,540 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:06" (1/1) ... [2020-07-29 03:25:06,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:06,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:25:06,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:25:06,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:25:06,582 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:06" (1/1) ... [2020-07-29 03:25:06,583 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:06" (1/1) ... [2020-07-29 03:25:06,586 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:06" (1/1) ... [2020-07-29 03:25:06,586 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:06" (1/1) ... [2020-07-29 03:25:06,595 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:06" (1/1) ... [2020-07-29 03:25:06,601 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:06" (1/1) ... [2020-07-29 03:25:06,603 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:06" (1/1) ... [2020-07-29 03:25:06,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:25:06,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:25:06,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:25:06,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:25:06,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:06" (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:06,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:25:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:25:06,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:25:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:25:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:25:06,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:25:07,257 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:25:07,257 INFO L295 CfgBuilder]: Removed 15 assume(true) statements. [2020-07-29 03:25:07,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:07 BoogieIcfgContainer [2020-07-29 03:25:07,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:25:07,262 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:25:07,263 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:25:07,267 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:25:07,268 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:07,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:25:06" (1/3) ... [2020-07-29 03:25:07,270 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51d7163d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:07, skipping insertion in model container [2020-07-29 03:25:07,271 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:07,271 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:06" (2/3) ... [2020-07-29 03:25:07,272 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51d7163d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:07, skipping insertion in model container [2020-07-29 03:25:07,272 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:07,272 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:07" (3/3) ... [2020-07-29 03:25:07,275 INFO L371 chiAutomizerObserver]: Analyzing ICFG sum10-1.i [2020-07-29 03:25:07,330 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:25:07,331 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:25:07,331 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:25:07,331 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:25:07,332 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:25:07,332 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:25:07,332 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:25:07,332 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:25:07,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-29 03:25:07,377 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2020-07-29 03:25:07,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:07,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:07,383 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:25:07,383 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:07,383 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:25:07,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-29 03:25:07,389 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2020-07-29 03:25:07,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:07,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:07,390 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:25:07,390 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:07,399 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 26#L23-3true [2020-07-29 03:25:07,400 INFO L796 eck$LassoCheckResult]: Loop: 26#L23-3true assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 9#L23-2true main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26#L23-3true [2020-07-29 03:25:07,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:07,407 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 03:25:07,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:07,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320935377] [2020-07-29 03:25:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:07,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:07,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:07,551 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:07,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:07,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-07-29 03:25:07,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:07,554 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174936863] [2020-07-29 03:25:07,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:07,563 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:07,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:07,573 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:07,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:07,575 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-07-29 03:25:07,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:07,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958176693] [2020-07-29 03:25:07,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:07,597 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:07,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:07,615 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:07,884 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:07,885 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:07,885 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:07,885 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:07,885 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:07,886 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:07,886 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:07,886 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:07,887 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration1_Lasso [2020-07-29 03:25:07,887 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:07,887 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:07,930 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:07,939 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:07,944 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:07,949 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:07,953 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:07,960 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:07,966 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:07,970 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:07,975 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:07,980 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:07,987 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:07,992 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:07,997 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:08,002 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:08,007 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:08,076 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:08,081 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:08,087 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:08,620 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:08,625 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:08,632 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:08,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:08,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:08,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:08,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:08,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:08,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:08,649 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:08,657 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:08,691 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:08,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:08,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:08,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:08,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:08,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:08,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:08,696 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:08,698 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:08,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:08,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:08,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:08,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:08,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:08,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:08,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:08,753 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:08,758 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:08,809 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:08,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:08,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:08,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:08,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:08,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:08,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:08,816 INFO L402 nArgumentSynthesizer]: A total of 0 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:08,819 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:08,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:08,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:08,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:08,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:08,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:08,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:08,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:08,877 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) [2020-07-29 03:25:08,924 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:08,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:08,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:08,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:08,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:08,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:08,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:08,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:08,931 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) [2020-07-29 03:25:08,972 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:08,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:08,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:08,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:08,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:08,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:08,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:08,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:08,979 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) [2020-07-29 03:25:09,023 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:09,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:09,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:09,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:09,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:09,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:09,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:09,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:09,033 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:09,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:09,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:09,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:09,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:09,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:09,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:09,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:09,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:09,068 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:09,099 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:09,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:09,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:09,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:09,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:09,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:09,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:09,111 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) [2020-07-29 03:25:09,156 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:09,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:09,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:09,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:09,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:09,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:09,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:09,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:09,164 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:09,207 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:09,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:09,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:09,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:09,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:09,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:09,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:09,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:09,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:09,241 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:09,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:09,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:09,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:09,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:09,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:09,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:09,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:09,245 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:09,269 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:09,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:09,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:09,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:09,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:09,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:09,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:09,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:09,280 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) [2020-07-29 03:25:09,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 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:09,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:09,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:09,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:09,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:09,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:09,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:09,319 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) [2020-07-29 03:25:09,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:09,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:09,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:09,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:09,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:09,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:09,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:09,368 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 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:09,408 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:09,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:09,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:09,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:09,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:09,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:09,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:09,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:09,413 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:09,442 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:09,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:09,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:09,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:09,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:09,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:09,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:09,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:09,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:09,471 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:09,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:09,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:09,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:09,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:09,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:09,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:09,484 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:09,526 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:09,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:09,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:09,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:09,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:09,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:09,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:09,551 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:09,580 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 03:25:09,580 INFO L444 ModelExtractionUtils]: 1 out of 13 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 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:09,589 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:09,593 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:09,593 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:09,594 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 19 Supporting invariants [] [2020-07-29 03:25:09,659 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 03:25:09,665 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3;" "main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2;" [2020-07-29 03:25:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:09,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:09,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:09,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:09,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {35#unseeded} is VALID [2020-07-29 03:25:09,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#unseeded} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {35#unseeded} is VALID [2020-07-29 03:25:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:09,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:09,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:09,784 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~1) 19))} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {61#(and (< ULTIMATE.start_main_~i~1 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~1))))} is VALID [2020-07-29 03:25:09,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {61#(and (< ULTIMATE.start_main_~i~1 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~1))))} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {53#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~1) 19)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:09,786 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:09,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:09,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:09,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:09,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:09,888 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:09,890 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2020-07-29 03:25:10,061 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 69 states and 95 transitions. Complement of second has 7 states. [2020-07-29 03:25:10,062 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:10,062 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:10,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-29 03:25:10,065 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2020-07-29 03:25:10,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:10,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:10,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:10,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:10,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:10,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:10,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 95 transitions. [2020-07-29 03:25:10,078 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:10,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:10,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:10,081 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states. [2020-07-29 03:25:10,084 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2020-07-29 03:25:10,088 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 03:25:10,088 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:10,093 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:10,093 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:10,094 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 69 states and 95 transitions. cyclomatic complexity: 39 [2020-07-29 03:25:10,096 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:25:10,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:10,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:10,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:10,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:10,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:10,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:10,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:10,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:10,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:10,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 69 letters. Loop has 69 letters. [2020-07-29 03:25:10,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 69 letters. [2020-07-29 03:25:10,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 69 letters. Loop has 69 letters. [2020-07-29 03:25:10,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:25:10,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:25:10,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:25:10,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:10,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:10,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:10,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:10,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:10,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:10,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:10,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:10,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:10,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:10,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:10,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:10,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:10,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:10,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:10,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:10,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:10,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:10,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:10,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:10,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:10,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:10,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:10,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:10,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:10,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:10,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:10,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:25:10,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:25:10,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:25:10,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:10,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:10,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:10,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:10,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:10,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:10,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:10,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:10,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:10,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:10,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:10,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:10,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:10,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:10,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:10,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:10,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:10,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:10,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:10,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:10,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:10,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:10,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:10,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:10,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:10,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:10,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:10,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:10,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 95 transitions. cyclomatic complexity: 39 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:10,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,132 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2020-07-29 03:25:10,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:10,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:10,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 03:25:10,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:10,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 95 transitions. cyclomatic complexity: 39 [2020-07-29 03:25:10,147 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:10,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 19 states and 24 transitions. [2020-07-29 03:25:10,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 03:25:10,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:10,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2020-07-29 03:25:10,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:10,159 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-07-29 03:25:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2020-07-29 03:25:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-29 03:25:10,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:10,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 24 transitions. Second operand 19 states. [2020-07-29 03:25:10,191 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 24 transitions. Second operand 19 states. [2020-07-29 03:25:10,193 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 19 states. [2020-07-29 03:25:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:10,200 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-07-29 03:25:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-07-29 03:25:10,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:10,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:10,202 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states and 24 transitions. [2020-07-29 03:25:10,202 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states and 24 transitions. [2020-07-29 03:25:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:10,204 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-07-29 03:25:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-07-29 03:25:10,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:10,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:10,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:10,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 03:25:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-07-29 03:25:10,209 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-07-29 03:25:10,209 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-07-29 03:25:10,209 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:25:10,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-07-29 03:25:10,213 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:10,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:10,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:10,214 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:25:10,214 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:10,215 INFO L794 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 157#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 154#L23-3 assume !(main_~i~1 < 10); 153#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 146#L9-3 [2020-07-29 03:25:10,215 INFO L796 eck$LassoCheckResult]: Loop: 146#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 147#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 146#L9-3 [2020-07-29 03:25:10,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:10,215 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-07-29 03:25:10,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:10,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506825503] [2020-07-29 03:25:10,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:10,297 INFO L280 TraceCheckUtils]: 0: Hoare triple {204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {204#true} is VALID [2020-07-29 03:25:10,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {204#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {206#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:10,299 INFO L280 TraceCheckUtils]: 2: Hoare triple {206#(= 0 ULTIMATE.start_main_~i~1)} assume !(main_~i~1 < 10); {205#false} is VALID [2020-07-29 03:25:10,299 INFO L280 TraceCheckUtils]: 3: Hoare triple {205#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {205#false} is VALID [2020-07-29 03:25:10,300 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:10,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506825503] [2020-07-29 03:25:10,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:10,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:25:10,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301528690] [2020-07-29 03:25:10,305 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:10,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2020-07-29 03:25:10,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:10,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133840920] [2020-07-29 03:25:10,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:10,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:10,316 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:10,318 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:10,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:10,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:25:10,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:25:10,371 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 03:25:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:10,416 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-07-29 03:25:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:25:10,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:10,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:10,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2020-07-29 03:25:10,424 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:10,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2020-07-29 03:25:10,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:10,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:10,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2020-07-29 03:25:10,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:10,426 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-07-29 03:25:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2020-07-29 03:25:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-07-29 03:25:10,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:10,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 24 transitions. Second operand 19 states. [2020-07-29 03:25:10,429 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 24 transitions. Second operand 19 states. [2020-07-29 03:25:10,429 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 19 states. [2020-07-29 03:25:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:10,431 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-07-29 03:25:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-07-29 03:25:10,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:10,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:10,432 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states and 24 transitions. [2020-07-29 03:25:10,432 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states and 24 transitions. [2020-07-29 03:25:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:10,434 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-07-29 03:25:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-07-29 03:25:10,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:10,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:10,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:10,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 03:25:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-07-29 03:25:10,436 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-07-29 03:25:10,437 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-07-29 03:25:10,437 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:25:10,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2020-07-29 03:25:10,437 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:10,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:10,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:10,438 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:10,438 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:10,439 INFO L794 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 242#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 239#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 240#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 241#L23-3 assume !(main_~i~1 < 10); 238#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 231#L9-3 [2020-07-29 03:25:10,439 INFO L796 eck$LassoCheckResult]: Loop: 231#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 232#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 231#L9-3 [2020-07-29 03:25:10,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:10,439 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-07-29 03:25:10,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:10,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160065349] [2020-07-29 03:25:10,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:10,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {291#true} is VALID [2020-07-29 03:25:10,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {293#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:10,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {293#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {293#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:10,481 INFO L280 TraceCheckUtils]: 3: Hoare triple {293#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {294#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:10,482 INFO L280 TraceCheckUtils]: 4: Hoare triple {294#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < 10); {292#false} is VALID [2020-07-29 03:25:10,482 INFO L280 TraceCheckUtils]: 5: Hoare triple {292#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {292#false} is VALID [2020-07-29 03:25:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:10,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160065349] [2020-07-29 03:25:10,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709319987] [2020-07-29 03:25:10,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:10,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 03:25:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:10,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:10,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {291#true} is VALID [2020-07-29 03:25:10,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {291#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {301#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:10,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {301#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {301#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:10,629 INFO L280 TraceCheckUtils]: 3: Hoare triple {301#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {294#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:10,630 INFO L280 TraceCheckUtils]: 4: Hoare triple {294#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < 10); {292#false} is VALID [2020-07-29 03:25:10,630 INFO L280 TraceCheckUtils]: 5: Hoare triple {292#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {292#false} is VALID [2020-07-29 03:25:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:10,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:10,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-29 03:25:10,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129001433] [2020-07-29 03:25:10,632 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:10,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2020-07-29 03:25:10,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:10,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518212561] [2020-07-29 03:25:10,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:10,638 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:10,642 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:10,645 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:10,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:10,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:25:10,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:25:10,694 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-07-29 03:25:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:10,785 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-29 03:25:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:25:10,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:25:10,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:10,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2020-07-29 03:25:10,800 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:10,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2020-07-29 03:25:10,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:10,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:10,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2020-07-29 03:25:10,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:10,802 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-29 03:25:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2020-07-29 03:25:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-29 03:25:10,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:10,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 26 transitions. Second operand 21 states. [2020-07-29 03:25:10,804 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 26 transitions. Second operand 21 states. [2020-07-29 03:25:10,804 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 21 states. [2020-07-29 03:25:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:10,805 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-29 03:25:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-29 03:25:10,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:10,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:10,806 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states and 26 transitions. [2020-07-29 03:25:10,806 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states and 26 transitions. [2020-07-29 03:25:10,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:10,807 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-29 03:25:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-29 03:25:10,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:10,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:10,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:10,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 03:25:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-29 03:25:10,809 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-29 03:25:10,809 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-29 03:25:10,809 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:25:10,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2020-07-29 03:25:10,810 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:10,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:10,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:10,810 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-07-29 03:25:10,810 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:10,811 INFO L794 eck$LassoCheckResult]: Stem: 352#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 349#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 345#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 346#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 347#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 348#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 355#L23-3 assume !(main_~i~1 < 10); 344#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 337#L9-3 [2020-07-29 03:25:10,811 INFO L796 eck$LassoCheckResult]: Loop: 337#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 338#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 337#L9-3 [2020-07-29 03:25:10,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:10,811 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-07-29 03:25:10,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:10,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540786838] [2020-07-29 03:25:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:10,899 INFO L280 TraceCheckUtils]: 0: Hoare triple {403#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {403#true} is VALID [2020-07-29 03:25:10,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {405#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:10,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {405#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {405#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:10,903 INFO L280 TraceCheckUtils]: 3: Hoare triple {405#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {406#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:10,904 INFO L280 TraceCheckUtils]: 4: Hoare triple {406#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {406#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:10,905 INFO L280 TraceCheckUtils]: 5: Hoare triple {406#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {407#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:10,905 INFO L280 TraceCheckUtils]: 6: Hoare triple {407#(<= ULTIMATE.start_main_~i~1 2)} assume !(main_~i~1 < 10); {404#false} is VALID [2020-07-29 03:25:10,905 INFO L280 TraceCheckUtils]: 7: Hoare triple {404#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {404#false} is VALID [2020-07-29 03:25:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:10,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540786838] [2020-07-29 03:25:10,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936103122] [2020-07-29 03:25:10,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:10,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:25:10,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:10,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:10,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:11,028 INFO L280 TraceCheckUtils]: 0: Hoare triple {403#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {403#true} is VALID [2020-07-29 03:25:11,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {414#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:11,030 INFO L280 TraceCheckUtils]: 2: Hoare triple {414#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {414#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:11,031 INFO L280 TraceCheckUtils]: 3: Hoare triple {414#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {406#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:11,032 INFO L280 TraceCheckUtils]: 4: Hoare triple {406#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {406#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:11,033 INFO L280 TraceCheckUtils]: 5: Hoare triple {406#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {407#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:11,034 INFO L280 TraceCheckUtils]: 6: Hoare triple {407#(<= ULTIMATE.start_main_~i~1 2)} assume !(main_~i~1 < 10); {404#false} is VALID [2020-07-29 03:25:11,034 INFO L280 TraceCheckUtils]: 7: Hoare triple {404#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {404#false} is VALID [2020-07-29 03:25:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:11,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:11,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-29 03:25:11,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247087453] [2020-07-29 03:25:11,035 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2020-07-29 03:25:11,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:11,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011595327] [2020-07-29 03:25:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:11,041 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:11,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:11,047 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:11,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:11,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 03:25:11,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-29 03:25:11,084 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-07-29 03:25:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:11,185 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-29 03:25:11,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:25:11,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:25:11,201 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:11,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2020-07-29 03:25:11,202 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:11,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2020-07-29 03:25:11,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:11,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:11,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-07-29 03:25:11,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:11,206 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-29 03:25:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-07-29 03:25:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-29 03:25:11,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:11,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 28 transitions. Second operand 23 states. [2020-07-29 03:25:11,208 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 28 transitions. Second operand 23 states. [2020-07-29 03:25:11,208 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 23 states. [2020-07-29 03:25:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:11,211 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-29 03:25:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-29 03:25:11,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:11,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:11,212 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states and 28 transitions. [2020-07-29 03:25:11,212 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states and 28 transitions. [2020-07-29 03:25:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:11,214 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-29 03:25:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-29 03:25:11,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:11,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:11,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:11,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 03:25:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-29 03:25:11,217 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-29 03:25:11,218 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-29 03:25:11,218 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:25:11,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2020-07-29 03:25:11,222 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:11,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:11,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:11,223 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-07-29 03:25:11,223 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:11,224 INFO L794 eck$LassoCheckResult]: Stem: 473#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 470#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 466#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 467#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 468#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 469#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 478#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 477#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 476#L23-3 assume !(main_~i~1 < 10); 465#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 458#L9-3 [2020-07-29 03:25:11,224 INFO L796 eck$LassoCheckResult]: Loop: 458#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 459#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 458#L9-3 [2020-07-29 03:25:11,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:11,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-07-29 03:25:11,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:11,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385405641] [2020-07-29 03:25:11,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:11,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {530#true} is VALID [2020-07-29 03:25:11,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {530#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {532#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:11,332 INFO L280 TraceCheckUtils]: 2: Hoare triple {532#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {532#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:11,333 INFO L280 TraceCheckUtils]: 3: Hoare triple {532#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {533#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:11,334 INFO L280 TraceCheckUtils]: 4: Hoare triple {533#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {533#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:11,335 INFO L280 TraceCheckUtils]: 5: Hoare triple {533#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {534#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:11,336 INFO L280 TraceCheckUtils]: 6: Hoare triple {534#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {534#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:11,336 INFO L280 TraceCheckUtils]: 7: Hoare triple {534#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {535#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:11,337 INFO L280 TraceCheckUtils]: 8: Hoare triple {535#(<= ULTIMATE.start_main_~i~1 3)} assume !(main_~i~1 < 10); {531#false} is VALID [2020-07-29 03:25:11,338 INFO L280 TraceCheckUtils]: 9: Hoare triple {531#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {531#false} is VALID [2020-07-29 03:25:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:11,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385405641] [2020-07-29 03:25:11,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354661594] [2020-07-29 03:25:11,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:11,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-29 03:25:11,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:11,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:11,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:11,523 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {530#true} is VALID [2020-07-29 03:25:11,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {530#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {542#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:11,525 INFO L280 TraceCheckUtils]: 2: Hoare triple {542#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {542#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:11,527 INFO L280 TraceCheckUtils]: 3: Hoare triple {542#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {533#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:11,528 INFO L280 TraceCheckUtils]: 4: Hoare triple {533#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {533#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:11,528 INFO L280 TraceCheckUtils]: 5: Hoare triple {533#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {534#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:11,533 INFO L280 TraceCheckUtils]: 6: Hoare triple {534#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {534#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:11,535 INFO L280 TraceCheckUtils]: 7: Hoare triple {534#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {535#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:11,535 INFO L280 TraceCheckUtils]: 8: Hoare triple {535#(<= ULTIMATE.start_main_~i~1 3)} assume !(main_~i~1 < 10); {531#false} is VALID [2020-07-29 03:25:11,536 INFO L280 TraceCheckUtils]: 9: Hoare triple {531#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {531#false} is VALID [2020-07-29 03:25:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:11,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:11,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 03:25:11,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492435923] [2020-07-29 03:25:11,539 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:11,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:11,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2020-07-29 03:25:11,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:11,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288694650] [2020-07-29 03:25:11,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:11,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:11,558 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:11,561 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:11,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:11,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:25:11,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-29 03:25:11,603 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-07-29 03:25:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:11,731 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-29 03:25:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:25:11,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:25:11,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:11,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2020-07-29 03:25:11,754 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:11,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2020-07-29 03:25:11,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:11,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:11,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2020-07-29 03:25:11,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:11,756 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2020-07-29 03:25:11,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2020-07-29 03:25:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-29 03:25:11,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:11,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 30 transitions. Second operand 25 states. [2020-07-29 03:25:11,761 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 30 transitions. Second operand 25 states. [2020-07-29 03:25:11,761 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 25 states. [2020-07-29 03:25:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:11,763 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-29 03:25:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2020-07-29 03:25:11,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:11,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:11,764 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states and 30 transitions. [2020-07-29 03:25:11,764 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states and 30 transitions. [2020-07-29 03:25:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:11,769 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-29 03:25:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2020-07-29 03:25:11,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:11,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:11,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:11,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 03:25:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-29 03:25:11,772 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-29 03:25:11,772 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-29 03:25:11,773 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:25:11,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2020-07-29 03:25:11,773 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:11,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:11,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:11,775 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-07-29 03:25:11,776 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:11,776 INFO L794 eck$LassoCheckResult]: Stem: 610#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 606#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 602#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 603#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 604#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 605#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 607#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 616#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 615#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 614#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 613#L23-3 assume !(main_~i~1 < 10); 601#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 594#L9-3 [2020-07-29 03:25:11,776 INFO L796 eck$LassoCheckResult]: Loop: 594#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 595#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 594#L9-3 [2020-07-29 03:25:11,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:11,777 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-07-29 03:25:11,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:11,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399458049] [2020-07-29 03:25:11,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:11,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {672#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {672#true} is VALID [2020-07-29 03:25:11,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {672#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {674#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:11,903 INFO L280 TraceCheckUtils]: 2: Hoare triple {674#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {674#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:11,904 INFO L280 TraceCheckUtils]: 3: Hoare triple {674#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {675#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:11,907 INFO L280 TraceCheckUtils]: 4: Hoare triple {675#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {675#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:11,908 INFO L280 TraceCheckUtils]: 5: Hoare triple {675#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {676#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:11,909 INFO L280 TraceCheckUtils]: 6: Hoare triple {676#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {676#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:11,910 INFO L280 TraceCheckUtils]: 7: Hoare triple {676#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {677#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:11,911 INFO L280 TraceCheckUtils]: 8: Hoare triple {677#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {677#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:11,912 INFO L280 TraceCheckUtils]: 9: Hoare triple {677#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {678#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:11,913 INFO L280 TraceCheckUtils]: 10: Hoare triple {678#(<= ULTIMATE.start_main_~i~1 4)} assume !(main_~i~1 < 10); {673#false} is VALID [2020-07-29 03:25:11,914 INFO L280 TraceCheckUtils]: 11: Hoare triple {673#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {673#false} is VALID [2020-07-29 03:25:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:11,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399458049] [2020-07-29 03:25:11,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776331362] [2020-07-29 03:25:11,915 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:11,955 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 03:25:11,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:11,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:25:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:11,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:12,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {672#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {672#true} is VALID [2020-07-29 03:25:12,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {672#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {685#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:12,089 INFO L280 TraceCheckUtils]: 2: Hoare triple {685#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {685#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:12,090 INFO L280 TraceCheckUtils]: 3: Hoare triple {685#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {675#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:12,091 INFO L280 TraceCheckUtils]: 4: Hoare triple {675#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {675#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:12,092 INFO L280 TraceCheckUtils]: 5: Hoare triple {675#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {676#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:12,092 INFO L280 TraceCheckUtils]: 6: Hoare triple {676#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {676#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:12,093 INFO L280 TraceCheckUtils]: 7: Hoare triple {676#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {677#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:12,094 INFO L280 TraceCheckUtils]: 8: Hoare triple {677#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {677#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:12,095 INFO L280 TraceCheckUtils]: 9: Hoare triple {677#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {678#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:12,096 INFO L280 TraceCheckUtils]: 10: Hoare triple {678#(<= ULTIMATE.start_main_~i~1 4)} assume !(main_~i~1 < 10); {673#false} is VALID [2020-07-29 03:25:12,096 INFO L280 TraceCheckUtils]: 11: Hoare triple {673#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {673#false} is VALID [2020-07-29 03:25:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:12,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:12,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-29 03:25:12,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860295247] [2020-07-29 03:25:12,098 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:12,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:12,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2020-07-29 03:25:12,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:12,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489248489] [2020-07-29 03:25:12,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:12,108 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:12,115 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:12,117 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:12,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:12,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 03:25:12,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-29 03:25:12,158 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-07-29 03:25:12,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:12,318 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-29 03:25:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:25:12,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 03:25:12,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:12,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2020-07-29 03:25:12,345 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:12,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2020-07-29 03:25:12,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:12,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:12,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2020-07-29 03:25:12,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:12,347 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-29 03:25:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2020-07-29 03:25:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-29 03:25:12,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:12,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 32 transitions. Second operand 27 states. [2020-07-29 03:25:12,352 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 32 transitions. Second operand 27 states. [2020-07-29 03:25:12,352 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 27 states. [2020-07-29 03:25:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:12,354 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-29 03:25:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-29 03:25:12,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:12,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:12,355 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states and 32 transitions. [2020-07-29 03:25:12,355 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states and 32 transitions. [2020-07-29 03:25:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:12,358 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-29 03:25:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-29 03:25:12,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:12,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:12,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:12,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 03:25:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-07-29 03:25:12,364 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-29 03:25:12,364 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-29 03:25:12,364 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:25:12,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2020-07-29 03:25:12,365 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:12,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:12,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:12,366 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-07-29 03:25:12,366 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:12,366 INFO L794 eck$LassoCheckResult]: Stem: 759#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 757#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 753#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 754#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 755#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 756#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 758#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 769#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 768#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 767#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 766#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 765#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 764#L23-3 assume !(main_~i~1 < 10); 752#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 745#L9-3 [2020-07-29 03:25:12,366 INFO L796 eck$LassoCheckResult]: Loop: 745#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 746#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 745#L9-3 [2020-07-29 03:25:12,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:12,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-07-29 03:25:12,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:12,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517611931] [2020-07-29 03:25:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:12,458 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {829#true} is VALID [2020-07-29 03:25:12,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {831#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:12,460 INFO L280 TraceCheckUtils]: 2: Hoare triple {831#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {831#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:12,461 INFO L280 TraceCheckUtils]: 3: Hoare triple {831#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {832#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:12,461 INFO L280 TraceCheckUtils]: 4: Hoare triple {832#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {832#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:12,462 INFO L280 TraceCheckUtils]: 5: Hoare triple {832#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {833#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:12,463 INFO L280 TraceCheckUtils]: 6: Hoare triple {833#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {833#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:12,463 INFO L280 TraceCheckUtils]: 7: Hoare triple {833#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {834#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:12,464 INFO L280 TraceCheckUtils]: 8: Hoare triple {834#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {834#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:12,467 INFO L280 TraceCheckUtils]: 9: Hoare triple {834#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {835#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:12,469 INFO L280 TraceCheckUtils]: 10: Hoare triple {835#(<= ULTIMATE.start_main_~i~1 4)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {835#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:12,472 INFO L280 TraceCheckUtils]: 11: Hoare triple {835#(<= ULTIMATE.start_main_~i~1 4)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {836#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:12,473 INFO L280 TraceCheckUtils]: 12: Hoare triple {836#(<= ULTIMATE.start_main_~i~1 5)} assume !(main_~i~1 < 10); {830#false} is VALID [2020-07-29 03:25:12,473 INFO L280 TraceCheckUtils]: 13: Hoare triple {830#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {830#false} is VALID [2020-07-29 03:25:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:12,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517611931] [2020-07-29 03:25:12,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246655494] [2020-07-29 03:25:12,475 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:12,515 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-29 03:25:12,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:12,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:25:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:12,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:12,682 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {829#true} is VALID [2020-07-29 03:25:12,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {843#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:12,684 INFO L280 TraceCheckUtils]: 2: Hoare triple {843#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {843#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:12,684 INFO L280 TraceCheckUtils]: 3: Hoare triple {843#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {832#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:12,685 INFO L280 TraceCheckUtils]: 4: Hoare triple {832#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {832#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:12,686 INFO L280 TraceCheckUtils]: 5: Hoare triple {832#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {833#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:12,687 INFO L280 TraceCheckUtils]: 6: Hoare triple {833#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {833#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:12,688 INFO L280 TraceCheckUtils]: 7: Hoare triple {833#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {834#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:12,688 INFO L280 TraceCheckUtils]: 8: Hoare triple {834#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {834#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:12,689 INFO L280 TraceCheckUtils]: 9: Hoare triple {834#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {835#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:12,690 INFO L280 TraceCheckUtils]: 10: Hoare triple {835#(<= ULTIMATE.start_main_~i~1 4)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {835#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:12,691 INFO L280 TraceCheckUtils]: 11: Hoare triple {835#(<= ULTIMATE.start_main_~i~1 4)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {836#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:12,692 INFO L280 TraceCheckUtils]: 12: Hoare triple {836#(<= ULTIMATE.start_main_~i~1 5)} assume !(main_~i~1 < 10); {830#false} is VALID [2020-07-29 03:25:12,692 INFO L280 TraceCheckUtils]: 13: Hoare triple {830#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {830#false} is VALID [2020-07-29 03:25:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:12,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:12,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-07-29 03:25:12,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364473625] [2020-07-29 03:25:12,694 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2020-07-29 03:25:12,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:12,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368657747] [2020-07-29 03:25:12,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:12,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:12,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:12,702 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:12,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:12,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 03:25:12,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-29 03:25:12,741 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 9 states. [2020-07-29 03:25:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:12,903 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-29 03:25:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 03:25:12,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:25:12,924 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:12,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2020-07-29 03:25:12,926 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:12,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2020-07-29 03:25:12,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:12,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:12,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2020-07-29 03:25:12,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:12,928 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-29 03:25:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2020-07-29 03:25:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-29 03:25:12,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:12,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 34 transitions. Second operand 29 states. [2020-07-29 03:25:12,932 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 34 transitions. Second operand 29 states. [2020-07-29 03:25:12,932 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 29 states. [2020-07-29 03:25:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:12,933 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-29 03:25:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-29 03:25:12,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:12,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:12,934 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states and 34 transitions. [2020-07-29 03:25:12,934 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states and 34 transitions. [2020-07-29 03:25:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:12,936 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-29 03:25:12,936 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-29 03:25:12,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:12,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:12,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:12,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 03:25:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-29 03:25:12,938 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-29 03:25:12,938 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-29 03:25:12,938 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:25:12,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2020-07-29 03:25:12,939 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:12,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:12,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:12,942 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2020-07-29 03:25:12,942 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:12,943 INFO L794 eck$LassoCheckResult]: Stem: 927#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 923#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 919#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 920#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 921#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 922#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 924#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 937#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 936#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 935#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 934#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 933#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 932#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 931#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 930#L23-3 assume !(main_~i~1 < 10); 918#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 911#L9-3 [2020-07-29 03:25:12,943 INFO L796 eck$LassoCheckResult]: Loop: 911#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 912#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 911#L9-3 [2020-07-29 03:25:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:12,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2020-07-29 03:25:12,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:12,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626077067] [2020-07-29 03:25:12,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:13,055 INFO L280 TraceCheckUtils]: 0: Hoare triple {1001#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1001#true} is VALID [2020-07-29 03:25:13,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {1001#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {1003#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:13,057 INFO L280 TraceCheckUtils]: 2: Hoare triple {1003#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1003#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:13,058 INFO L280 TraceCheckUtils]: 3: Hoare triple {1003#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1004#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:13,059 INFO L280 TraceCheckUtils]: 4: Hoare triple {1004#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1004#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:13,060 INFO L280 TraceCheckUtils]: 5: Hoare triple {1004#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1005#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:13,060 INFO L280 TraceCheckUtils]: 6: Hoare triple {1005#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1005#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:13,062 INFO L280 TraceCheckUtils]: 7: Hoare triple {1005#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1006#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:13,062 INFO L280 TraceCheckUtils]: 8: Hoare triple {1006#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1006#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:13,063 INFO L280 TraceCheckUtils]: 9: Hoare triple {1006#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1007#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:13,064 INFO L280 TraceCheckUtils]: 10: Hoare triple {1007#(<= ULTIMATE.start_main_~i~1 4)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1007#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:13,065 INFO L280 TraceCheckUtils]: 11: Hoare triple {1007#(<= ULTIMATE.start_main_~i~1 4)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1008#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:13,065 INFO L280 TraceCheckUtils]: 12: Hoare triple {1008#(<= ULTIMATE.start_main_~i~1 5)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1008#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:13,067 INFO L280 TraceCheckUtils]: 13: Hoare triple {1008#(<= ULTIMATE.start_main_~i~1 5)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1009#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:13,078 INFO L280 TraceCheckUtils]: 14: Hoare triple {1009#(<= ULTIMATE.start_main_~i~1 6)} assume !(main_~i~1 < 10); {1002#false} is VALID [2020-07-29 03:25:13,078 INFO L280 TraceCheckUtils]: 15: Hoare triple {1002#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {1002#false} is VALID [2020-07-29 03:25:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:13,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626077067] [2020-07-29 03:25:13,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354045075] [2020-07-29 03:25:13,079 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:13,127 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-29 03:25:13,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:13,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:25:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:13,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:13,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {1001#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1001#true} is VALID [2020-07-29 03:25:13,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {1001#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {1016#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:13,308 INFO L280 TraceCheckUtils]: 2: Hoare triple {1016#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1016#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:13,309 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1004#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:13,310 INFO L280 TraceCheckUtils]: 4: Hoare triple {1004#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1004#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:13,312 INFO L280 TraceCheckUtils]: 5: Hoare triple {1004#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1005#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:13,313 INFO L280 TraceCheckUtils]: 6: Hoare triple {1005#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1005#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:13,313 INFO L280 TraceCheckUtils]: 7: Hoare triple {1005#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1006#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:13,314 INFO L280 TraceCheckUtils]: 8: Hoare triple {1006#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1006#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:13,314 INFO L280 TraceCheckUtils]: 9: Hoare triple {1006#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1007#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:13,315 INFO L280 TraceCheckUtils]: 10: Hoare triple {1007#(<= ULTIMATE.start_main_~i~1 4)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1007#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:13,315 INFO L280 TraceCheckUtils]: 11: Hoare triple {1007#(<= ULTIMATE.start_main_~i~1 4)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1008#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:13,316 INFO L280 TraceCheckUtils]: 12: Hoare triple {1008#(<= ULTIMATE.start_main_~i~1 5)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1008#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:13,316 INFO L280 TraceCheckUtils]: 13: Hoare triple {1008#(<= ULTIMATE.start_main_~i~1 5)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1009#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:13,317 INFO L280 TraceCheckUtils]: 14: Hoare triple {1009#(<= ULTIMATE.start_main_~i~1 6)} assume !(main_~i~1 < 10); {1002#false} is VALID [2020-07-29 03:25:13,317 INFO L280 TraceCheckUtils]: 15: Hoare triple {1002#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {1002#false} is VALID [2020-07-29 03:25:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:13,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:13,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-29 03:25:13,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310658483] [2020-07-29 03:25:13,319 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:13,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:13,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 7 times [2020-07-29 03:25:13,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:13,319 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935393340] [2020-07-29 03:25:13,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:13,324 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:13,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:13,330 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:13,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:13,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 03:25:13,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-29 03:25:13,385 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 10 states. [2020-07-29 03:25:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:13,478 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-29 03:25:13,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:25:13,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 03:25:13,517 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:13,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2020-07-29 03:25:13,519 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:13,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2020-07-29 03:25:13,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:13,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:13,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2020-07-29 03:25:13,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:13,521 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-29 03:25:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2020-07-29 03:25:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-07-29 03:25:13,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:13,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states and 36 transitions. Second operand 31 states. [2020-07-29 03:25:13,529 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states and 36 transitions. Second operand 31 states. [2020-07-29 03:25:13,529 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 31 states. [2020-07-29 03:25:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:13,531 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-29 03:25:13,532 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-29 03:25:13,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:13,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:13,532 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states and 36 transitions. [2020-07-29 03:25:13,532 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states and 36 transitions. [2020-07-29 03:25:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:13,533 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-29 03:25:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-29 03:25:13,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:13,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:13,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:13,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 03:25:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-29 03:25:13,536 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-29 03:25:13,536 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-29 03:25:13,536 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:25:13,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2020-07-29 03:25:13,537 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:13,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:13,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:13,537 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2020-07-29 03:25:13,538 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:13,538 INFO L794 eck$LassoCheckResult]: Stem: 1106#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1104#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1100#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1101#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1102#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1103#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1105#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1120#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1119#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1118#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1117#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1116#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1115#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1114#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1113#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1112#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1111#L23-3 assume !(main_~i~1 < 10); 1099#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1092#L9-3 [2020-07-29 03:25:13,538 INFO L796 eck$LassoCheckResult]: Loop: 1092#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1093#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1092#L9-3 [2020-07-29 03:25:13,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:13,539 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2020-07-29 03:25:13,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:13,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154631178] [2020-07-29 03:25:13,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:13,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {1188#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1188#true} is VALID [2020-07-29 03:25:13,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {1188#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {1190#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:13,642 INFO L280 TraceCheckUtils]: 2: Hoare triple {1190#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1190#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:13,643 INFO L280 TraceCheckUtils]: 3: Hoare triple {1190#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1191#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:13,644 INFO L280 TraceCheckUtils]: 4: Hoare triple {1191#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1191#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:13,646 INFO L280 TraceCheckUtils]: 5: Hoare triple {1191#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1192#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:13,648 INFO L280 TraceCheckUtils]: 6: Hoare triple {1192#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1192#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:13,648 INFO L280 TraceCheckUtils]: 7: Hoare triple {1192#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1193#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:13,649 INFO L280 TraceCheckUtils]: 8: Hoare triple {1193#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1193#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:13,650 INFO L280 TraceCheckUtils]: 9: Hoare triple {1193#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1194#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:13,650 INFO L280 TraceCheckUtils]: 10: Hoare triple {1194#(<= ULTIMATE.start_main_~i~1 4)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1194#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:13,651 INFO L280 TraceCheckUtils]: 11: Hoare triple {1194#(<= ULTIMATE.start_main_~i~1 4)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1195#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:13,651 INFO L280 TraceCheckUtils]: 12: Hoare triple {1195#(<= ULTIMATE.start_main_~i~1 5)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1195#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:13,652 INFO L280 TraceCheckUtils]: 13: Hoare triple {1195#(<= ULTIMATE.start_main_~i~1 5)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1196#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:13,652 INFO L280 TraceCheckUtils]: 14: Hoare triple {1196#(<= ULTIMATE.start_main_~i~1 6)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1196#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:13,653 INFO L280 TraceCheckUtils]: 15: Hoare triple {1196#(<= ULTIMATE.start_main_~i~1 6)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1197#(<= ULTIMATE.start_main_~i~1 7)} is VALID [2020-07-29 03:25:13,653 INFO L280 TraceCheckUtils]: 16: Hoare triple {1197#(<= ULTIMATE.start_main_~i~1 7)} assume !(main_~i~1 < 10); {1189#false} is VALID [2020-07-29 03:25:13,653 INFO L280 TraceCheckUtils]: 17: Hoare triple {1189#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {1189#false} is VALID [2020-07-29 03:25:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:13,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154631178] [2020-07-29 03:25:13,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364117482] [2020-07-29 03:25:13,654 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:13,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:25:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:13,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:13,906 INFO L280 TraceCheckUtils]: 0: Hoare triple {1188#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1188#true} is VALID [2020-07-29 03:25:13,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {1188#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {1204#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:13,914 INFO L280 TraceCheckUtils]: 2: Hoare triple {1204#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1204#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:13,916 INFO L280 TraceCheckUtils]: 3: Hoare triple {1204#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1191#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:13,916 INFO L280 TraceCheckUtils]: 4: Hoare triple {1191#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1191#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:13,918 INFO L280 TraceCheckUtils]: 5: Hoare triple {1191#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1192#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:13,918 INFO L280 TraceCheckUtils]: 6: Hoare triple {1192#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1192#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:13,919 INFO L280 TraceCheckUtils]: 7: Hoare triple {1192#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1193#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:13,919 INFO L280 TraceCheckUtils]: 8: Hoare triple {1193#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1193#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:13,920 INFO L280 TraceCheckUtils]: 9: Hoare triple {1193#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1194#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:13,920 INFO L280 TraceCheckUtils]: 10: Hoare triple {1194#(<= ULTIMATE.start_main_~i~1 4)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1194#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:13,921 INFO L280 TraceCheckUtils]: 11: Hoare triple {1194#(<= ULTIMATE.start_main_~i~1 4)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1195#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:13,922 INFO L280 TraceCheckUtils]: 12: Hoare triple {1195#(<= ULTIMATE.start_main_~i~1 5)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1195#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:13,922 INFO L280 TraceCheckUtils]: 13: Hoare triple {1195#(<= ULTIMATE.start_main_~i~1 5)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1196#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:13,923 INFO L280 TraceCheckUtils]: 14: Hoare triple {1196#(<= ULTIMATE.start_main_~i~1 6)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1196#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:13,925 INFO L280 TraceCheckUtils]: 15: Hoare triple {1196#(<= ULTIMATE.start_main_~i~1 6)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1197#(<= ULTIMATE.start_main_~i~1 7)} is VALID [2020-07-29 03:25:13,925 INFO L280 TraceCheckUtils]: 16: Hoare triple {1197#(<= ULTIMATE.start_main_~i~1 7)} assume !(main_~i~1 < 10); {1189#false} is VALID [2020-07-29 03:25:13,925 INFO L280 TraceCheckUtils]: 17: Hoare triple {1189#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {1189#false} is VALID [2020-07-29 03:25:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:13,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:13,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-07-29 03:25:13,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240145665] [2020-07-29 03:25:13,927 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:13,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:13,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 8 times [2020-07-29 03:25:13,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:13,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504777788] [2020-07-29 03:25:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:13,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:13,933 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:13,935 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:13,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:13,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 03:25:13,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-29 03:25:13,977 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 9 Second operand 11 states. [2020-07-29 03:25:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:14,181 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-29 03:25:14,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 03:25:14,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 03:25:14,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:14,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2020-07-29 03:25:14,213 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:14,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 38 transitions. [2020-07-29 03:25:14,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:14,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:14,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 38 transitions. [2020-07-29 03:25:14,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:14,215 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-07-29 03:25:14,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 38 transitions. [2020-07-29 03:25:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-29 03:25:14,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:14,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 38 transitions. Second operand 33 states. [2020-07-29 03:25:14,217 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 38 transitions. Second operand 33 states. [2020-07-29 03:25:14,218 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 33 states. [2020-07-29 03:25:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:14,218 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-29 03:25:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-29 03:25:14,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:14,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:14,219 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states and 38 transitions. [2020-07-29 03:25:14,219 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states and 38 transitions. [2020-07-29 03:25:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:14,220 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-29 03:25:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-29 03:25:14,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:14,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:14,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:14,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 03:25:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-29 03:25:14,222 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-29 03:25:14,222 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-29 03:25:14,222 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 03:25:14,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2020-07-29 03:25:14,223 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:14,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:14,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:14,223 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2020-07-29 03:25:14,223 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:14,224 INFO L794 eck$LassoCheckResult]: Stem: 1302#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1300#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1296#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1297#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1298#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1299#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1301#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1318#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1317#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1316#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1315#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1314#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1313#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1312#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1311#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1310#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1309#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1308#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1307#L23-3 assume !(main_~i~1 < 10); 1295#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1288#L9-3 [2020-07-29 03:25:14,224 INFO L796 eck$LassoCheckResult]: Loop: 1288#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1289#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1288#L9-3 [2020-07-29 03:25:14,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:14,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2020-07-29 03:25:14,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:14,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632712231] [2020-07-29 03:25:14,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:14,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {1390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1390#true} is VALID [2020-07-29 03:25:14,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {1390#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {1392#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:14,346 INFO L280 TraceCheckUtils]: 2: Hoare triple {1392#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1392#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:14,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {1392#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1393#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:14,348 INFO L280 TraceCheckUtils]: 4: Hoare triple {1393#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1393#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:14,348 INFO L280 TraceCheckUtils]: 5: Hoare triple {1393#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1394#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:14,349 INFO L280 TraceCheckUtils]: 6: Hoare triple {1394#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1394#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:14,350 INFO L280 TraceCheckUtils]: 7: Hoare triple {1394#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1395#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:14,351 INFO L280 TraceCheckUtils]: 8: Hoare triple {1395#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1395#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:14,352 INFO L280 TraceCheckUtils]: 9: Hoare triple {1395#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1396#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:14,352 INFO L280 TraceCheckUtils]: 10: Hoare triple {1396#(<= ULTIMATE.start_main_~i~1 4)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1396#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:14,354 INFO L280 TraceCheckUtils]: 11: Hoare triple {1396#(<= ULTIMATE.start_main_~i~1 4)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1397#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:14,354 INFO L280 TraceCheckUtils]: 12: Hoare triple {1397#(<= ULTIMATE.start_main_~i~1 5)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1397#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:14,355 INFO L280 TraceCheckUtils]: 13: Hoare triple {1397#(<= ULTIMATE.start_main_~i~1 5)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1398#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:14,356 INFO L280 TraceCheckUtils]: 14: Hoare triple {1398#(<= ULTIMATE.start_main_~i~1 6)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1398#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:14,357 INFO L280 TraceCheckUtils]: 15: Hoare triple {1398#(<= ULTIMATE.start_main_~i~1 6)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1399#(<= ULTIMATE.start_main_~i~1 7)} is VALID [2020-07-29 03:25:14,358 INFO L280 TraceCheckUtils]: 16: Hoare triple {1399#(<= ULTIMATE.start_main_~i~1 7)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1399#(<= ULTIMATE.start_main_~i~1 7)} is VALID [2020-07-29 03:25:14,359 INFO L280 TraceCheckUtils]: 17: Hoare triple {1399#(<= ULTIMATE.start_main_~i~1 7)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1400#(<= ULTIMATE.start_main_~i~1 8)} is VALID [2020-07-29 03:25:14,360 INFO L280 TraceCheckUtils]: 18: Hoare triple {1400#(<= ULTIMATE.start_main_~i~1 8)} assume !(main_~i~1 < 10); {1391#false} is VALID [2020-07-29 03:25:14,360 INFO L280 TraceCheckUtils]: 19: Hoare triple {1391#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {1391#false} is VALID [2020-07-29 03:25:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:14,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632712231] [2020-07-29 03:25:14,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516046110] [2020-07-29 03:25:14,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:14,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:25:14,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:14,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:25:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:14,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:14,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {1390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1390#true} is VALID [2020-07-29 03:25:14,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {1390#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {1407#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:14,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {1407#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1407#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:14,624 INFO L280 TraceCheckUtils]: 3: Hoare triple {1407#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1393#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:14,625 INFO L280 TraceCheckUtils]: 4: Hoare triple {1393#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1393#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:14,626 INFO L280 TraceCheckUtils]: 5: Hoare triple {1393#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1394#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:14,626 INFO L280 TraceCheckUtils]: 6: Hoare triple {1394#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1394#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:14,627 INFO L280 TraceCheckUtils]: 7: Hoare triple {1394#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1395#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:14,628 INFO L280 TraceCheckUtils]: 8: Hoare triple {1395#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1395#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:14,635 INFO L280 TraceCheckUtils]: 9: Hoare triple {1395#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1396#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:14,636 INFO L280 TraceCheckUtils]: 10: Hoare triple {1396#(<= ULTIMATE.start_main_~i~1 4)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1396#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:14,636 INFO L280 TraceCheckUtils]: 11: Hoare triple {1396#(<= ULTIMATE.start_main_~i~1 4)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1397#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:14,637 INFO L280 TraceCheckUtils]: 12: Hoare triple {1397#(<= ULTIMATE.start_main_~i~1 5)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1397#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:14,638 INFO L280 TraceCheckUtils]: 13: Hoare triple {1397#(<= ULTIMATE.start_main_~i~1 5)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1398#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:14,638 INFO L280 TraceCheckUtils]: 14: Hoare triple {1398#(<= ULTIMATE.start_main_~i~1 6)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1398#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:14,639 INFO L280 TraceCheckUtils]: 15: Hoare triple {1398#(<= ULTIMATE.start_main_~i~1 6)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1399#(<= ULTIMATE.start_main_~i~1 7)} is VALID [2020-07-29 03:25:14,640 INFO L280 TraceCheckUtils]: 16: Hoare triple {1399#(<= ULTIMATE.start_main_~i~1 7)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1399#(<= ULTIMATE.start_main_~i~1 7)} is VALID [2020-07-29 03:25:14,640 INFO L280 TraceCheckUtils]: 17: Hoare triple {1399#(<= ULTIMATE.start_main_~i~1 7)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1400#(<= ULTIMATE.start_main_~i~1 8)} is VALID [2020-07-29 03:25:14,641 INFO L280 TraceCheckUtils]: 18: Hoare triple {1400#(<= ULTIMATE.start_main_~i~1 8)} assume !(main_~i~1 < 10); {1391#false} is VALID [2020-07-29 03:25:14,641 INFO L280 TraceCheckUtils]: 19: Hoare triple {1391#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {1391#false} is VALID [2020-07-29 03:25:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:14,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:14,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-07-29 03:25:14,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724634769] [2020-07-29 03:25:14,644 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:14,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 9 times [2020-07-29 03:25:14,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:14,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082676204] [2020-07-29 03:25:14,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:14,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:14,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:14,661 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:14,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:14,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 03:25:14,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-07-29 03:25:14,698 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 12 states. [2020-07-29 03:25:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:14,925 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-29 03:25:14,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 03:25:14,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 03:25:14,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:14,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2020-07-29 03:25:14,965 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:14,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2020-07-29 03:25:14,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:14,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:14,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2020-07-29 03:25:14,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:14,967 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-07-29 03:25:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2020-07-29 03:25:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-29 03:25:14,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:14,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 40 transitions. Second operand 35 states. [2020-07-29 03:25:14,969 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 40 transitions. Second operand 35 states. [2020-07-29 03:25:14,969 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 35 states. [2020-07-29 03:25:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:14,970 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-29 03:25:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-29 03:25:14,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:14,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:14,971 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states and 40 transitions. [2020-07-29 03:25:14,971 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states and 40 transitions. [2020-07-29 03:25:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:14,971 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-29 03:25:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-29 03:25:14,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:14,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:14,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:14,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-29 03:25:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-29 03:25:14,973 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-29 03:25:14,973 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-29 03:25:14,973 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 03:25:14,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 39 transitions. [2020-07-29 03:25:14,973 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:14,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:14,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:14,974 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2020-07-29 03:25:14,974 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:14,974 INFO L794 eck$LassoCheckResult]: Stem: 1515#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1511#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1507#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1508#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1509#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1510#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1512#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1531#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1530#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1529#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1528#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1527#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1526#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1525#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1524#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1523#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1522#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1521#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1520#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1519#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1518#L23-3 assume !(main_~i~1 < 10); 1506#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1499#L9-3 [2020-07-29 03:25:14,974 INFO L796 eck$LassoCheckResult]: Loop: 1499#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1500#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1499#L9-3 [2020-07-29 03:25:14,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:14,975 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2020-07-29 03:25:14,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:14,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126317332] [2020-07-29 03:25:14,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:15,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1607#true} is VALID [2020-07-29 03:25:15,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {1607#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {1609#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:15,138 INFO L280 TraceCheckUtils]: 2: Hoare triple {1609#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1609#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:15,139 INFO L280 TraceCheckUtils]: 3: Hoare triple {1609#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1610#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:15,139 INFO L280 TraceCheckUtils]: 4: Hoare triple {1610#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1610#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:15,140 INFO L280 TraceCheckUtils]: 5: Hoare triple {1610#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1611#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:15,140 INFO L280 TraceCheckUtils]: 6: Hoare triple {1611#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1611#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:15,141 INFO L280 TraceCheckUtils]: 7: Hoare triple {1611#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1612#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:15,141 INFO L280 TraceCheckUtils]: 8: Hoare triple {1612#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1612#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:15,142 INFO L280 TraceCheckUtils]: 9: Hoare triple {1612#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1613#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:15,143 INFO L280 TraceCheckUtils]: 10: Hoare triple {1613#(<= ULTIMATE.start_main_~i~1 4)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1613#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:15,144 INFO L280 TraceCheckUtils]: 11: Hoare triple {1613#(<= ULTIMATE.start_main_~i~1 4)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1614#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:15,144 INFO L280 TraceCheckUtils]: 12: Hoare triple {1614#(<= ULTIMATE.start_main_~i~1 5)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1614#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:15,145 INFO L280 TraceCheckUtils]: 13: Hoare triple {1614#(<= ULTIMATE.start_main_~i~1 5)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1615#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:15,145 INFO L280 TraceCheckUtils]: 14: Hoare triple {1615#(<= ULTIMATE.start_main_~i~1 6)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1615#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:15,146 INFO L280 TraceCheckUtils]: 15: Hoare triple {1615#(<= ULTIMATE.start_main_~i~1 6)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1616#(<= ULTIMATE.start_main_~i~1 7)} is VALID [2020-07-29 03:25:15,146 INFO L280 TraceCheckUtils]: 16: Hoare triple {1616#(<= ULTIMATE.start_main_~i~1 7)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1616#(<= ULTIMATE.start_main_~i~1 7)} is VALID [2020-07-29 03:25:15,147 INFO L280 TraceCheckUtils]: 17: Hoare triple {1616#(<= ULTIMATE.start_main_~i~1 7)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1617#(<= ULTIMATE.start_main_~i~1 8)} is VALID [2020-07-29 03:25:15,148 INFO L280 TraceCheckUtils]: 18: Hoare triple {1617#(<= ULTIMATE.start_main_~i~1 8)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1617#(<= ULTIMATE.start_main_~i~1 8)} is VALID [2020-07-29 03:25:15,149 INFO L280 TraceCheckUtils]: 19: Hoare triple {1617#(<= ULTIMATE.start_main_~i~1 8)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1618#(<= ULTIMATE.start_main_~i~1 9)} is VALID [2020-07-29 03:25:15,149 INFO L280 TraceCheckUtils]: 20: Hoare triple {1618#(<= ULTIMATE.start_main_~i~1 9)} assume !(main_~i~1 < 10); {1608#false} is VALID [2020-07-29 03:25:15,149 INFO L280 TraceCheckUtils]: 21: Hoare triple {1608#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {1608#false} is VALID [2020-07-29 03:25:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:15,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126317332] [2020-07-29 03:25:15,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982602727] [2020-07-29 03:25:15,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:15,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-07-29 03:25:15,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:15,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 03:25:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:15,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:15,533 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1607#true} is VALID [2020-07-29 03:25:15,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {1607#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {1625#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:15,535 INFO L280 TraceCheckUtils]: 2: Hoare triple {1625#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1625#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:15,536 INFO L280 TraceCheckUtils]: 3: Hoare triple {1625#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1610#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:15,536 INFO L280 TraceCheckUtils]: 4: Hoare triple {1610#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1610#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:15,537 INFO L280 TraceCheckUtils]: 5: Hoare triple {1610#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1611#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:15,538 INFO L280 TraceCheckUtils]: 6: Hoare triple {1611#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1611#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:15,538 INFO L280 TraceCheckUtils]: 7: Hoare triple {1611#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1612#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:15,539 INFO L280 TraceCheckUtils]: 8: Hoare triple {1612#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1612#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:25:15,539 INFO L280 TraceCheckUtils]: 9: Hoare triple {1612#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1613#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:15,545 INFO L280 TraceCheckUtils]: 10: Hoare triple {1613#(<= ULTIMATE.start_main_~i~1 4)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1613#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:25:15,547 INFO L280 TraceCheckUtils]: 11: Hoare triple {1613#(<= ULTIMATE.start_main_~i~1 4)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1614#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:15,547 INFO L280 TraceCheckUtils]: 12: Hoare triple {1614#(<= ULTIMATE.start_main_~i~1 5)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1614#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-29 03:25:15,548 INFO L280 TraceCheckUtils]: 13: Hoare triple {1614#(<= ULTIMATE.start_main_~i~1 5)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1615#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:15,549 INFO L280 TraceCheckUtils]: 14: Hoare triple {1615#(<= ULTIMATE.start_main_~i~1 6)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1615#(<= ULTIMATE.start_main_~i~1 6)} is VALID [2020-07-29 03:25:15,552 INFO L280 TraceCheckUtils]: 15: Hoare triple {1615#(<= ULTIMATE.start_main_~i~1 6)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1616#(<= ULTIMATE.start_main_~i~1 7)} is VALID [2020-07-29 03:25:15,552 INFO L280 TraceCheckUtils]: 16: Hoare triple {1616#(<= ULTIMATE.start_main_~i~1 7)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1616#(<= ULTIMATE.start_main_~i~1 7)} is VALID [2020-07-29 03:25:15,556 INFO L280 TraceCheckUtils]: 17: Hoare triple {1616#(<= ULTIMATE.start_main_~i~1 7)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1617#(<= ULTIMATE.start_main_~i~1 8)} is VALID [2020-07-29 03:25:15,557 INFO L280 TraceCheckUtils]: 18: Hoare triple {1617#(<= ULTIMATE.start_main_~i~1 8)} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1617#(<= ULTIMATE.start_main_~i~1 8)} is VALID [2020-07-29 03:25:15,558 INFO L280 TraceCheckUtils]: 19: Hoare triple {1617#(<= ULTIMATE.start_main_~i~1 8)} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1618#(<= ULTIMATE.start_main_~i~1 9)} is VALID [2020-07-29 03:25:15,559 INFO L280 TraceCheckUtils]: 20: Hoare triple {1618#(<= ULTIMATE.start_main_~i~1 9)} assume !(main_~i~1 < 10); {1608#false} is VALID [2020-07-29 03:25:15,559 INFO L280 TraceCheckUtils]: 21: Hoare triple {1608#false} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {1608#false} is VALID [2020-07-29 03:25:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:15,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:15,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-07-29 03:25:15,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522760124] [2020-07-29 03:25:15,561 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:15,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:15,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 10 times [2020-07-29 03:25:15,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:15,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346706765] [2020-07-29 03:25:15,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:15,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:15,567 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:15,569 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:15,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:15,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 03:25:15,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-07-29 03:25:15,610 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. cyclomatic complexity: 9 Second operand 13 states. [2020-07-29 03:25:15,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:15,766 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-29 03:25:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 03:25:15,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 03:25:15,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:15,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2020-07-29 03:25:15,826 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:15,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2020-07-29 03:25:15,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:15,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:15,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2020-07-29 03:25:15,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:15,829 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-07-29 03:25:15,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2020-07-29 03:25:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-29 03:25:15,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:15,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states and 41 transitions. Second operand 37 states. [2020-07-29 03:25:15,831 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states and 41 transitions. Second operand 37 states. [2020-07-29 03:25:15,831 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 37 states. [2020-07-29 03:25:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:15,832 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-29 03:25:15,832 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-29 03:25:15,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:15,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:15,832 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states and 41 transitions. [2020-07-29 03:25:15,833 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states and 41 transitions. [2020-07-29 03:25:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:15,833 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-29 03:25:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-29 03:25:15,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:15,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:15,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:15,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-29 03:25:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-07-29 03:25:15,835 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-07-29 03:25:15,835 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-07-29 03:25:15,835 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-29 03:25:15,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2020-07-29 03:25:15,836 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:15,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:15,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:15,836 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2020-07-29 03:25:15,836 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:15,836 INFO L794 eck$LassoCheckResult]: Stem: 1738#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1736#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1732#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1733#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1734#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1735#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1737#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1758#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1757#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1756#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1755#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1754#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1753#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1752#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1751#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1750#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1749#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1748#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1747#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1746#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1745#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1744#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1743#L23-3 assume !(main_~i~1 < 10); 1731#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1724#L9-3 [2020-07-29 03:25:15,837 INFO L796 eck$LassoCheckResult]: Loop: 1724#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1725#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1724#L9-3 [2020-07-29 03:25:15,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:15,837 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2020-07-29 03:25:15,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:15,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577364563] [2020-07-29 03:25:15,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:15,852 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:15,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:15,871 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:15,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:15,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 11 times [2020-07-29 03:25:15,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:15,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189995068] [2020-07-29 03:25:15,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:15,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:15,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:15,877 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:15,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:15,878 INFO L82 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2020-07-29 03:25:15,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:15,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410415501] [2020-07-29 03:25:15,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:15,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:15,915 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:15,921 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:19,815 WARN L193 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 221 DAG size of output: 160 [2020-07-29 03:25:20,295 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-07-29 03:25:20,299 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:20,299 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:20,299 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:20,299 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:20,299 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:20,299 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:20,299 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:20,299 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:20,300 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration12_Lasso [2020-07-29 03:25:20,300 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:20,300 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:20,323 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:20,334 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:20,337 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:20,501 WARN L257 bleTransFormulaUtils]: 10 quantified variables [2020-07-29 03:25:20,510 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:20,515 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:20,519 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:20,522 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:20,530 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:20,534 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:20,538 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:20,543 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:20,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:20,553 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:20,556 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:20,559 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:20,563 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:20,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:20,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:20,574 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:20,578 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:20,583 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:20,587 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:21,216 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:21,216 INFO L489 LassoAnalysis]: Using template 'affine'. 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:21,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:25:21,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:21,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:21,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:21,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 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:21,249 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:21,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:21,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:21,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:21,252 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:21,275 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:21,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:21,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:21,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 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:21,325 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:21,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:21,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:21,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:21,358 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:21,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:21,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:21,379 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:21,439 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2020-07-29 03:25:21,439 INFO L444 ModelExtractionUtils]: 3 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:21,442 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:21,445 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:21,445 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:21,445 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0) = -2*ULTIMATE.start_sum_~i~0 + 19 Supporting invariants [] [2020-07-29 03:25:21,483 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 03:25:21,488 INFO L393 LassoCheck]: Loop: "assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1;" "sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0;" [2020-07-29 03:25:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:21,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {1842#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1842#unseeded} is VALID [2020-07-29 03:25:21,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {1842#unseeded} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {1842#unseeded} is VALID [2020-07-29 03:25:21,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {1842#unseeded} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1842#unseeded} is VALID [2020-07-29 03:25:21,562 INFO L280 TraceCheckUtils]: 3: Hoare triple {1842#unseeded} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1842#unseeded} is VALID [2020-07-29 03:25:21,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {1842#unseeded} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1842#unseeded} is VALID [2020-07-29 03:25:21,563 INFO L280 TraceCheckUtils]: 5: Hoare triple {1842#unseeded} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1842#unseeded} is VALID [2020-07-29 03:25:21,564 INFO L280 TraceCheckUtils]: 6: Hoare triple {1842#unseeded} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1842#unseeded} is VALID [2020-07-29 03:25:21,564 INFO L280 TraceCheckUtils]: 7: Hoare triple {1842#unseeded} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1842#unseeded} is VALID [2020-07-29 03:25:21,565 INFO L280 TraceCheckUtils]: 8: Hoare triple {1842#unseeded} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1842#unseeded} is VALID [2020-07-29 03:25:21,565 INFO L280 TraceCheckUtils]: 9: Hoare triple {1842#unseeded} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1842#unseeded} is VALID [2020-07-29 03:25:21,566 INFO L280 TraceCheckUtils]: 10: Hoare triple {1842#unseeded} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1842#unseeded} is VALID [2020-07-29 03:25:21,566 INFO L280 TraceCheckUtils]: 11: Hoare triple {1842#unseeded} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1842#unseeded} is VALID [2020-07-29 03:25:21,567 INFO L280 TraceCheckUtils]: 12: Hoare triple {1842#unseeded} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1842#unseeded} is VALID [2020-07-29 03:25:21,567 INFO L280 TraceCheckUtils]: 13: Hoare triple {1842#unseeded} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1842#unseeded} is VALID [2020-07-29 03:25:21,568 INFO L280 TraceCheckUtils]: 14: Hoare triple {1842#unseeded} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1842#unseeded} is VALID [2020-07-29 03:25:21,568 INFO L280 TraceCheckUtils]: 15: Hoare triple {1842#unseeded} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1842#unseeded} is VALID [2020-07-29 03:25:21,569 INFO L280 TraceCheckUtils]: 16: Hoare triple {1842#unseeded} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1842#unseeded} is VALID [2020-07-29 03:25:21,569 INFO L280 TraceCheckUtils]: 17: Hoare triple {1842#unseeded} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1842#unseeded} is VALID [2020-07-29 03:25:21,570 INFO L280 TraceCheckUtils]: 18: Hoare triple {1842#unseeded} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1842#unseeded} is VALID [2020-07-29 03:25:21,570 INFO L280 TraceCheckUtils]: 19: Hoare triple {1842#unseeded} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1842#unseeded} is VALID [2020-07-29 03:25:21,571 INFO L280 TraceCheckUtils]: 20: Hoare triple {1842#unseeded} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {1842#unseeded} is VALID [2020-07-29 03:25:21,571 INFO L280 TraceCheckUtils]: 21: Hoare triple {1842#unseeded} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {1842#unseeded} is VALID [2020-07-29 03:25:21,572 INFO L280 TraceCheckUtils]: 22: Hoare triple {1842#unseeded} assume !(main_~i~1 < 10); {1842#unseeded} is VALID [2020-07-29 03:25:21,573 INFO L280 TraceCheckUtils]: 23: Hoare triple {1842#unseeded} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {1842#unseeded} is VALID [2020-07-29 03:25:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:21,602 INFO L280 TraceCheckUtils]: 0: Hoare triple {1845#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_sum_~i~0) 19))} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {1944#(and (< ULTIMATE.start_sum_~i~0 10) (<= 19 (+ (* 2 ULTIMATE.start_sum_~i~0) oldRank0)))} is VALID [2020-07-29 03:25:21,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {1944#(and (< ULTIMATE.start_sum_~i~0 10) (<= 19 (+ (* 2 ULTIMATE.start_sum_~i~0) oldRank0)))} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {1870#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_sum_~i~0) 19))) unseeded)} is VALID [2020-07-29 03:25:21,604 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:21,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:21,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:21,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:25:21,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,613 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:21,613 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 03:25:21,660 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 41 states and 48 transitions. Complement of second has 7 states. [2020-07-29 03:25:21,661 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:25:21,661 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:21,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. cyclomatic complexity: 9 [2020-07-29 03:25:21,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:21,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:21,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:21,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:21,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:21,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:21,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2020-07-29 03:25:21,663 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:21,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:21,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:21,664 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 41 transitions. cyclomatic complexity: 9 [2020-07-29 03:25:21,667 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:25:21,667 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:21,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:21,668 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:21,668 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 48 transitions. cyclomatic complexity: 12 [2020-07-29 03:25:21,670 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:25:21,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:25:21,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:25:21,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:25:21,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:21,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:21,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:21,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 27 letters. Loop has 2 letters. [2020-07-29 03:25:21,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 2 letters. [2020-07-29 03:25:21,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 2 letters. [2020-07-29 03:25:21,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:25:21,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:25:21,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:25:21,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:25:21,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:25:21,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:25:21,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:21,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:21,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:21,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 33 letters. Loop has 2 letters. [2020-07-29 03:25:21,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 2 letters. [2020-07-29 03:25:21,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 33 letters. Loop has 2 letters. [2020-07-29 03:25:21,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:25:21,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:25:21,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:25:21,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 30 letters. Loop has 2 letters. [2020-07-29 03:25:21,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 2 letters. [2020-07-29 03:25:21,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 30 letters. Loop has 2 letters. [2020-07-29 03:25:21,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 31 letters. Loop has 2 letters. [2020-07-29 03:25:21,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 31 letters. Loop has 2 letters. [2020-07-29 03:25:21,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 31 letters. Loop has 2 letters. [2020-07-29 03:25:21,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 27 letters. Loop has 2 letters. [2020-07-29 03:25:21,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 2 letters. [2020-07-29 03:25:21,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 2 letters. [2020-07-29 03:25:21,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 28 letters. Loop has 2 letters. [2020-07-29 03:25:21,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 2 letters. [2020-07-29 03:25:21,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 28 letters. Loop has 2 letters. [2020-07-29 03:25:21,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:25:21,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:25:21,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:25:21,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 25 letters. Loop has 2 letters. [2020-07-29 03:25:21,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 2 letters. [2020-07-29 03:25:21,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 2 letters. [2020-07-29 03:25:21,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:21,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:21,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:21,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:25:21,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:25:21,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 32 letters. Loop has 2 letters. [2020-07-29 03:25:21,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 33 letters. Loop has 2 letters. [2020-07-29 03:25:21,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 2 letters. [2020-07-29 03:25:21,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 33 letters. Loop has 2 letters. [2020-07-29 03:25:21,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 30 letters. Loop has 2 letters. [2020-07-29 03:25:21,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 2 letters. [2020-07-29 03:25:21,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 30 letters. Loop has 2 letters. [2020-07-29 03:25:21,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 31 letters. Loop has 2 letters. [2020-07-29 03:25:21,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 31 letters. Loop has 2 letters. [2020-07-29 03:25:21,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 31 letters. Loop has 2 letters. [2020-07-29 03:25:21,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 27 letters. Loop has 2 letters. [2020-07-29 03:25:21,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 2 letters. [2020-07-29 03:25:21,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 2 letters. [2020-07-29 03:25:21,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 9 Stem has 28 letters. Loop has 2 letters. [2020-07-29 03:25:21,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 2 letters. [2020-07-29 03:25:21,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 48 transitions. cyclomatic complexity: 12 Stem has 28 letters. Loop has 2 letters. [2020-07-29 03:25:21,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,696 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:21,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-07-29 03:25:21,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 2 letters. [2020-07-29 03:25:21,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 26 letters. Loop has 2 letters. [2020-07-29 03:25:21,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 4 letters. [2020-07-29 03:25:21,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. cyclomatic complexity: 12 [2020-07-29 03:25:21,699 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:21,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 43 transitions. [2020-07-29 03:25:21,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 03:25:21,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 03:25:21,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2020-07-29 03:25:21,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:21,702 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-07-29 03:25:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2020-07-29 03:25:21,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-29 03:25:21,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:21,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states and 43 transitions. Second operand 38 states. [2020-07-29 03:25:21,704 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states and 43 transitions. Second operand 38 states. [2020-07-29 03:25:21,705 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 38 states. [2020-07-29 03:25:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:21,706 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-29 03:25:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-29 03:25:21,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:21,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:21,706 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states and 43 transitions. [2020-07-29 03:25:21,707 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states and 43 transitions. [2020-07-29 03:25:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:21,708 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-29 03:25:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-29 03:25:21,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:21,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:21,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:21,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-29 03:25:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-07-29 03:25:21,710 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-07-29 03:25:21,710 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-07-29 03:25:21,710 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2020-07-29 03:25:21,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2020-07-29 03:25:21,711 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:21,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:21,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:21,712 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:21,712 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:21,713 INFO L794 eck$LassoCheckResult]: Stem: 2018#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2014#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2010#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2011#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2012#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2013#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2015#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2036#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2035#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2034#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2033#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2032#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2031#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2030#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2029#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2028#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2027#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2026#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2025#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2024#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2023#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2022#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2021#L23-3 assume !(main_~i~1 < 10); 2009#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2001#L9-3 assume !(sum_~i~0 < 10); 1999#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2000#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2019#L9-8 [2020-07-29 03:25:21,713 INFO L796 eck$LassoCheckResult]: Loop: 2019#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2020#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2019#L9-8 [2020-07-29 03:25:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:21,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2020-07-29 03:25:21,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:21,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495996176] [2020-07-29 03:25:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,774 INFO L280 TraceCheckUtils]: 0: Hoare triple {2116#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2116#true} is VALID [2020-07-29 03:25:21,775 INFO L280 TraceCheckUtils]: 1: Hoare triple {2116#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {2116#true} is VALID [2020-07-29 03:25:21,775 INFO L280 TraceCheckUtils]: 2: Hoare triple {2116#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2116#true} is VALID [2020-07-29 03:25:21,775 INFO L280 TraceCheckUtils]: 3: Hoare triple {2116#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2116#true} is VALID [2020-07-29 03:25:21,775 INFO L280 TraceCheckUtils]: 4: Hoare triple {2116#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2116#true} is VALID [2020-07-29 03:25:21,776 INFO L280 TraceCheckUtils]: 5: Hoare triple {2116#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2116#true} is VALID [2020-07-29 03:25:21,776 INFO L280 TraceCheckUtils]: 6: Hoare triple {2116#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2116#true} is VALID [2020-07-29 03:25:21,776 INFO L280 TraceCheckUtils]: 7: Hoare triple {2116#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2116#true} is VALID [2020-07-29 03:25:21,776 INFO L280 TraceCheckUtils]: 8: Hoare triple {2116#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2116#true} is VALID [2020-07-29 03:25:21,776 INFO L280 TraceCheckUtils]: 9: Hoare triple {2116#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2116#true} is VALID [2020-07-29 03:25:21,777 INFO L280 TraceCheckUtils]: 10: Hoare triple {2116#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2116#true} is VALID [2020-07-29 03:25:21,777 INFO L280 TraceCheckUtils]: 11: Hoare triple {2116#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2116#true} is VALID [2020-07-29 03:25:21,777 INFO L280 TraceCheckUtils]: 12: Hoare triple {2116#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2116#true} is VALID [2020-07-29 03:25:21,777 INFO L280 TraceCheckUtils]: 13: Hoare triple {2116#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2116#true} is VALID [2020-07-29 03:25:21,777 INFO L280 TraceCheckUtils]: 14: Hoare triple {2116#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2116#true} is VALID [2020-07-29 03:25:21,777 INFO L280 TraceCheckUtils]: 15: Hoare triple {2116#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2116#true} is VALID [2020-07-29 03:25:21,778 INFO L280 TraceCheckUtils]: 16: Hoare triple {2116#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2116#true} is VALID [2020-07-29 03:25:21,778 INFO L280 TraceCheckUtils]: 17: Hoare triple {2116#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2116#true} is VALID [2020-07-29 03:25:21,778 INFO L280 TraceCheckUtils]: 18: Hoare triple {2116#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2116#true} is VALID [2020-07-29 03:25:21,778 INFO L280 TraceCheckUtils]: 19: Hoare triple {2116#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2116#true} is VALID [2020-07-29 03:25:21,780 INFO L280 TraceCheckUtils]: 20: Hoare triple {2116#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2116#true} is VALID [2020-07-29 03:25:21,781 INFO L280 TraceCheckUtils]: 21: Hoare triple {2116#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2116#true} is VALID [2020-07-29 03:25:21,781 INFO L280 TraceCheckUtils]: 22: Hoare triple {2116#true} assume !(main_~i~1 < 10); {2116#true} is VALID [2020-07-29 03:25:21,784 INFO L280 TraceCheckUtils]: 23: Hoare triple {2116#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2118#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:21,785 INFO L280 TraceCheckUtils]: 24: Hoare triple {2118#(= 0 ULTIMATE.start_sum_~i~0)} assume !(sum_~i~0 < 10); {2117#false} is VALID [2020-07-29 03:25:21,785 INFO L280 TraceCheckUtils]: 25: Hoare triple {2117#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {2117#false} is VALID [2020-07-29 03:25:21,786 INFO L280 TraceCheckUtils]: 26: Hoare triple {2117#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2117#false} is VALID [2020-07-29 03:25:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-07-29 03:25:21,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495996176] [2020-07-29 03:25:21,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:21,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:25:21,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488665172] [2020-07-29 03:25:21,787 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2020-07-29 03:25:21,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:21,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740905134] [2020-07-29 03:25:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:21,794 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:21,801 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:21,804 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:21,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:21,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:25:21,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:25:21,846 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 03:25:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:21,913 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-29 03:25:21,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:25:21,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:21,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:21,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2020-07-29 03:25:21,928 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:21,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2020-07-29 03:25:21,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 03:25:21,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 03:25:21,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2020-07-29 03:25:21,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:21,930 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-07-29 03:25:21,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2020-07-29 03:25:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2020-07-29 03:25:21,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:21,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 47 transitions. Second operand 39 states. [2020-07-29 03:25:21,933 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 47 transitions. Second operand 39 states. [2020-07-29 03:25:21,933 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 39 states. [2020-07-29 03:25:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:21,934 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-29 03:25:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-29 03:25:21,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:21,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:21,934 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 43 states and 47 transitions. [2020-07-29 03:25:21,934 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 43 states and 47 transitions. [2020-07-29 03:25:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:21,935 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-29 03:25:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-29 03:25:21,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:21,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:21,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:21,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 03:25:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-29 03:25:21,937 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-29 03:25:21,937 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-29 03:25:21,937 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2020-07-29 03:25:21,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2020-07-29 03:25:21,938 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:21,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:21,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:21,938 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:21,938 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:21,939 INFO L794 eck$LassoCheckResult]: Stem: 2180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2179#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2175#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2176#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2177#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2178#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2202#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2201#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2200#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2199#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2198#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2197#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2196#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2195#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2194#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2193#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2192#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2191#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2190#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2189#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2188#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2187#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2186#L23-3 assume !(main_~i~1 < 10); 2174#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2166#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2167#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2168#L9-3 assume !(sum_~i~0 < 10); 2164#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2165#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2183#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2184#L9-7 [2020-07-29 03:25:21,939 INFO L796 eck$LassoCheckResult]: Loop: 2184#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2185#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2184#L9-7 [2020-07-29 03:25:21,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2020-07-29 03:25:21,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:21,939 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485937229] [2020-07-29 03:25:21,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:22,011 INFO L280 TraceCheckUtils]: 0: Hoare triple {2292#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2292#true} is VALID [2020-07-29 03:25:22,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {2292#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {2292#true} is VALID [2020-07-29 03:25:22,012 INFO L280 TraceCheckUtils]: 2: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,012 INFO L280 TraceCheckUtils]: 3: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,012 INFO L280 TraceCheckUtils]: 4: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,012 INFO L280 TraceCheckUtils]: 5: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,013 INFO L280 TraceCheckUtils]: 6: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,013 INFO L280 TraceCheckUtils]: 7: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,013 INFO L280 TraceCheckUtils]: 8: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,013 INFO L280 TraceCheckUtils]: 9: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,013 INFO L280 TraceCheckUtils]: 10: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,014 INFO L280 TraceCheckUtils]: 11: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,014 INFO L280 TraceCheckUtils]: 12: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,014 INFO L280 TraceCheckUtils]: 13: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,014 INFO L280 TraceCheckUtils]: 14: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,014 INFO L280 TraceCheckUtils]: 15: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,014 INFO L280 TraceCheckUtils]: 16: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,015 INFO L280 TraceCheckUtils]: 17: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,015 INFO L280 TraceCheckUtils]: 18: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,015 INFO L280 TraceCheckUtils]: 19: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,015 INFO L280 TraceCheckUtils]: 20: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,015 INFO L280 TraceCheckUtils]: 21: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,016 INFO L280 TraceCheckUtils]: 22: Hoare triple {2292#true} assume !(main_~i~1 < 10); {2292#true} is VALID [2020-07-29 03:25:22,016 INFO L280 TraceCheckUtils]: 23: Hoare triple {2292#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2294#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:22,017 INFO L280 TraceCheckUtils]: 24: Hoare triple {2294#(= 0 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2294#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:22,018 INFO L280 TraceCheckUtils]: 25: Hoare triple {2294#(= 0 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2295#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:22,019 INFO L280 TraceCheckUtils]: 26: Hoare triple {2295#(<= ULTIMATE.start_sum_~i~0 1)} assume !(sum_~i~0 < 10); {2293#false} is VALID [2020-07-29 03:25:22,019 INFO L280 TraceCheckUtils]: 27: Hoare triple {2293#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {2293#false} is VALID [2020-07-29 03:25:22,019 INFO L280 TraceCheckUtils]: 28: Hoare triple {2293#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2293#false} is VALID [2020-07-29 03:25:22,019 INFO L280 TraceCheckUtils]: 29: Hoare triple {2293#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2293#false} is VALID [2020-07-29 03:25:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-07-29 03:25:22,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485937229] [2020-07-29 03:25:22,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264030788] [2020-07-29 03:25:22,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:22,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 03:25:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:22,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:22,165 INFO L280 TraceCheckUtils]: 0: Hoare triple {2292#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2292#true} is VALID [2020-07-29 03:25:22,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {2292#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {2292#true} is VALID [2020-07-29 03:25:22,165 INFO L280 TraceCheckUtils]: 2: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,166 INFO L280 TraceCheckUtils]: 3: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,166 INFO L280 TraceCheckUtils]: 4: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,166 INFO L280 TraceCheckUtils]: 5: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,166 INFO L280 TraceCheckUtils]: 6: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,166 INFO L280 TraceCheckUtils]: 7: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,167 INFO L280 TraceCheckUtils]: 8: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,167 INFO L280 TraceCheckUtils]: 9: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,167 INFO L280 TraceCheckUtils]: 10: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,167 INFO L280 TraceCheckUtils]: 11: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,167 INFO L280 TraceCheckUtils]: 12: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,167 INFO L280 TraceCheckUtils]: 13: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,167 INFO L280 TraceCheckUtils]: 14: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,168 INFO L280 TraceCheckUtils]: 15: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,168 INFO L280 TraceCheckUtils]: 16: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,168 INFO L280 TraceCheckUtils]: 17: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,168 INFO L280 TraceCheckUtils]: 18: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,168 INFO L280 TraceCheckUtils]: 19: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,168 INFO L280 TraceCheckUtils]: 20: Hoare triple {2292#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2292#true} is VALID [2020-07-29 03:25:22,168 INFO L280 TraceCheckUtils]: 21: Hoare triple {2292#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2292#true} is VALID [2020-07-29 03:25:22,169 INFO L280 TraceCheckUtils]: 22: Hoare triple {2292#true} assume !(main_~i~1 < 10); {2292#true} is VALID [2020-07-29 03:25:22,169 INFO L280 TraceCheckUtils]: 23: Hoare triple {2292#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2368#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:22,170 INFO L280 TraceCheckUtils]: 24: Hoare triple {2368#(<= ULTIMATE.start_sum_~i~0 0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2368#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:22,171 INFO L280 TraceCheckUtils]: 25: Hoare triple {2368#(<= ULTIMATE.start_sum_~i~0 0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2295#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:22,171 INFO L280 TraceCheckUtils]: 26: Hoare triple {2295#(<= ULTIMATE.start_sum_~i~0 1)} assume !(sum_~i~0 < 10); {2293#false} is VALID [2020-07-29 03:25:22,171 INFO L280 TraceCheckUtils]: 27: Hoare triple {2293#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {2293#false} is VALID [2020-07-29 03:25:22,171 INFO L280 TraceCheckUtils]: 28: Hoare triple {2293#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2293#false} is VALID [2020-07-29 03:25:22,172 INFO L280 TraceCheckUtils]: 29: Hoare triple {2293#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2293#false} is VALID [2020-07-29 03:25:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-07-29 03:25:22,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:22,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-29 03:25:22,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415513327] [2020-07-29 03:25:22,173 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:22,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:22,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2020-07-29 03:25:22,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:22,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198254281] [2020-07-29 03:25:22,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,179 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:22,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:22,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:25:22,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:25:22,236 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-07-29 03:25:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:22,373 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2020-07-29 03:25:22,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:25:22,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:25:22,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:22,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2020-07-29 03:25:22,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:22,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2020-07-29 03:25:22,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-29 03:25:22,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-29 03:25:22,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2020-07-29 03:25:22,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:22,406 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-07-29 03:25:22,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2020-07-29 03:25:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2020-07-29 03:25:22,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:22,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states and 53 transitions. Second operand 43 states. [2020-07-29 03:25:22,408 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states and 53 transitions. Second operand 43 states. [2020-07-29 03:25:22,409 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 43 states. [2020-07-29 03:25:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:22,410 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2020-07-29 03:25:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-29 03:25:22,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:22,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:22,411 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 49 states and 53 transitions. [2020-07-29 03:25:22,411 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 49 states and 53 transitions. [2020-07-29 03:25:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:22,412 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2020-07-29 03:25:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-29 03:25:22,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:22,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:22,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:22,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 03:25:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2020-07-29 03:25:22,414 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-07-29 03:25:22,414 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-07-29 03:25:22,414 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2020-07-29 03:25:22,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 47 transitions. [2020-07-29 03:25:22,415 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:22,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:22,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:22,416 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:22,416 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:22,416 INFO L794 eck$LassoCheckResult]: Stem: 2452#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2451#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2447#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2448#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2449#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2450#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2477#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2476#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2475#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2474#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2473#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2472#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2471#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2470#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2469#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2468#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2467#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2466#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2465#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2464#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2463#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2462#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2461#L23-3 assume !(main_~i~1 < 10); 2446#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2437#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2438#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2439#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2440#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2459#L9-3 assume !(sum_~i~0 < 10); 2435#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2436#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2457#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2458#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2455#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2456#L9-7 [2020-07-29 03:25:22,417 INFO L796 eck$LassoCheckResult]: Loop: 2456#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2460#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2456#L9-7 [2020-07-29 03:25:22,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:22,417 INFO L82 PathProgramCache]: Analyzing trace with hash 528482161, now seen corresponding path program 1 times [2020-07-29 03:25:22,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:22,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721349855] [2020-07-29 03:25:22,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:22,476 INFO L280 TraceCheckUtils]: 0: Hoare triple {2579#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2579#true} is VALID [2020-07-29 03:25:22,476 INFO L280 TraceCheckUtils]: 1: Hoare triple {2579#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {2579#true} is VALID [2020-07-29 03:25:22,476 INFO L280 TraceCheckUtils]: 2: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,477 INFO L280 TraceCheckUtils]: 3: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,477 INFO L280 TraceCheckUtils]: 4: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,477 INFO L280 TraceCheckUtils]: 5: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,477 INFO L280 TraceCheckUtils]: 6: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,477 INFO L280 TraceCheckUtils]: 7: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,478 INFO L280 TraceCheckUtils]: 8: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,478 INFO L280 TraceCheckUtils]: 9: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,478 INFO L280 TraceCheckUtils]: 10: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,478 INFO L280 TraceCheckUtils]: 11: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,480 INFO L280 TraceCheckUtils]: 12: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,481 INFO L280 TraceCheckUtils]: 13: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,481 INFO L280 TraceCheckUtils]: 14: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,481 INFO L280 TraceCheckUtils]: 15: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,481 INFO L280 TraceCheckUtils]: 16: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,481 INFO L280 TraceCheckUtils]: 17: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,482 INFO L280 TraceCheckUtils]: 18: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,482 INFO L280 TraceCheckUtils]: 19: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,482 INFO L280 TraceCheckUtils]: 20: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,482 INFO L280 TraceCheckUtils]: 21: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,482 INFO L280 TraceCheckUtils]: 22: Hoare triple {2579#true} assume !(main_~i~1 < 10); {2579#true} is VALID [2020-07-29 03:25:22,484 INFO L280 TraceCheckUtils]: 23: Hoare triple {2579#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2581#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:22,484 INFO L280 TraceCheckUtils]: 24: Hoare triple {2581#(= 0 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2581#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:22,485 INFO L280 TraceCheckUtils]: 25: Hoare triple {2581#(= 0 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2582#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:22,486 INFO L280 TraceCheckUtils]: 26: Hoare triple {2582#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2582#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:22,487 INFO L280 TraceCheckUtils]: 27: Hoare triple {2582#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2583#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:22,488 INFO L280 TraceCheckUtils]: 28: Hoare triple {2583#(<= ULTIMATE.start_sum_~i~0 2)} assume !(sum_~i~0 < 10); {2580#false} is VALID [2020-07-29 03:25:22,488 INFO L280 TraceCheckUtils]: 29: Hoare triple {2580#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {2580#false} is VALID [2020-07-29 03:25:22,488 INFO L280 TraceCheckUtils]: 30: Hoare triple {2580#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2580#false} is VALID [2020-07-29 03:25:22,488 INFO L280 TraceCheckUtils]: 31: Hoare triple {2580#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2580#false} is VALID [2020-07-29 03:25:22,488 INFO L280 TraceCheckUtils]: 32: Hoare triple {2580#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2580#false} is VALID [2020-07-29 03:25:22,489 INFO L280 TraceCheckUtils]: 33: Hoare triple {2580#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2580#false} is VALID [2020-07-29 03:25:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-07-29 03:25:22,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721349855] [2020-07-29 03:25:22,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663835298] [2020-07-29 03:25:22,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:22,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:22,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:22,652 INFO L280 TraceCheckUtils]: 0: Hoare triple {2579#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2579#true} is VALID [2020-07-29 03:25:22,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {2579#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {2579#true} is VALID [2020-07-29 03:25:22,653 INFO L280 TraceCheckUtils]: 2: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,653 INFO L280 TraceCheckUtils]: 3: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,653 INFO L280 TraceCheckUtils]: 4: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,653 INFO L280 TraceCheckUtils]: 5: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,653 INFO L280 TraceCheckUtils]: 6: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,654 INFO L280 TraceCheckUtils]: 7: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,654 INFO L280 TraceCheckUtils]: 8: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,654 INFO L280 TraceCheckUtils]: 9: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,654 INFO L280 TraceCheckUtils]: 10: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,654 INFO L280 TraceCheckUtils]: 11: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,654 INFO L280 TraceCheckUtils]: 12: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,654 INFO L280 TraceCheckUtils]: 13: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,655 INFO L280 TraceCheckUtils]: 14: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,655 INFO L280 TraceCheckUtils]: 15: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,655 INFO L280 TraceCheckUtils]: 16: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,655 INFO L280 TraceCheckUtils]: 17: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,655 INFO L280 TraceCheckUtils]: 18: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,655 INFO L280 TraceCheckUtils]: 19: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,655 INFO L280 TraceCheckUtils]: 20: Hoare triple {2579#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2579#true} is VALID [2020-07-29 03:25:22,656 INFO L280 TraceCheckUtils]: 21: Hoare triple {2579#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2579#true} is VALID [2020-07-29 03:25:22,656 INFO L280 TraceCheckUtils]: 22: Hoare triple {2579#true} assume !(main_~i~1 < 10); {2579#true} is VALID [2020-07-29 03:25:22,656 INFO L280 TraceCheckUtils]: 23: Hoare triple {2579#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2656#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:22,657 INFO L280 TraceCheckUtils]: 24: Hoare triple {2656#(<= ULTIMATE.start_sum_~i~0 0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2656#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:22,658 INFO L280 TraceCheckUtils]: 25: Hoare triple {2656#(<= ULTIMATE.start_sum_~i~0 0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2582#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:22,658 INFO L280 TraceCheckUtils]: 26: Hoare triple {2582#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2582#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:22,659 INFO L280 TraceCheckUtils]: 27: Hoare triple {2582#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2583#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:22,659 INFO L280 TraceCheckUtils]: 28: Hoare triple {2583#(<= ULTIMATE.start_sum_~i~0 2)} assume !(sum_~i~0 < 10); {2580#false} is VALID [2020-07-29 03:25:22,659 INFO L280 TraceCheckUtils]: 29: Hoare triple {2580#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {2580#false} is VALID [2020-07-29 03:25:22,659 INFO L280 TraceCheckUtils]: 30: Hoare triple {2580#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2580#false} is VALID [2020-07-29 03:25:22,660 INFO L280 TraceCheckUtils]: 31: Hoare triple {2580#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2580#false} is VALID [2020-07-29 03:25:22,660 INFO L280 TraceCheckUtils]: 32: Hoare triple {2580#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2580#false} is VALID [2020-07-29 03:25:22,660 INFO L280 TraceCheckUtils]: 33: Hoare triple {2580#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2580#false} is VALID [2020-07-29 03:25:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-07-29 03:25:22,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:22,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-29 03:25:22,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982543136] [2020-07-29 03:25:22,661 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:22,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:22,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2020-07-29 03:25:22,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:22,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180995204] [2020-07-29 03:25:22,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,668 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:22,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:22,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 03:25:22,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-29 03:25:22,709 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-07-29 03:25:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:22,855 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-29 03:25:22,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:25:22,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:25:22,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:22,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 59 transitions. [2020-07-29 03:25:22,884 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:22,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 59 transitions. [2020-07-29 03:25:22,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-07-29 03:25:22,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-07-29 03:25:22,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2020-07-29 03:25:22,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:22,886 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-29 03:25:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2020-07-29 03:25:22,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2020-07-29 03:25:22,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:22,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states and 59 transitions. Second operand 47 states. [2020-07-29 03:25:22,888 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states and 59 transitions. Second operand 47 states. [2020-07-29 03:25:22,888 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 47 states. [2020-07-29 03:25:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:22,889 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-29 03:25:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-29 03:25:22,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:22,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:22,890 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 55 states and 59 transitions. [2020-07-29 03:25:22,890 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 55 states and 59 transitions. [2020-07-29 03:25:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:22,891 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-29 03:25:22,891 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-29 03:25:22,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:22,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:22,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:22,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-29 03:25:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-29 03:25:22,893 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-29 03:25:22,893 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-29 03:25:22,893 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2020-07-29 03:25:22,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 51 transitions. [2020-07-29 03:25:22,894 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:22,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:22,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:22,894 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:22,894 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:22,895 INFO L794 eck$LassoCheckResult]: Stem: 2760#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2757#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2753#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2754#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2755#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2756#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2784#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2783#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2782#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2781#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2780#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2779#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2778#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2777#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2776#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2775#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2774#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2773#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2770#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2769#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2768#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2767#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2766#L23-3 assume !(main_~i~1 < 10); 2752#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2743#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2744#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2745#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2746#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2787#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2765#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2764#L9-3 assume !(sum_~i~0 < 10); 2741#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2742#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2761#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2762#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2763#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2786#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2785#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2772#L9-7 [2020-07-29 03:25:22,895 INFO L796 eck$LassoCheckResult]: Loop: 2772#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2771#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2772#L9-7 [2020-07-29 03:25:22,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:22,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1101320015, now seen corresponding path program 2 times [2020-07-29 03:25:22,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:22,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652730400] [2020-07-29 03:25:22,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:22,991 INFO L280 TraceCheckUtils]: 0: Hoare triple {2901#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2901#true} is VALID [2020-07-29 03:25:22,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {2901#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {2901#true} is VALID [2020-07-29 03:25:22,991 INFO L280 TraceCheckUtils]: 2: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:22,992 INFO L280 TraceCheckUtils]: 3: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:22,992 INFO L280 TraceCheckUtils]: 4: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:22,992 INFO L280 TraceCheckUtils]: 5: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:22,992 INFO L280 TraceCheckUtils]: 6: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:22,992 INFO L280 TraceCheckUtils]: 7: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:22,992 INFO L280 TraceCheckUtils]: 8: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:22,993 INFO L280 TraceCheckUtils]: 9: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:22,993 INFO L280 TraceCheckUtils]: 10: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:22,993 INFO L280 TraceCheckUtils]: 11: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:22,993 INFO L280 TraceCheckUtils]: 12: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:22,993 INFO L280 TraceCheckUtils]: 13: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:22,994 INFO L280 TraceCheckUtils]: 14: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:22,994 INFO L280 TraceCheckUtils]: 15: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:22,994 INFO L280 TraceCheckUtils]: 16: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:22,994 INFO L280 TraceCheckUtils]: 17: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:22,994 INFO L280 TraceCheckUtils]: 18: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:22,995 INFO L280 TraceCheckUtils]: 19: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:22,995 INFO L280 TraceCheckUtils]: 20: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:22,995 INFO L280 TraceCheckUtils]: 21: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:22,995 INFO L280 TraceCheckUtils]: 22: Hoare triple {2901#true} assume !(main_~i~1 < 10); {2901#true} is VALID [2020-07-29 03:25:22,997 INFO L280 TraceCheckUtils]: 23: Hoare triple {2901#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2903#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:22,998 INFO L280 TraceCheckUtils]: 24: Hoare triple {2903#(= 0 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2903#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:22,998 INFO L280 TraceCheckUtils]: 25: Hoare triple {2903#(= 0 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2904#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:22,999 INFO L280 TraceCheckUtils]: 26: Hoare triple {2904#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2904#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:23,000 INFO L280 TraceCheckUtils]: 27: Hoare triple {2904#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2905#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:23,000 INFO L280 TraceCheckUtils]: 28: Hoare triple {2905#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2905#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:23,001 INFO L280 TraceCheckUtils]: 29: Hoare triple {2905#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2906#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:23,002 INFO L280 TraceCheckUtils]: 30: Hoare triple {2906#(<= ULTIMATE.start_sum_~i~0 3)} assume !(sum_~i~0 < 10); {2902#false} is VALID [2020-07-29 03:25:23,002 INFO L280 TraceCheckUtils]: 31: Hoare triple {2902#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {2902#false} is VALID [2020-07-29 03:25:23,002 INFO L280 TraceCheckUtils]: 32: Hoare triple {2902#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2902#false} is VALID [2020-07-29 03:25:23,003 INFO L280 TraceCheckUtils]: 33: Hoare triple {2902#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2902#false} is VALID [2020-07-29 03:25:23,003 INFO L280 TraceCheckUtils]: 34: Hoare triple {2902#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2902#false} is VALID [2020-07-29 03:25:23,003 INFO L280 TraceCheckUtils]: 35: Hoare triple {2902#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2902#false} is VALID [2020-07-29 03:25:23,003 INFO L280 TraceCheckUtils]: 36: Hoare triple {2902#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2902#false} is VALID [2020-07-29 03:25:23,003 INFO L280 TraceCheckUtils]: 37: Hoare triple {2902#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2902#false} is VALID [2020-07-29 03:25:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-07-29 03:25:23,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652730400] [2020-07-29 03:25:23,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691980379] [2020-07-29 03:25:23,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:23,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:25:23,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:23,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:23,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:23,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {2901#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2901#true} is VALID [2020-07-29 03:25:23,234 INFO L280 TraceCheckUtils]: 1: Hoare triple {2901#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {2901#true} is VALID [2020-07-29 03:25:23,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:23,235 INFO L280 TraceCheckUtils]: 3: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:23,235 INFO L280 TraceCheckUtils]: 4: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:23,235 INFO L280 TraceCheckUtils]: 5: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:23,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:23,235 INFO L280 TraceCheckUtils]: 7: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:23,235 INFO L280 TraceCheckUtils]: 8: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:23,236 INFO L280 TraceCheckUtils]: 9: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:23,236 INFO L280 TraceCheckUtils]: 10: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:23,236 INFO L280 TraceCheckUtils]: 11: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:23,236 INFO L280 TraceCheckUtils]: 12: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:23,236 INFO L280 TraceCheckUtils]: 13: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:23,237 INFO L280 TraceCheckUtils]: 14: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:23,237 INFO L280 TraceCheckUtils]: 15: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:23,237 INFO L280 TraceCheckUtils]: 16: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:23,237 INFO L280 TraceCheckUtils]: 17: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:23,237 INFO L280 TraceCheckUtils]: 18: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:23,238 INFO L280 TraceCheckUtils]: 19: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:23,238 INFO L280 TraceCheckUtils]: 20: Hoare triple {2901#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {2901#true} is VALID [2020-07-29 03:25:23,238 INFO L280 TraceCheckUtils]: 21: Hoare triple {2901#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {2901#true} is VALID [2020-07-29 03:25:23,238 INFO L280 TraceCheckUtils]: 22: Hoare triple {2901#true} assume !(main_~i~1 < 10); {2901#true} is VALID [2020-07-29 03:25:23,240 INFO L280 TraceCheckUtils]: 23: Hoare triple {2901#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2979#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:23,240 INFO L280 TraceCheckUtils]: 24: Hoare triple {2979#(<= ULTIMATE.start_sum_~i~0 0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2979#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:23,241 INFO L280 TraceCheckUtils]: 25: Hoare triple {2979#(<= ULTIMATE.start_sum_~i~0 0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2904#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:23,242 INFO L280 TraceCheckUtils]: 26: Hoare triple {2904#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2904#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:23,243 INFO L280 TraceCheckUtils]: 27: Hoare triple {2904#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2905#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:23,243 INFO L280 TraceCheckUtils]: 28: Hoare triple {2905#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2905#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:23,244 INFO L280 TraceCheckUtils]: 29: Hoare triple {2905#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2906#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:23,245 INFO L280 TraceCheckUtils]: 30: Hoare triple {2906#(<= ULTIMATE.start_sum_~i~0 3)} assume !(sum_~i~0 < 10); {2902#false} is VALID [2020-07-29 03:25:23,245 INFO L280 TraceCheckUtils]: 31: Hoare triple {2902#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {2902#false} is VALID [2020-07-29 03:25:23,246 INFO L280 TraceCheckUtils]: 32: Hoare triple {2902#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {2902#false} is VALID [2020-07-29 03:25:23,246 INFO L280 TraceCheckUtils]: 33: Hoare triple {2902#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2902#false} is VALID [2020-07-29 03:25:23,246 INFO L280 TraceCheckUtils]: 34: Hoare triple {2902#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2902#false} is VALID [2020-07-29 03:25:23,248 INFO L280 TraceCheckUtils]: 35: Hoare triple {2902#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2902#false} is VALID [2020-07-29 03:25:23,248 INFO L280 TraceCheckUtils]: 36: Hoare triple {2902#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {2902#false} is VALID [2020-07-29 03:25:23,249 INFO L280 TraceCheckUtils]: 37: Hoare triple {2902#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {2902#false} is VALID [2020-07-29 03:25:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-07-29 03:25:23,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:23,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 03:25:23,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094661241] [2020-07-29 03:25:23,251 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:23,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:23,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2020-07-29 03:25:23,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:23,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690227187] [2020-07-29 03:25:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:23,261 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:23,266 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:23,269 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:23,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:23,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:25:23,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-29 03:25:23,320 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-07-29 03:25:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:23,496 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2020-07-29 03:25:23,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:25:23,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:25:23,531 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:25:23,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 65 transitions. [2020-07-29 03:25:23,533 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:23,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 65 transitions. [2020-07-29 03:25:23,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-07-29 03:25:23,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-07-29 03:25:23,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 65 transitions. [2020-07-29 03:25:23,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:23,538 INFO L688 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2020-07-29 03:25:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 65 transitions. [2020-07-29 03:25:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2020-07-29 03:25:23,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:23,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states and 65 transitions. Second operand 51 states. [2020-07-29 03:25:23,548 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states and 65 transitions. Second operand 51 states. [2020-07-29 03:25:23,548 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 51 states. [2020-07-29 03:25:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:23,549 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2020-07-29 03:25:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2020-07-29 03:25:23,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:23,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:23,550 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 61 states and 65 transitions. [2020-07-29 03:25:23,550 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 61 states and 65 transitions. [2020-07-29 03:25:23,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:23,552 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2020-07-29 03:25:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2020-07-29 03:25:23,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:23,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:23,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:23,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-29 03:25:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-07-29 03:25:23,558 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-07-29 03:25:23,558 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-07-29 03:25:23,559 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2020-07-29 03:25:23,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2020-07-29 03:25:23,559 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:23,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:23,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:23,560 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:23,560 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:23,561 INFO L794 eck$LassoCheckResult]: Stem: 3099#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3098#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3094#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3095#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3096#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3097#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3125#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3124#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3123#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3122#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3121#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3120#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3119#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3118#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3117#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3116#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3115#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3114#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3113#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3112#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3111#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3110#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3109#L23-3 assume !(main_~i~1 < 10); 3093#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3084#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3085#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3086#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3087#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3128#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3127#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3126#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3106#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3105#L9-3 assume !(sum_~i~0 < 10); 3082#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3083#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3102#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3103#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3104#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3132#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3131#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3130#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3129#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3108#L9-7 [2020-07-29 03:25:23,561 INFO L796 eck$LassoCheckResult]: Loop: 3108#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3107#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3108#L9-7 [2020-07-29 03:25:23,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:23,562 INFO L82 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 3 times [2020-07-29 03:25:23,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:23,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132380356] [2020-07-29 03:25:23,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:23,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {3258#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3258#true} is VALID [2020-07-29 03:25:23,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {3258#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {3258#true} is VALID [2020-07-29 03:25:23,702 INFO L280 TraceCheckUtils]: 2: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,702 INFO L280 TraceCheckUtils]: 3: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,703 INFO L280 TraceCheckUtils]: 4: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,703 INFO L280 TraceCheckUtils]: 5: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,703 INFO L280 TraceCheckUtils]: 6: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,703 INFO L280 TraceCheckUtils]: 7: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,704 INFO L280 TraceCheckUtils]: 8: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,704 INFO L280 TraceCheckUtils]: 9: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,704 INFO L280 TraceCheckUtils]: 10: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,704 INFO L280 TraceCheckUtils]: 11: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,705 INFO L280 TraceCheckUtils]: 12: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,705 INFO L280 TraceCheckUtils]: 13: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,705 INFO L280 TraceCheckUtils]: 14: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,705 INFO L280 TraceCheckUtils]: 15: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,705 INFO L280 TraceCheckUtils]: 16: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,705 INFO L280 TraceCheckUtils]: 17: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,706 INFO L280 TraceCheckUtils]: 18: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,706 INFO L280 TraceCheckUtils]: 19: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,706 INFO L280 TraceCheckUtils]: 20: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,707 INFO L280 TraceCheckUtils]: 21: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,707 INFO L280 TraceCheckUtils]: 22: Hoare triple {3258#true} assume !(main_~i~1 < 10); {3258#true} is VALID [2020-07-29 03:25:23,708 INFO L280 TraceCheckUtils]: 23: Hoare triple {3258#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {3260#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:23,709 INFO L280 TraceCheckUtils]: 24: Hoare triple {3260#(= 0 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3260#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:23,709 INFO L280 TraceCheckUtils]: 25: Hoare triple {3260#(= 0 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3261#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:23,710 INFO L280 TraceCheckUtils]: 26: Hoare triple {3261#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3261#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:23,711 INFO L280 TraceCheckUtils]: 27: Hoare triple {3261#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3262#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:23,712 INFO L280 TraceCheckUtils]: 28: Hoare triple {3262#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3262#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:23,712 INFO L280 TraceCheckUtils]: 29: Hoare triple {3262#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3263#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:23,713 INFO L280 TraceCheckUtils]: 30: Hoare triple {3263#(<= ULTIMATE.start_sum_~i~0 3)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3263#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:23,714 INFO L280 TraceCheckUtils]: 31: Hoare triple {3263#(<= ULTIMATE.start_sum_~i~0 3)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3264#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:23,715 INFO L280 TraceCheckUtils]: 32: Hoare triple {3264#(<= ULTIMATE.start_sum_~i~0 4)} assume !(sum_~i~0 < 10); {3259#false} is VALID [2020-07-29 03:25:23,715 INFO L280 TraceCheckUtils]: 33: Hoare triple {3259#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {3259#false} is VALID [2020-07-29 03:25:23,715 INFO L280 TraceCheckUtils]: 34: Hoare triple {3259#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {3259#false} is VALID [2020-07-29 03:25:23,715 INFO L280 TraceCheckUtils]: 35: Hoare triple {3259#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3259#false} is VALID [2020-07-29 03:25:23,716 INFO L280 TraceCheckUtils]: 36: Hoare triple {3259#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3259#false} is VALID [2020-07-29 03:25:23,716 INFO L280 TraceCheckUtils]: 37: Hoare triple {3259#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3259#false} is VALID [2020-07-29 03:25:23,716 INFO L280 TraceCheckUtils]: 38: Hoare triple {3259#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3259#false} is VALID [2020-07-29 03:25:23,716 INFO L280 TraceCheckUtils]: 39: Hoare triple {3259#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3259#false} is VALID [2020-07-29 03:25:23,716 INFO L280 TraceCheckUtils]: 40: Hoare triple {3259#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3259#false} is VALID [2020-07-29 03:25:23,716 INFO L280 TraceCheckUtils]: 41: Hoare triple {3259#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3259#false} is VALID [2020-07-29 03:25:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-07-29 03:25:23,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132380356] [2020-07-29 03:25:23,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12643260] [2020-07-29 03:25:23,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:23,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-29 03:25:23,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:23,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:25:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:23,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:23,974 INFO L280 TraceCheckUtils]: 0: Hoare triple {3258#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3258#true} is VALID [2020-07-29 03:25:23,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {3258#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {3258#true} is VALID [2020-07-29 03:25:23,975 INFO L280 TraceCheckUtils]: 2: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,975 INFO L280 TraceCheckUtils]: 3: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,975 INFO L280 TraceCheckUtils]: 4: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,976 INFO L280 TraceCheckUtils]: 5: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,976 INFO L280 TraceCheckUtils]: 6: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,976 INFO L280 TraceCheckUtils]: 7: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,976 INFO L280 TraceCheckUtils]: 8: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,976 INFO L280 TraceCheckUtils]: 9: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,976 INFO L280 TraceCheckUtils]: 10: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,977 INFO L280 TraceCheckUtils]: 11: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,977 INFO L280 TraceCheckUtils]: 12: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,977 INFO L280 TraceCheckUtils]: 13: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,977 INFO L280 TraceCheckUtils]: 14: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,978 INFO L280 TraceCheckUtils]: 15: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,978 INFO L280 TraceCheckUtils]: 16: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,978 INFO L280 TraceCheckUtils]: 17: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,978 INFO L280 TraceCheckUtils]: 18: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,978 INFO L280 TraceCheckUtils]: 19: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,979 INFO L280 TraceCheckUtils]: 20: Hoare triple {3258#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3258#true} is VALID [2020-07-29 03:25:23,979 INFO L280 TraceCheckUtils]: 21: Hoare triple {3258#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3258#true} is VALID [2020-07-29 03:25:23,979 INFO L280 TraceCheckUtils]: 22: Hoare triple {3258#true} assume !(main_~i~1 < 10); {3258#true} is VALID [2020-07-29 03:25:23,980 INFO L280 TraceCheckUtils]: 23: Hoare triple {3258#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {3337#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:23,981 INFO L280 TraceCheckUtils]: 24: Hoare triple {3337#(<= ULTIMATE.start_sum_~i~0 0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3337#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:23,983 INFO L280 TraceCheckUtils]: 25: Hoare triple {3337#(<= ULTIMATE.start_sum_~i~0 0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3261#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:23,984 INFO L280 TraceCheckUtils]: 26: Hoare triple {3261#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3261#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:23,985 INFO L280 TraceCheckUtils]: 27: Hoare triple {3261#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3262#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:23,986 INFO L280 TraceCheckUtils]: 28: Hoare triple {3262#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3262#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:23,988 INFO L280 TraceCheckUtils]: 29: Hoare triple {3262#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3263#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:23,989 INFO L280 TraceCheckUtils]: 30: Hoare triple {3263#(<= ULTIMATE.start_sum_~i~0 3)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3263#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:23,990 INFO L280 TraceCheckUtils]: 31: Hoare triple {3263#(<= ULTIMATE.start_sum_~i~0 3)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3264#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:23,991 INFO L280 TraceCheckUtils]: 32: Hoare triple {3264#(<= ULTIMATE.start_sum_~i~0 4)} assume !(sum_~i~0 < 10); {3259#false} is VALID [2020-07-29 03:25:23,992 INFO L280 TraceCheckUtils]: 33: Hoare triple {3259#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {3259#false} is VALID [2020-07-29 03:25:23,992 INFO L280 TraceCheckUtils]: 34: Hoare triple {3259#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {3259#false} is VALID [2020-07-29 03:25:23,992 INFO L280 TraceCheckUtils]: 35: Hoare triple {3259#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3259#false} is VALID [2020-07-29 03:25:23,993 INFO L280 TraceCheckUtils]: 36: Hoare triple {3259#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3259#false} is VALID [2020-07-29 03:25:23,993 INFO L280 TraceCheckUtils]: 37: Hoare triple {3259#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3259#false} is VALID [2020-07-29 03:25:23,994 INFO L280 TraceCheckUtils]: 38: Hoare triple {3259#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3259#false} is VALID [2020-07-29 03:25:23,994 INFO L280 TraceCheckUtils]: 39: Hoare triple {3259#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3259#false} is VALID [2020-07-29 03:25:23,994 INFO L280 TraceCheckUtils]: 40: Hoare triple {3259#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3259#false} is VALID [2020-07-29 03:25:23,994 INFO L280 TraceCheckUtils]: 41: Hoare triple {3259#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3259#false} is VALID [2020-07-29 03:25:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-07-29 03:25:23,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:23,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-29 03:25:23,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414086301] [2020-07-29 03:25:23,999 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:23,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:24,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2020-07-29 03:25:24,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:24,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242972052] [2020-07-29 03:25:24,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:24,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:24,016 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:24,023 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:24,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:24,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 03:25:24,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-29 03:25:24,081 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-07-29 03:25:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:24,286 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-07-29 03:25:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:25:24,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 03:25:24,321 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:24,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 71 transitions. [2020-07-29 03:25:24,323 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:24,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 71 transitions. [2020-07-29 03:25:24,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-07-29 03:25:24,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-07-29 03:25:24,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 71 transitions. [2020-07-29 03:25:24,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:24,326 INFO L688 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2020-07-29 03:25:24,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 71 transitions. [2020-07-29 03:25:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-07-29 03:25:24,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:24,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states and 71 transitions. Second operand 55 states. [2020-07-29 03:25:24,331 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states and 71 transitions. Second operand 55 states. [2020-07-29 03:25:24,331 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 55 states. [2020-07-29 03:25:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:24,333 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-07-29 03:25:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2020-07-29 03:25:24,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:24,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:24,333 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 67 states and 71 transitions. [2020-07-29 03:25:24,334 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 67 states and 71 transitions. [2020-07-29 03:25:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:24,335 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-07-29 03:25:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2020-07-29 03:25:24,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:24,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:24,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:24,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-29 03:25:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-07-29 03:25:24,338 INFO L711 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-29 03:25:24,338 INFO L591 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-29 03:25:24,338 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2020-07-29 03:25:24,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 59 transitions. [2020-07-29 03:25:24,339 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:24,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:24,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:24,341 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:24,341 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:24,342 INFO L794 eck$LassoCheckResult]: Stem: 3475#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3474#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3470#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3471#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3472#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3473#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3501#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3500#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3499#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3498#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3497#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3496#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3495#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3494#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3493#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3492#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3491#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3490#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3489#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3488#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3487#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3486#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3485#L23-3 assume !(main_~i~1 < 10); 3469#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3460#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3461#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3462#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3463#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3506#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3505#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3504#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3503#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3502#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3482#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3481#L9-3 assume !(sum_~i~0 < 10); 3458#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3459#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3478#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3479#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3480#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3512#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3511#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3510#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3509#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3508#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3507#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3484#L9-7 [2020-07-29 03:25:24,342 INFO L796 eck$LassoCheckResult]: Loop: 3484#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3483#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3484#L9-7 [2020-07-29 03:25:24,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:24,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1883803697, now seen corresponding path program 4 times [2020-07-29 03:25:24,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:24,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096790026] [2020-07-29 03:25:24,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {3650#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3650#true} is VALID [2020-07-29 03:25:24,478 INFO L280 TraceCheckUtils]: 1: Hoare triple {3650#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {3650#true} is VALID [2020-07-29 03:25:24,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,478 INFO L280 TraceCheckUtils]: 3: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,478 INFO L280 TraceCheckUtils]: 4: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,478 INFO L280 TraceCheckUtils]: 5: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,479 INFO L280 TraceCheckUtils]: 6: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,479 INFO L280 TraceCheckUtils]: 7: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,479 INFO L280 TraceCheckUtils]: 8: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,479 INFO L280 TraceCheckUtils]: 9: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,480 INFO L280 TraceCheckUtils]: 10: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,480 INFO L280 TraceCheckUtils]: 11: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,480 INFO L280 TraceCheckUtils]: 12: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,480 INFO L280 TraceCheckUtils]: 13: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,480 INFO L280 TraceCheckUtils]: 14: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,481 INFO L280 TraceCheckUtils]: 15: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,481 INFO L280 TraceCheckUtils]: 16: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,481 INFO L280 TraceCheckUtils]: 17: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,481 INFO L280 TraceCheckUtils]: 18: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,481 INFO L280 TraceCheckUtils]: 19: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,481 INFO L280 TraceCheckUtils]: 20: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,482 INFO L280 TraceCheckUtils]: 21: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,482 INFO L280 TraceCheckUtils]: 22: Hoare triple {3650#true} assume !(main_~i~1 < 10); {3650#true} is VALID [2020-07-29 03:25:24,483 INFO L280 TraceCheckUtils]: 23: Hoare triple {3650#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {3652#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:24,484 INFO L280 TraceCheckUtils]: 24: Hoare triple {3652#(= 0 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3652#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:24,485 INFO L280 TraceCheckUtils]: 25: Hoare triple {3652#(= 0 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3653#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:24,485 INFO L280 TraceCheckUtils]: 26: Hoare triple {3653#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3653#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:24,486 INFO L280 TraceCheckUtils]: 27: Hoare triple {3653#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3654#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:24,487 INFO L280 TraceCheckUtils]: 28: Hoare triple {3654#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3654#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:24,488 INFO L280 TraceCheckUtils]: 29: Hoare triple {3654#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3655#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:24,488 INFO L280 TraceCheckUtils]: 30: Hoare triple {3655#(<= ULTIMATE.start_sum_~i~0 3)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3655#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:24,489 INFO L280 TraceCheckUtils]: 31: Hoare triple {3655#(<= ULTIMATE.start_sum_~i~0 3)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3656#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:24,489 INFO L280 TraceCheckUtils]: 32: Hoare triple {3656#(<= ULTIMATE.start_sum_~i~0 4)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3656#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:24,490 INFO L280 TraceCheckUtils]: 33: Hoare triple {3656#(<= ULTIMATE.start_sum_~i~0 4)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3657#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:24,490 INFO L280 TraceCheckUtils]: 34: Hoare triple {3657#(<= ULTIMATE.start_sum_~i~0 5)} assume !(sum_~i~0 < 10); {3651#false} is VALID [2020-07-29 03:25:24,491 INFO L280 TraceCheckUtils]: 35: Hoare triple {3651#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {3651#false} is VALID [2020-07-29 03:25:24,491 INFO L280 TraceCheckUtils]: 36: Hoare triple {3651#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {3651#false} is VALID [2020-07-29 03:25:24,491 INFO L280 TraceCheckUtils]: 37: Hoare triple {3651#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3651#false} is VALID [2020-07-29 03:25:24,491 INFO L280 TraceCheckUtils]: 38: Hoare triple {3651#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3651#false} is VALID [2020-07-29 03:25:24,491 INFO L280 TraceCheckUtils]: 39: Hoare triple {3651#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3651#false} is VALID [2020-07-29 03:25:24,491 INFO L280 TraceCheckUtils]: 40: Hoare triple {3651#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3651#false} is VALID [2020-07-29 03:25:24,492 INFO L280 TraceCheckUtils]: 41: Hoare triple {3651#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3651#false} is VALID [2020-07-29 03:25:24,492 INFO L280 TraceCheckUtils]: 42: Hoare triple {3651#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3651#false} is VALID [2020-07-29 03:25:24,492 INFO L280 TraceCheckUtils]: 43: Hoare triple {3651#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3651#false} is VALID [2020-07-29 03:25:24,492 INFO L280 TraceCheckUtils]: 44: Hoare triple {3651#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3651#false} is VALID [2020-07-29 03:25:24,492 INFO L280 TraceCheckUtils]: 45: Hoare triple {3651#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3651#false} is VALID [2020-07-29 03:25:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2020-07-29 03:25:24,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096790026] [2020-07-29 03:25:24,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259525902] [2020-07-29 03:25:24,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:24,551 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 03:25:24,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:24,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:25:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:24,749 INFO L280 TraceCheckUtils]: 0: Hoare triple {3650#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3650#true} is VALID [2020-07-29 03:25:24,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {3650#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {3650#true} is VALID [2020-07-29 03:25:24,750 INFO L280 TraceCheckUtils]: 2: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,750 INFO L280 TraceCheckUtils]: 3: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,750 INFO L280 TraceCheckUtils]: 4: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,750 INFO L280 TraceCheckUtils]: 5: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,750 INFO L280 TraceCheckUtils]: 6: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,751 INFO L280 TraceCheckUtils]: 7: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,751 INFO L280 TraceCheckUtils]: 8: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,751 INFO L280 TraceCheckUtils]: 9: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,751 INFO L280 TraceCheckUtils]: 10: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,752 INFO L280 TraceCheckUtils]: 11: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,752 INFO L280 TraceCheckUtils]: 12: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,752 INFO L280 TraceCheckUtils]: 13: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,752 INFO L280 TraceCheckUtils]: 14: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,753 INFO L280 TraceCheckUtils]: 15: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,753 INFO L280 TraceCheckUtils]: 16: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,753 INFO L280 TraceCheckUtils]: 17: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,753 INFO L280 TraceCheckUtils]: 18: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,753 INFO L280 TraceCheckUtils]: 19: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,753 INFO L280 TraceCheckUtils]: 20: Hoare triple {3650#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {3650#true} is VALID [2020-07-29 03:25:24,754 INFO L280 TraceCheckUtils]: 21: Hoare triple {3650#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {3650#true} is VALID [2020-07-29 03:25:24,754 INFO L280 TraceCheckUtils]: 22: Hoare triple {3650#true} assume !(main_~i~1 < 10); {3650#true} is VALID [2020-07-29 03:25:24,757 INFO L280 TraceCheckUtils]: 23: Hoare triple {3650#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {3730#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:24,763 INFO L280 TraceCheckUtils]: 24: Hoare triple {3730#(<= ULTIMATE.start_sum_~i~0 0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3730#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:24,764 INFO L280 TraceCheckUtils]: 25: Hoare triple {3730#(<= ULTIMATE.start_sum_~i~0 0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3653#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:24,765 INFO L280 TraceCheckUtils]: 26: Hoare triple {3653#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3653#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:24,766 INFO L280 TraceCheckUtils]: 27: Hoare triple {3653#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3654#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:24,766 INFO L280 TraceCheckUtils]: 28: Hoare triple {3654#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3654#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:24,767 INFO L280 TraceCheckUtils]: 29: Hoare triple {3654#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3655#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:24,768 INFO L280 TraceCheckUtils]: 30: Hoare triple {3655#(<= ULTIMATE.start_sum_~i~0 3)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3655#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:24,769 INFO L280 TraceCheckUtils]: 31: Hoare triple {3655#(<= ULTIMATE.start_sum_~i~0 3)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3656#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:24,769 INFO L280 TraceCheckUtils]: 32: Hoare triple {3656#(<= ULTIMATE.start_sum_~i~0 4)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3656#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:24,770 INFO L280 TraceCheckUtils]: 33: Hoare triple {3656#(<= ULTIMATE.start_sum_~i~0 4)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3657#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:24,771 INFO L280 TraceCheckUtils]: 34: Hoare triple {3657#(<= ULTIMATE.start_sum_~i~0 5)} assume !(sum_~i~0 < 10); {3651#false} is VALID [2020-07-29 03:25:24,771 INFO L280 TraceCheckUtils]: 35: Hoare triple {3651#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {3651#false} is VALID [2020-07-29 03:25:24,772 INFO L280 TraceCheckUtils]: 36: Hoare triple {3651#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {3651#false} is VALID [2020-07-29 03:25:24,772 INFO L280 TraceCheckUtils]: 37: Hoare triple {3651#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3651#false} is VALID [2020-07-29 03:25:24,772 INFO L280 TraceCheckUtils]: 38: Hoare triple {3651#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3651#false} is VALID [2020-07-29 03:25:24,772 INFO L280 TraceCheckUtils]: 39: Hoare triple {3651#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3651#false} is VALID [2020-07-29 03:25:24,772 INFO L280 TraceCheckUtils]: 40: Hoare triple {3651#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3651#false} is VALID [2020-07-29 03:25:24,772 INFO L280 TraceCheckUtils]: 41: Hoare triple {3651#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3651#false} is VALID [2020-07-29 03:25:24,772 INFO L280 TraceCheckUtils]: 42: Hoare triple {3651#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3651#false} is VALID [2020-07-29 03:25:24,773 INFO L280 TraceCheckUtils]: 43: Hoare triple {3651#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3651#false} is VALID [2020-07-29 03:25:24,773 INFO L280 TraceCheckUtils]: 44: Hoare triple {3651#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {3651#false} is VALID [2020-07-29 03:25:24,773 INFO L280 TraceCheckUtils]: 45: Hoare triple {3651#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {3651#false} is VALID [2020-07-29 03:25:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2020-07-29 03:25:24,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:24,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-07-29 03:25:24,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254843927] [2020-07-29 03:25:24,776 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:24,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:24,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2020-07-29 03:25:24,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:24,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054001303] [2020-07-29 03:25:24,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:24,781 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:24,783 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:24,784 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:24,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:24,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 03:25:24,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-29 03:25:24,834 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. cyclomatic complexity: 9 Second operand 9 states. [2020-07-29 03:25:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:25,080 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2020-07-29 03:25:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 03:25:25,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:25:25,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:25,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 77 transitions. [2020-07-29 03:25:25,125 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:25,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 77 transitions. [2020-07-29 03:25:25,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2020-07-29 03:25:25,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-07-29 03:25:25,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 77 transitions. [2020-07-29 03:25:25,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:25,128 INFO L688 BuchiCegarLoop]: Abstraction has 73 states and 77 transitions. [2020-07-29 03:25:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 77 transitions. [2020-07-29 03:25:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2020-07-29 03:25:25,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:25,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states and 77 transitions. Second operand 59 states. [2020-07-29 03:25:25,130 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states and 77 transitions. Second operand 59 states. [2020-07-29 03:25:25,130 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 59 states. [2020-07-29 03:25:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:25,131 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2020-07-29 03:25:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2020-07-29 03:25:25,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:25,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:25,132 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 73 states and 77 transitions. [2020-07-29 03:25:25,132 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 73 states and 77 transitions. [2020-07-29 03:25:25,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:25,133 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2020-07-29 03:25:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2020-07-29 03:25:25,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:25,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:25,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:25,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-29 03:25:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-07-29 03:25:25,135 INFO L711 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-07-29 03:25:25,135 INFO L591 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-07-29 03:25:25,135 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2020-07-29 03:25:25,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 63 transitions. [2020-07-29 03:25:25,136 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:25,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:25,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:25,137 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:25,137 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:25,137 INFO L794 eck$LassoCheckResult]: Stem: 3889#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3886#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3882#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3883#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3884#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3885#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3913#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3912#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3911#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3910#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3909#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3908#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3907#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3906#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3905#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3904#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3903#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3902#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3899#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3898#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3897#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3896#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3895#L23-3 assume !(main_~i~1 < 10); 3881#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3871#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3872#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3873#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3874#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3878#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3919#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3918#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3917#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3916#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3915#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3914#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3894#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3893#L9-3 assume !(sum_~i~0 < 10); 3869#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3870#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3890#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3891#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3892#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3927#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3926#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3925#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3924#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3923#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3922#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3921#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3920#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3901#L9-7 [2020-07-29 03:25:25,137 INFO L796 eck$LassoCheckResult]: Loop: 3901#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3900#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3901#L9-7 [2020-07-29 03:25:25,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:25,137 INFO L82 PathProgramCache]: Analyzing trace with hash -414957967, now seen corresponding path program 5 times [2020-07-29 03:25:25,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:25,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808694387] [2020-07-29 03:25:25,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:25,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {4077#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4077#true} is VALID [2020-07-29 03:25:25,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {4077#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {4077#true} is VALID [2020-07-29 03:25:25,293 INFO L280 TraceCheckUtils]: 2: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,293 INFO L280 TraceCheckUtils]: 3: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,293 INFO L280 TraceCheckUtils]: 4: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,293 INFO L280 TraceCheckUtils]: 5: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,294 INFO L280 TraceCheckUtils]: 6: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,294 INFO L280 TraceCheckUtils]: 7: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,294 INFO L280 TraceCheckUtils]: 8: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,294 INFO L280 TraceCheckUtils]: 9: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,295 INFO L280 TraceCheckUtils]: 10: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,295 INFO L280 TraceCheckUtils]: 11: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,295 INFO L280 TraceCheckUtils]: 12: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,295 INFO L280 TraceCheckUtils]: 13: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,295 INFO L280 TraceCheckUtils]: 14: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,296 INFO L280 TraceCheckUtils]: 15: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,296 INFO L280 TraceCheckUtils]: 16: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,296 INFO L280 TraceCheckUtils]: 17: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,296 INFO L280 TraceCheckUtils]: 18: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,296 INFO L280 TraceCheckUtils]: 19: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,297 INFO L280 TraceCheckUtils]: 20: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,297 INFO L280 TraceCheckUtils]: 21: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,297 INFO L280 TraceCheckUtils]: 22: Hoare triple {4077#true} assume !(main_~i~1 < 10); {4077#true} is VALID [2020-07-29 03:25:25,299 INFO L280 TraceCheckUtils]: 23: Hoare triple {4077#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {4079#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:25,300 INFO L280 TraceCheckUtils]: 24: Hoare triple {4079#(= 0 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4079#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:25,300 INFO L280 TraceCheckUtils]: 25: Hoare triple {4079#(= 0 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4080#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:25,301 INFO L280 TraceCheckUtils]: 26: Hoare triple {4080#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4080#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:25,302 INFO L280 TraceCheckUtils]: 27: Hoare triple {4080#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4081#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:25,303 INFO L280 TraceCheckUtils]: 28: Hoare triple {4081#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4081#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:25,304 INFO L280 TraceCheckUtils]: 29: Hoare triple {4081#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4082#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:25,304 INFO L280 TraceCheckUtils]: 30: Hoare triple {4082#(<= ULTIMATE.start_sum_~i~0 3)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4082#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:25,305 INFO L280 TraceCheckUtils]: 31: Hoare triple {4082#(<= ULTIMATE.start_sum_~i~0 3)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4083#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:25,306 INFO L280 TraceCheckUtils]: 32: Hoare triple {4083#(<= ULTIMATE.start_sum_~i~0 4)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4083#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:25,307 INFO L280 TraceCheckUtils]: 33: Hoare triple {4083#(<= ULTIMATE.start_sum_~i~0 4)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4084#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:25,307 INFO L280 TraceCheckUtils]: 34: Hoare triple {4084#(<= ULTIMATE.start_sum_~i~0 5)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4084#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:25,308 INFO L280 TraceCheckUtils]: 35: Hoare triple {4084#(<= ULTIMATE.start_sum_~i~0 5)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4085#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:25,309 INFO L280 TraceCheckUtils]: 36: Hoare triple {4085#(<= ULTIMATE.start_sum_~i~0 6)} assume !(sum_~i~0 < 10); {4078#false} is VALID [2020-07-29 03:25:25,309 INFO L280 TraceCheckUtils]: 37: Hoare triple {4078#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {4078#false} is VALID [2020-07-29 03:25:25,309 INFO L280 TraceCheckUtils]: 38: Hoare triple {4078#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {4078#false} is VALID [2020-07-29 03:25:25,310 INFO L280 TraceCheckUtils]: 39: Hoare triple {4078#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4078#false} is VALID [2020-07-29 03:25:25,310 INFO L280 TraceCheckUtils]: 40: Hoare triple {4078#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4078#false} is VALID [2020-07-29 03:25:25,310 INFO L280 TraceCheckUtils]: 41: Hoare triple {4078#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4078#false} is VALID [2020-07-29 03:25:25,310 INFO L280 TraceCheckUtils]: 42: Hoare triple {4078#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4078#false} is VALID [2020-07-29 03:25:25,311 INFO L280 TraceCheckUtils]: 43: Hoare triple {4078#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4078#false} is VALID [2020-07-29 03:25:25,311 INFO L280 TraceCheckUtils]: 44: Hoare triple {4078#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4078#false} is VALID [2020-07-29 03:25:25,311 INFO L280 TraceCheckUtils]: 45: Hoare triple {4078#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4078#false} is VALID [2020-07-29 03:25:25,311 INFO L280 TraceCheckUtils]: 46: Hoare triple {4078#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4078#false} is VALID [2020-07-29 03:25:25,311 INFO L280 TraceCheckUtils]: 47: Hoare triple {4078#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4078#false} is VALID [2020-07-29 03:25:25,312 INFO L280 TraceCheckUtils]: 48: Hoare triple {4078#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4078#false} is VALID [2020-07-29 03:25:25,312 INFO L280 TraceCheckUtils]: 49: Hoare triple {4078#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4078#false} is VALID [2020-07-29 03:25:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2020-07-29 03:25:25,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808694387] [2020-07-29 03:25:25,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055264119] [2020-07-29 03:25:25,316 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:25,430 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2020-07-29 03:25:25,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:25,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:25:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:25,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:25,685 INFO L280 TraceCheckUtils]: 0: Hoare triple {4077#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4077#true} is VALID [2020-07-29 03:25:25,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {4077#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {4077#true} is VALID [2020-07-29 03:25:25,685 INFO L280 TraceCheckUtils]: 2: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,686 INFO L280 TraceCheckUtils]: 3: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,686 INFO L280 TraceCheckUtils]: 5: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,687 INFO L280 TraceCheckUtils]: 6: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,687 INFO L280 TraceCheckUtils]: 7: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,687 INFO L280 TraceCheckUtils]: 8: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,687 INFO L280 TraceCheckUtils]: 9: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,688 INFO L280 TraceCheckUtils]: 10: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,688 INFO L280 TraceCheckUtils]: 11: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,688 INFO L280 TraceCheckUtils]: 12: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,688 INFO L280 TraceCheckUtils]: 13: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,688 INFO L280 TraceCheckUtils]: 14: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,689 INFO L280 TraceCheckUtils]: 15: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,689 INFO L280 TraceCheckUtils]: 16: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,689 INFO L280 TraceCheckUtils]: 17: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,689 INFO L280 TraceCheckUtils]: 18: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,689 INFO L280 TraceCheckUtils]: 19: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,689 INFO L280 TraceCheckUtils]: 20: Hoare triple {4077#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4077#true} is VALID [2020-07-29 03:25:25,690 INFO L280 TraceCheckUtils]: 21: Hoare triple {4077#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4077#true} is VALID [2020-07-29 03:25:25,690 INFO L280 TraceCheckUtils]: 22: Hoare triple {4077#true} assume !(main_~i~1 < 10); {4077#true} is VALID [2020-07-29 03:25:25,691 INFO L280 TraceCheckUtils]: 23: Hoare triple {4077#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {4158#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:25,691 INFO L280 TraceCheckUtils]: 24: Hoare triple {4158#(<= ULTIMATE.start_sum_~i~0 0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4158#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:25,692 INFO L280 TraceCheckUtils]: 25: Hoare triple {4158#(<= ULTIMATE.start_sum_~i~0 0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4080#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:25,692 INFO L280 TraceCheckUtils]: 26: Hoare triple {4080#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4080#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:25,693 INFO L280 TraceCheckUtils]: 27: Hoare triple {4080#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4081#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:25,694 INFO L280 TraceCheckUtils]: 28: Hoare triple {4081#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4081#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:25,694 INFO L280 TraceCheckUtils]: 29: Hoare triple {4081#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4082#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:25,695 INFO L280 TraceCheckUtils]: 30: Hoare triple {4082#(<= ULTIMATE.start_sum_~i~0 3)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4082#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:25,695 INFO L280 TraceCheckUtils]: 31: Hoare triple {4082#(<= ULTIMATE.start_sum_~i~0 3)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4083#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:25,696 INFO L280 TraceCheckUtils]: 32: Hoare triple {4083#(<= ULTIMATE.start_sum_~i~0 4)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4083#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:25,700 INFO L280 TraceCheckUtils]: 33: Hoare triple {4083#(<= ULTIMATE.start_sum_~i~0 4)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4084#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:25,704 INFO L280 TraceCheckUtils]: 34: Hoare triple {4084#(<= ULTIMATE.start_sum_~i~0 5)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4084#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:25,706 INFO L280 TraceCheckUtils]: 35: Hoare triple {4084#(<= ULTIMATE.start_sum_~i~0 5)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4085#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:25,707 INFO L280 TraceCheckUtils]: 36: Hoare triple {4085#(<= ULTIMATE.start_sum_~i~0 6)} assume !(sum_~i~0 < 10); {4078#false} is VALID [2020-07-29 03:25:25,707 INFO L280 TraceCheckUtils]: 37: Hoare triple {4078#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {4078#false} is VALID [2020-07-29 03:25:25,707 INFO L280 TraceCheckUtils]: 38: Hoare triple {4078#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {4078#false} is VALID [2020-07-29 03:25:25,708 INFO L280 TraceCheckUtils]: 39: Hoare triple {4078#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4078#false} is VALID [2020-07-29 03:25:25,708 INFO L280 TraceCheckUtils]: 40: Hoare triple {4078#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4078#false} is VALID [2020-07-29 03:25:25,708 INFO L280 TraceCheckUtils]: 41: Hoare triple {4078#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4078#false} is VALID [2020-07-29 03:25:25,708 INFO L280 TraceCheckUtils]: 42: Hoare triple {4078#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4078#false} is VALID [2020-07-29 03:25:25,708 INFO L280 TraceCheckUtils]: 43: Hoare triple {4078#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4078#false} is VALID [2020-07-29 03:25:25,709 INFO L280 TraceCheckUtils]: 44: Hoare triple {4078#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4078#false} is VALID [2020-07-29 03:25:25,709 INFO L280 TraceCheckUtils]: 45: Hoare triple {4078#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4078#false} is VALID [2020-07-29 03:25:25,709 INFO L280 TraceCheckUtils]: 46: Hoare triple {4078#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4078#false} is VALID [2020-07-29 03:25:25,710 INFO L280 TraceCheckUtils]: 47: Hoare triple {4078#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4078#false} is VALID [2020-07-29 03:25:25,710 INFO L280 TraceCheckUtils]: 48: Hoare triple {4078#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4078#false} is VALID [2020-07-29 03:25:25,710 INFO L280 TraceCheckUtils]: 49: Hoare triple {4078#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4078#false} is VALID [2020-07-29 03:25:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2020-07-29 03:25:25,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:25,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-29 03:25:25,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771610188] [2020-07-29 03:25:25,742 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:25,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:25,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 7 times [2020-07-29 03:25:25,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:25,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829864650] [2020-07-29 03:25:25,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,752 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:25,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:25,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 03:25:25,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-29 03:25:25,793 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. cyclomatic complexity: 9 Second operand 10 states. [2020-07-29 03:25:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:26,068 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2020-07-29 03:25:26,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:25:26,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 03:25:26,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:26,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 83 transitions. [2020-07-29 03:25:26,115 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:26,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 83 transitions. [2020-07-29 03:25:26,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-07-29 03:25:26,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-07-29 03:25:26,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 83 transitions. [2020-07-29 03:25:26,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:26,117 INFO L688 BuchiCegarLoop]: Abstraction has 79 states and 83 transitions. [2020-07-29 03:25:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 83 transitions. [2020-07-29 03:25:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2020-07-29 03:25:26,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:26,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states and 83 transitions. Second operand 63 states. [2020-07-29 03:25:26,127 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states and 83 transitions. Second operand 63 states. [2020-07-29 03:25:26,128 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 63 states. [2020-07-29 03:25:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:26,130 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2020-07-29 03:25:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-07-29 03:25:26,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:26,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:26,131 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 79 states and 83 transitions. [2020-07-29 03:25:26,131 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 79 states and 83 transitions. [2020-07-29 03:25:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:26,133 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2020-07-29 03:25:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-07-29 03:25:26,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:26,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:26,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:26,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-29 03:25:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-07-29 03:25:26,135 INFO L711 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-07-29 03:25:26,135 INFO L591 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-07-29 03:25:26,135 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2020-07-29 03:25:26,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 67 transitions. [2020-07-29 03:25:26,136 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:26,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:26,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:26,137 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:26,137 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:26,138 INFO L794 eck$LassoCheckResult]: Stem: 4333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4332#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4328#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4329#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4330#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4331#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4359#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4358#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4357#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4356#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4355#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4354#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4353#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4352#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4351#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4350#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4349#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4348#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4347#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4346#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4345#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4344#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4343#L23-3 assume !(main_~i~1 < 10); 4327#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 4317#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4318#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4319#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4320#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4324#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4367#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4366#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4365#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4364#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4363#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4362#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4361#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4360#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4340#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4339#L9-3 assume !(sum_~i~0 < 10); 4315#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4316#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 4336#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4337#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4338#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4377#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4376#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4375#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4374#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4373#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4372#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4371#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4370#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4369#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4368#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4342#L9-7 [2020-07-29 03:25:26,138 INFO L796 eck$LassoCheckResult]: Loop: 4342#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4341#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4342#L9-7 [2020-07-29 03:25:26,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash 919530417, now seen corresponding path program 6 times [2020-07-29 03:25:26,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:26,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255857523] [2020-07-29 03:25:26,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:26,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {4539#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4539#true} is VALID [2020-07-29 03:25:26,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {4539#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {4539#true} is VALID [2020-07-29 03:25:26,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,294 INFO L280 TraceCheckUtils]: 3: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,294 INFO L280 TraceCheckUtils]: 4: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,294 INFO L280 TraceCheckUtils]: 5: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,294 INFO L280 TraceCheckUtils]: 6: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,295 INFO L280 TraceCheckUtils]: 7: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,295 INFO L280 TraceCheckUtils]: 8: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,295 INFO L280 TraceCheckUtils]: 9: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,295 INFO L280 TraceCheckUtils]: 10: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,295 INFO L280 TraceCheckUtils]: 11: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,295 INFO L280 TraceCheckUtils]: 12: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,295 INFO L280 TraceCheckUtils]: 13: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,296 INFO L280 TraceCheckUtils]: 14: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,296 INFO L280 TraceCheckUtils]: 15: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,296 INFO L280 TraceCheckUtils]: 16: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,296 INFO L280 TraceCheckUtils]: 17: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,296 INFO L280 TraceCheckUtils]: 18: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,296 INFO L280 TraceCheckUtils]: 19: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,296 INFO L280 TraceCheckUtils]: 20: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,297 INFO L280 TraceCheckUtils]: 21: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,297 INFO L280 TraceCheckUtils]: 22: Hoare triple {4539#true} assume !(main_~i~1 < 10); {4539#true} is VALID [2020-07-29 03:25:26,297 INFO L280 TraceCheckUtils]: 23: Hoare triple {4539#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {4541#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:26,298 INFO L280 TraceCheckUtils]: 24: Hoare triple {4541#(= 0 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4541#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:26,298 INFO L280 TraceCheckUtils]: 25: Hoare triple {4541#(= 0 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4542#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:26,299 INFO L280 TraceCheckUtils]: 26: Hoare triple {4542#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4542#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:26,299 INFO L280 TraceCheckUtils]: 27: Hoare triple {4542#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4543#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:26,300 INFO L280 TraceCheckUtils]: 28: Hoare triple {4543#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4543#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:26,300 INFO L280 TraceCheckUtils]: 29: Hoare triple {4543#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4544#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:26,301 INFO L280 TraceCheckUtils]: 30: Hoare triple {4544#(<= ULTIMATE.start_sum_~i~0 3)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4544#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:26,301 INFO L280 TraceCheckUtils]: 31: Hoare triple {4544#(<= ULTIMATE.start_sum_~i~0 3)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4545#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:26,302 INFO L280 TraceCheckUtils]: 32: Hoare triple {4545#(<= ULTIMATE.start_sum_~i~0 4)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4545#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:26,302 INFO L280 TraceCheckUtils]: 33: Hoare triple {4545#(<= ULTIMATE.start_sum_~i~0 4)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4546#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:26,303 INFO L280 TraceCheckUtils]: 34: Hoare triple {4546#(<= ULTIMATE.start_sum_~i~0 5)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4546#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:26,303 INFO L280 TraceCheckUtils]: 35: Hoare triple {4546#(<= ULTIMATE.start_sum_~i~0 5)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4547#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:26,304 INFO L280 TraceCheckUtils]: 36: Hoare triple {4547#(<= ULTIMATE.start_sum_~i~0 6)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4547#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:26,304 INFO L280 TraceCheckUtils]: 37: Hoare triple {4547#(<= ULTIMATE.start_sum_~i~0 6)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4548#(<= ULTIMATE.start_sum_~i~0 7)} is VALID [2020-07-29 03:25:26,305 INFO L280 TraceCheckUtils]: 38: Hoare triple {4548#(<= ULTIMATE.start_sum_~i~0 7)} assume !(sum_~i~0 < 10); {4540#false} is VALID [2020-07-29 03:25:26,305 INFO L280 TraceCheckUtils]: 39: Hoare triple {4540#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {4540#false} is VALID [2020-07-29 03:25:26,305 INFO L280 TraceCheckUtils]: 40: Hoare triple {4540#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {4540#false} is VALID [2020-07-29 03:25:26,305 INFO L280 TraceCheckUtils]: 41: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,306 INFO L280 TraceCheckUtils]: 42: Hoare triple {4540#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4540#false} is VALID [2020-07-29 03:25:26,306 INFO L280 TraceCheckUtils]: 43: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,306 INFO L280 TraceCheckUtils]: 44: Hoare triple {4540#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4540#false} is VALID [2020-07-29 03:25:26,306 INFO L280 TraceCheckUtils]: 45: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,306 INFO L280 TraceCheckUtils]: 46: Hoare triple {4540#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4540#false} is VALID [2020-07-29 03:25:26,306 INFO L280 TraceCheckUtils]: 47: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,306 INFO L280 TraceCheckUtils]: 48: Hoare triple {4540#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4540#false} is VALID [2020-07-29 03:25:26,306 INFO L280 TraceCheckUtils]: 49: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,307 INFO L280 TraceCheckUtils]: 50: Hoare triple {4540#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4540#false} is VALID [2020-07-29 03:25:26,307 INFO L280 TraceCheckUtils]: 51: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,307 INFO L280 TraceCheckUtils]: 52: Hoare triple {4540#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4540#false} is VALID [2020-07-29 03:25:26,307 INFO L280 TraceCheckUtils]: 53: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-07-29 03:25:26,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255857523] [2020-07-29 03:25:26,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593132730] [2020-07-29 03:25:26,309 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:26,592 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2020-07-29 03:25:26,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:26,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:25:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:26,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:26,841 INFO L280 TraceCheckUtils]: 0: Hoare triple {4539#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4539#true} is VALID [2020-07-29 03:25:26,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {4539#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {4539#true} is VALID [2020-07-29 03:25:26,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,842 INFO L280 TraceCheckUtils]: 3: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,842 INFO L280 TraceCheckUtils]: 4: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,842 INFO L280 TraceCheckUtils]: 5: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,843 INFO L280 TraceCheckUtils]: 6: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,843 INFO L280 TraceCheckUtils]: 7: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,843 INFO L280 TraceCheckUtils]: 8: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,843 INFO L280 TraceCheckUtils]: 9: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,844 INFO L280 TraceCheckUtils]: 10: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,844 INFO L280 TraceCheckUtils]: 11: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,844 INFO L280 TraceCheckUtils]: 12: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,844 INFO L280 TraceCheckUtils]: 13: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,844 INFO L280 TraceCheckUtils]: 14: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,844 INFO L280 TraceCheckUtils]: 15: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,845 INFO L280 TraceCheckUtils]: 16: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,845 INFO L280 TraceCheckUtils]: 17: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,845 INFO L280 TraceCheckUtils]: 18: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,845 INFO L280 TraceCheckUtils]: 19: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,845 INFO L280 TraceCheckUtils]: 20: Hoare triple {4539#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {4539#true} is VALID [2020-07-29 03:25:26,845 INFO L280 TraceCheckUtils]: 21: Hoare triple {4539#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {4539#true} is VALID [2020-07-29 03:25:26,846 INFO L280 TraceCheckUtils]: 22: Hoare triple {4539#true} assume !(main_~i~1 < 10); {4539#true} is VALID [2020-07-29 03:25:26,847 INFO L280 TraceCheckUtils]: 23: Hoare triple {4539#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {4621#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:26,847 INFO L280 TraceCheckUtils]: 24: Hoare triple {4621#(<= ULTIMATE.start_sum_~i~0 0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4621#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:26,848 INFO L280 TraceCheckUtils]: 25: Hoare triple {4621#(<= ULTIMATE.start_sum_~i~0 0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4542#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:26,848 INFO L280 TraceCheckUtils]: 26: Hoare triple {4542#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4542#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:26,849 INFO L280 TraceCheckUtils]: 27: Hoare triple {4542#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4543#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:26,849 INFO L280 TraceCheckUtils]: 28: Hoare triple {4543#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4543#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:26,850 INFO L280 TraceCheckUtils]: 29: Hoare triple {4543#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4544#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:26,850 INFO L280 TraceCheckUtils]: 30: Hoare triple {4544#(<= ULTIMATE.start_sum_~i~0 3)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4544#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:26,851 INFO L280 TraceCheckUtils]: 31: Hoare triple {4544#(<= ULTIMATE.start_sum_~i~0 3)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4545#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:26,852 INFO L280 TraceCheckUtils]: 32: Hoare triple {4545#(<= ULTIMATE.start_sum_~i~0 4)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4545#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:26,852 INFO L280 TraceCheckUtils]: 33: Hoare triple {4545#(<= ULTIMATE.start_sum_~i~0 4)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4546#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:26,853 INFO L280 TraceCheckUtils]: 34: Hoare triple {4546#(<= ULTIMATE.start_sum_~i~0 5)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4546#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:26,853 INFO L280 TraceCheckUtils]: 35: Hoare triple {4546#(<= ULTIMATE.start_sum_~i~0 5)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4547#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:26,854 INFO L280 TraceCheckUtils]: 36: Hoare triple {4547#(<= ULTIMATE.start_sum_~i~0 6)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4547#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:26,854 INFO L280 TraceCheckUtils]: 37: Hoare triple {4547#(<= ULTIMATE.start_sum_~i~0 6)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4548#(<= ULTIMATE.start_sum_~i~0 7)} is VALID [2020-07-29 03:25:26,855 INFO L280 TraceCheckUtils]: 38: Hoare triple {4548#(<= ULTIMATE.start_sum_~i~0 7)} assume !(sum_~i~0 < 10); {4540#false} is VALID [2020-07-29 03:25:26,855 INFO L280 TraceCheckUtils]: 39: Hoare triple {4540#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {4540#false} is VALID [2020-07-29 03:25:26,856 INFO L280 TraceCheckUtils]: 40: Hoare triple {4540#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {4540#false} is VALID [2020-07-29 03:25:26,856 INFO L280 TraceCheckUtils]: 41: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,856 INFO L280 TraceCheckUtils]: 42: Hoare triple {4540#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4540#false} is VALID [2020-07-29 03:25:26,856 INFO L280 TraceCheckUtils]: 43: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,856 INFO L280 TraceCheckUtils]: 44: Hoare triple {4540#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4540#false} is VALID [2020-07-29 03:25:26,857 INFO L280 TraceCheckUtils]: 45: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,857 INFO L280 TraceCheckUtils]: 46: Hoare triple {4540#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4540#false} is VALID [2020-07-29 03:25:26,857 INFO L280 TraceCheckUtils]: 47: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,857 INFO L280 TraceCheckUtils]: 48: Hoare triple {4540#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4540#false} is VALID [2020-07-29 03:25:26,857 INFO L280 TraceCheckUtils]: 49: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,858 INFO L280 TraceCheckUtils]: 50: Hoare triple {4540#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4540#false} is VALID [2020-07-29 03:25:26,858 INFO L280 TraceCheckUtils]: 51: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,858 INFO L280 TraceCheckUtils]: 52: Hoare triple {4540#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {4540#false} is VALID [2020-07-29 03:25:26,858 INFO L280 TraceCheckUtils]: 53: Hoare triple {4540#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {4540#false} is VALID [2020-07-29 03:25:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-07-29 03:25:26,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:26,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-07-29 03:25:26,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104084127] [2020-07-29 03:25:26,861 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:26,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:26,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 8 times [2020-07-29 03:25:26,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:26,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609499434] [2020-07-29 03:25:26,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:26,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:26,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:26,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:26,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:26,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 03:25:26,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-29 03:25:26,907 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. cyclomatic complexity: 9 Second operand 11 states. [2020-07-29 03:25:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:27,193 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2020-07-29 03:25:27,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 03:25:27,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 03:25:27,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:27,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 89 transitions. [2020-07-29 03:25:27,239 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:27,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 89 transitions. [2020-07-29 03:25:27,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2020-07-29 03:25:27,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2020-07-29 03:25:27,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 89 transitions. [2020-07-29 03:25:27,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:27,241 INFO L688 BuchiCegarLoop]: Abstraction has 85 states and 89 transitions. [2020-07-29 03:25:27,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 89 transitions. [2020-07-29 03:25:27,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2020-07-29 03:25:27,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:27,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states and 89 transitions. Second operand 67 states. [2020-07-29 03:25:27,243 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states and 89 transitions. Second operand 67 states. [2020-07-29 03:25:27,243 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 67 states. [2020-07-29 03:25:27,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:27,245 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2020-07-29 03:25:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2020-07-29 03:25:27,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:27,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:27,245 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 85 states and 89 transitions. [2020-07-29 03:25:27,245 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 85 states and 89 transitions. [2020-07-29 03:25:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:27,247 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2020-07-29 03:25:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2020-07-29 03:25:27,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:27,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:27,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:27,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-29 03:25:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2020-07-29 03:25:27,249 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2020-07-29 03:25:27,249 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2020-07-29 03:25:27,249 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2020-07-29 03:25:27,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 71 transitions. [2020-07-29 03:25:27,249 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:27,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:27,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:27,250 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:27,250 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:27,250 INFO L794 eck$LassoCheckResult]: Stem: 4816#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4813#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4809#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4810#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4811#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4812#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4840#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4839#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4838#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4837#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4836#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4835#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4834#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4833#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4832#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4831#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4830#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4829#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4826#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4825#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4824#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4823#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4822#L23-3 assume !(main_~i~1 < 10); 4808#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 4798#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4799#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4800#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4801#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4805#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4850#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4849#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4848#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4847#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4846#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4845#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4844#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4843#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4842#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4841#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4821#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4820#L9-3 assume !(sum_~i~0 < 10); 4796#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4797#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 4817#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4818#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4819#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4862#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4861#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4860#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4859#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4858#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4857#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4856#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4855#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4854#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4853#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4852#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4851#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4828#L9-7 [2020-07-29 03:25:27,251 INFO L796 eck$LassoCheckResult]: Loop: 4828#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4827#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4828#L9-7 [2020-07-29 03:25:27,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:27,251 INFO L82 PathProgramCache]: Analyzing trace with hash 231036913, now seen corresponding path program 7 times [2020-07-29 03:25:27,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:27,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230878749] [2020-07-29 03:25:27,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:27,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {5036#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5036#true} is VALID [2020-07-29 03:25:27,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {5036#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {5036#true} is VALID [2020-07-29 03:25:27,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,441 INFO L280 TraceCheckUtils]: 3: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,441 INFO L280 TraceCheckUtils]: 4: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,441 INFO L280 TraceCheckUtils]: 5: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,441 INFO L280 TraceCheckUtils]: 6: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,441 INFO L280 TraceCheckUtils]: 7: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,442 INFO L280 TraceCheckUtils]: 8: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,442 INFO L280 TraceCheckUtils]: 9: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,442 INFO L280 TraceCheckUtils]: 10: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,442 INFO L280 TraceCheckUtils]: 11: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,443 INFO L280 TraceCheckUtils]: 12: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,443 INFO L280 TraceCheckUtils]: 13: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,443 INFO L280 TraceCheckUtils]: 14: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,443 INFO L280 TraceCheckUtils]: 15: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,444 INFO L280 TraceCheckUtils]: 16: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,444 INFO L280 TraceCheckUtils]: 17: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,444 INFO L280 TraceCheckUtils]: 18: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,444 INFO L280 TraceCheckUtils]: 19: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,445 INFO L280 TraceCheckUtils]: 20: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,445 INFO L280 TraceCheckUtils]: 21: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,445 INFO L280 TraceCheckUtils]: 22: Hoare triple {5036#true} assume !(main_~i~1 < 10); {5036#true} is VALID [2020-07-29 03:25:27,446 INFO L280 TraceCheckUtils]: 23: Hoare triple {5036#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {5038#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:27,447 INFO L280 TraceCheckUtils]: 24: Hoare triple {5038#(= 0 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5038#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:27,448 INFO L280 TraceCheckUtils]: 25: Hoare triple {5038#(= 0 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5039#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:27,449 INFO L280 TraceCheckUtils]: 26: Hoare triple {5039#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5039#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:27,450 INFO L280 TraceCheckUtils]: 27: Hoare triple {5039#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5040#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:27,451 INFO L280 TraceCheckUtils]: 28: Hoare triple {5040#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5040#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:27,452 INFO L280 TraceCheckUtils]: 29: Hoare triple {5040#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5041#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:27,453 INFO L280 TraceCheckUtils]: 30: Hoare triple {5041#(<= ULTIMATE.start_sum_~i~0 3)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5041#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:27,454 INFO L280 TraceCheckUtils]: 31: Hoare triple {5041#(<= ULTIMATE.start_sum_~i~0 3)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5042#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:27,455 INFO L280 TraceCheckUtils]: 32: Hoare triple {5042#(<= ULTIMATE.start_sum_~i~0 4)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5042#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:27,456 INFO L280 TraceCheckUtils]: 33: Hoare triple {5042#(<= ULTIMATE.start_sum_~i~0 4)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5043#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:27,457 INFO L280 TraceCheckUtils]: 34: Hoare triple {5043#(<= ULTIMATE.start_sum_~i~0 5)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5043#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:27,458 INFO L280 TraceCheckUtils]: 35: Hoare triple {5043#(<= ULTIMATE.start_sum_~i~0 5)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5044#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:27,459 INFO L280 TraceCheckUtils]: 36: Hoare triple {5044#(<= ULTIMATE.start_sum_~i~0 6)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5044#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:27,461 INFO L280 TraceCheckUtils]: 37: Hoare triple {5044#(<= ULTIMATE.start_sum_~i~0 6)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5045#(<= ULTIMATE.start_sum_~i~0 7)} is VALID [2020-07-29 03:25:27,462 INFO L280 TraceCheckUtils]: 38: Hoare triple {5045#(<= ULTIMATE.start_sum_~i~0 7)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5045#(<= ULTIMATE.start_sum_~i~0 7)} is VALID [2020-07-29 03:25:27,463 INFO L280 TraceCheckUtils]: 39: Hoare triple {5045#(<= ULTIMATE.start_sum_~i~0 7)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5046#(<= ULTIMATE.start_sum_~i~0 8)} is VALID [2020-07-29 03:25:27,464 INFO L280 TraceCheckUtils]: 40: Hoare triple {5046#(<= ULTIMATE.start_sum_~i~0 8)} assume !(sum_~i~0 < 10); {5037#false} is VALID [2020-07-29 03:25:27,465 INFO L280 TraceCheckUtils]: 41: Hoare triple {5037#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {5037#false} is VALID [2020-07-29 03:25:27,465 INFO L280 TraceCheckUtils]: 42: Hoare triple {5037#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {5037#false} is VALID [2020-07-29 03:25:27,465 INFO L280 TraceCheckUtils]: 43: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,465 INFO L280 TraceCheckUtils]: 44: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,466 INFO L280 TraceCheckUtils]: 45: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,466 INFO L280 TraceCheckUtils]: 46: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,466 INFO L280 TraceCheckUtils]: 47: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,466 INFO L280 TraceCheckUtils]: 48: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,467 INFO L280 TraceCheckUtils]: 49: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,467 INFO L280 TraceCheckUtils]: 50: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,467 INFO L280 TraceCheckUtils]: 51: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,467 INFO L280 TraceCheckUtils]: 52: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,467 INFO L280 TraceCheckUtils]: 53: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,468 INFO L280 TraceCheckUtils]: 54: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,468 INFO L280 TraceCheckUtils]: 55: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,468 INFO L280 TraceCheckUtils]: 56: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,468 INFO L280 TraceCheckUtils]: 57: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2020-07-29 03:25:27,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230878749] [2020-07-29 03:25:27,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22040099] [2020-07-29 03:25:27,474 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:27,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:25:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:27,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:27,884 INFO L280 TraceCheckUtils]: 0: Hoare triple {5036#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5036#true} is VALID [2020-07-29 03:25:27,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {5036#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {5036#true} is VALID [2020-07-29 03:25:27,884 INFO L280 TraceCheckUtils]: 2: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,885 INFO L280 TraceCheckUtils]: 3: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,885 INFO L280 TraceCheckUtils]: 4: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,885 INFO L280 TraceCheckUtils]: 5: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,885 INFO L280 TraceCheckUtils]: 6: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,885 INFO L280 TraceCheckUtils]: 7: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,885 INFO L280 TraceCheckUtils]: 8: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,885 INFO L280 TraceCheckUtils]: 9: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,886 INFO L280 TraceCheckUtils]: 10: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,886 INFO L280 TraceCheckUtils]: 11: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,886 INFO L280 TraceCheckUtils]: 12: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,886 INFO L280 TraceCheckUtils]: 13: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,886 INFO L280 TraceCheckUtils]: 14: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,886 INFO L280 TraceCheckUtils]: 15: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,886 INFO L280 TraceCheckUtils]: 16: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,887 INFO L280 TraceCheckUtils]: 17: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,887 INFO L280 TraceCheckUtils]: 18: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,887 INFO L280 TraceCheckUtils]: 19: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,887 INFO L280 TraceCheckUtils]: 20: Hoare triple {5036#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5036#true} is VALID [2020-07-29 03:25:27,887 INFO L280 TraceCheckUtils]: 21: Hoare triple {5036#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5036#true} is VALID [2020-07-29 03:25:27,887 INFO L280 TraceCheckUtils]: 22: Hoare triple {5036#true} assume !(main_~i~1 < 10); {5036#true} is VALID [2020-07-29 03:25:27,888 INFO L280 TraceCheckUtils]: 23: Hoare triple {5036#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {5119#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:27,888 INFO L280 TraceCheckUtils]: 24: Hoare triple {5119#(<= ULTIMATE.start_sum_~i~0 0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5119#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:27,889 INFO L280 TraceCheckUtils]: 25: Hoare triple {5119#(<= ULTIMATE.start_sum_~i~0 0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5039#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:27,889 INFO L280 TraceCheckUtils]: 26: Hoare triple {5039#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5039#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:27,890 INFO L280 TraceCheckUtils]: 27: Hoare triple {5039#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5040#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:27,891 INFO L280 TraceCheckUtils]: 28: Hoare triple {5040#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5040#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:27,892 INFO L280 TraceCheckUtils]: 29: Hoare triple {5040#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5041#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:27,893 INFO L280 TraceCheckUtils]: 30: Hoare triple {5041#(<= ULTIMATE.start_sum_~i~0 3)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5041#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:27,894 INFO L280 TraceCheckUtils]: 31: Hoare triple {5041#(<= ULTIMATE.start_sum_~i~0 3)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5042#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:27,895 INFO L280 TraceCheckUtils]: 32: Hoare triple {5042#(<= ULTIMATE.start_sum_~i~0 4)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5042#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:27,896 INFO L280 TraceCheckUtils]: 33: Hoare triple {5042#(<= ULTIMATE.start_sum_~i~0 4)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5043#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:27,896 INFO L280 TraceCheckUtils]: 34: Hoare triple {5043#(<= ULTIMATE.start_sum_~i~0 5)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5043#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:27,897 INFO L280 TraceCheckUtils]: 35: Hoare triple {5043#(<= ULTIMATE.start_sum_~i~0 5)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5044#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:27,897 INFO L280 TraceCheckUtils]: 36: Hoare triple {5044#(<= ULTIMATE.start_sum_~i~0 6)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5044#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:27,898 INFO L280 TraceCheckUtils]: 37: Hoare triple {5044#(<= ULTIMATE.start_sum_~i~0 6)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5045#(<= ULTIMATE.start_sum_~i~0 7)} is VALID [2020-07-29 03:25:27,903 INFO L280 TraceCheckUtils]: 38: Hoare triple {5045#(<= ULTIMATE.start_sum_~i~0 7)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5045#(<= ULTIMATE.start_sum_~i~0 7)} is VALID [2020-07-29 03:25:27,906 INFO L280 TraceCheckUtils]: 39: Hoare triple {5045#(<= ULTIMATE.start_sum_~i~0 7)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5046#(<= ULTIMATE.start_sum_~i~0 8)} is VALID [2020-07-29 03:25:27,907 INFO L280 TraceCheckUtils]: 40: Hoare triple {5046#(<= ULTIMATE.start_sum_~i~0 8)} assume !(sum_~i~0 < 10); {5037#false} is VALID [2020-07-29 03:25:27,907 INFO L280 TraceCheckUtils]: 41: Hoare triple {5037#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {5037#false} is VALID [2020-07-29 03:25:27,907 INFO L280 TraceCheckUtils]: 42: Hoare triple {5037#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {5037#false} is VALID [2020-07-29 03:25:27,907 INFO L280 TraceCheckUtils]: 43: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,907 INFO L280 TraceCheckUtils]: 44: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,908 INFO L280 TraceCheckUtils]: 45: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,908 INFO L280 TraceCheckUtils]: 46: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,908 INFO L280 TraceCheckUtils]: 47: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,908 INFO L280 TraceCheckUtils]: 48: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,908 INFO L280 TraceCheckUtils]: 49: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,908 INFO L280 TraceCheckUtils]: 50: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,908 INFO L280 TraceCheckUtils]: 51: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,908 INFO L280 TraceCheckUtils]: 52: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,909 INFO L280 TraceCheckUtils]: 53: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,909 INFO L280 TraceCheckUtils]: 54: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,909 INFO L280 TraceCheckUtils]: 55: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,909 INFO L280 TraceCheckUtils]: 56: Hoare triple {5037#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5037#false} is VALID [2020-07-29 03:25:27,909 INFO L280 TraceCheckUtils]: 57: Hoare triple {5037#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5037#false} is VALID [2020-07-29 03:25:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2020-07-29 03:25:27,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:27,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-07-29 03:25:27,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650365660] [2020-07-29 03:25:27,912 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 9 times [2020-07-29 03:25:27,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:27,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920439485] [2020-07-29 03:25:27,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:27,916 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:27,917 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:27,918 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:27,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:27,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 03:25:27,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-07-29 03:25:27,962 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. cyclomatic complexity: 9 Second operand 12 states. [2020-07-29 03:25:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:28,293 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2020-07-29 03:25:28,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 03:25:28,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 03:25:28,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:28,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 95 transitions. [2020-07-29 03:25:28,344 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:28,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 95 transitions. [2020-07-29 03:25:28,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-07-29 03:25:28,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-07-29 03:25:28,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 95 transitions. [2020-07-29 03:25:28,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:28,346 INFO L688 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2020-07-29 03:25:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 95 transitions. [2020-07-29 03:25:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2020-07-29 03:25:28,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:28,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states and 95 transitions. Second operand 71 states. [2020-07-29 03:25:28,348 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states and 95 transitions. Second operand 71 states. [2020-07-29 03:25:28,348 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 71 states. [2020-07-29 03:25:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:28,349 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2020-07-29 03:25:28,350 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2020-07-29 03:25:28,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:28,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:28,350 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 91 states and 95 transitions. [2020-07-29 03:25:28,350 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 91 states and 95 transitions. [2020-07-29 03:25:28,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:28,352 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2020-07-29 03:25:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2020-07-29 03:25:28,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:28,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:28,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:28,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-29 03:25:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2020-07-29 03:25:28,354 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2020-07-29 03:25:28,354 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2020-07-29 03:25:28,354 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2020-07-29 03:25:28,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 75 transitions. [2020-07-29 03:25:28,355 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:28,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:28,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:28,356 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:28,356 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:28,356 INFO L794 eck$LassoCheckResult]: Stem: 5331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5328#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5324#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5325#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5326#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5327#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5355#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5354#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5353#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5352#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5351#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5350#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5349#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5348#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5347#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5346#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5345#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5344#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5341#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5340#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5339#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5338#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5337#L23-3 assume !(main_~i~1 < 10); 5323#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 5314#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5315#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5316#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5317#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5368#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5367#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5366#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5365#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5364#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5363#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5362#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5361#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5360#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5359#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5358#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5357#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5356#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5336#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5335#L9-3 assume !(sum_~i~0 < 10); 5312#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 5313#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 5332#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5333#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5334#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5382#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5381#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5380#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5379#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5378#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5377#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5376#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5375#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5374#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5373#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5372#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5371#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5370#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5369#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5343#L9-7 [2020-07-29 03:25:28,356 INFO L796 eck$LassoCheckResult]: Loop: 5343#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5342#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5343#L9-7 [2020-07-29 03:25:28,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:28,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1835777231, now seen corresponding path program 8 times [2020-07-29 03:25:28,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:28,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046131575] [2020-07-29 03:25:28,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:28,550 INFO L280 TraceCheckUtils]: 0: Hoare triple {5568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5568#true} is VALID [2020-07-29 03:25:28,551 INFO L280 TraceCheckUtils]: 1: Hoare triple {5568#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {5568#true} is VALID [2020-07-29 03:25:28,551 INFO L280 TraceCheckUtils]: 2: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,551 INFO L280 TraceCheckUtils]: 3: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,551 INFO L280 TraceCheckUtils]: 4: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,552 INFO L280 TraceCheckUtils]: 5: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,552 INFO L280 TraceCheckUtils]: 6: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,552 INFO L280 TraceCheckUtils]: 7: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,552 INFO L280 TraceCheckUtils]: 8: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,552 INFO L280 TraceCheckUtils]: 9: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,553 INFO L280 TraceCheckUtils]: 10: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,553 INFO L280 TraceCheckUtils]: 11: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,553 INFO L280 TraceCheckUtils]: 12: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,553 INFO L280 TraceCheckUtils]: 13: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,553 INFO L280 TraceCheckUtils]: 14: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,553 INFO L280 TraceCheckUtils]: 15: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,554 INFO L280 TraceCheckUtils]: 16: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,554 INFO L280 TraceCheckUtils]: 17: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,554 INFO L280 TraceCheckUtils]: 18: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,554 INFO L280 TraceCheckUtils]: 19: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,554 INFO L280 TraceCheckUtils]: 20: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,554 INFO L280 TraceCheckUtils]: 21: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,554 INFO L280 TraceCheckUtils]: 22: Hoare triple {5568#true} assume !(main_~i~1 < 10); {5568#true} is VALID [2020-07-29 03:25:28,559 INFO L280 TraceCheckUtils]: 23: Hoare triple {5568#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {5570#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:28,560 INFO L280 TraceCheckUtils]: 24: Hoare triple {5570#(= 0 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5570#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:28,560 INFO L280 TraceCheckUtils]: 25: Hoare triple {5570#(= 0 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5571#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:28,561 INFO L280 TraceCheckUtils]: 26: Hoare triple {5571#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5571#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:28,562 INFO L280 TraceCheckUtils]: 27: Hoare triple {5571#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5572#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:28,562 INFO L280 TraceCheckUtils]: 28: Hoare triple {5572#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5572#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:28,563 INFO L280 TraceCheckUtils]: 29: Hoare triple {5572#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5573#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:28,563 INFO L280 TraceCheckUtils]: 30: Hoare triple {5573#(<= ULTIMATE.start_sum_~i~0 3)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5573#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:28,564 INFO L280 TraceCheckUtils]: 31: Hoare triple {5573#(<= ULTIMATE.start_sum_~i~0 3)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5574#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:28,564 INFO L280 TraceCheckUtils]: 32: Hoare triple {5574#(<= ULTIMATE.start_sum_~i~0 4)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5574#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:28,565 INFO L280 TraceCheckUtils]: 33: Hoare triple {5574#(<= ULTIMATE.start_sum_~i~0 4)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5575#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:28,565 INFO L280 TraceCheckUtils]: 34: Hoare triple {5575#(<= ULTIMATE.start_sum_~i~0 5)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5575#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:28,566 INFO L280 TraceCheckUtils]: 35: Hoare triple {5575#(<= ULTIMATE.start_sum_~i~0 5)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5576#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:28,566 INFO L280 TraceCheckUtils]: 36: Hoare triple {5576#(<= ULTIMATE.start_sum_~i~0 6)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5576#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:28,567 INFO L280 TraceCheckUtils]: 37: Hoare triple {5576#(<= ULTIMATE.start_sum_~i~0 6)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5577#(<= ULTIMATE.start_sum_~i~0 7)} is VALID [2020-07-29 03:25:28,567 INFO L280 TraceCheckUtils]: 38: Hoare triple {5577#(<= ULTIMATE.start_sum_~i~0 7)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5577#(<= ULTIMATE.start_sum_~i~0 7)} is VALID [2020-07-29 03:25:28,568 INFO L280 TraceCheckUtils]: 39: Hoare triple {5577#(<= ULTIMATE.start_sum_~i~0 7)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5578#(<= ULTIMATE.start_sum_~i~0 8)} is VALID [2020-07-29 03:25:28,568 INFO L280 TraceCheckUtils]: 40: Hoare triple {5578#(<= ULTIMATE.start_sum_~i~0 8)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5578#(<= ULTIMATE.start_sum_~i~0 8)} is VALID [2020-07-29 03:25:28,569 INFO L280 TraceCheckUtils]: 41: Hoare triple {5578#(<= ULTIMATE.start_sum_~i~0 8)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5579#(<= ULTIMATE.start_sum_~i~0 9)} is VALID [2020-07-29 03:25:28,569 INFO L280 TraceCheckUtils]: 42: Hoare triple {5579#(<= ULTIMATE.start_sum_~i~0 9)} assume !(sum_~i~0 < 10); {5569#false} is VALID [2020-07-29 03:25:28,569 INFO L280 TraceCheckUtils]: 43: Hoare triple {5569#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {5569#false} is VALID [2020-07-29 03:25:28,570 INFO L280 TraceCheckUtils]: 44: Hoare triple {5569#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {5569#false} is VALID [2020-07-29 03:25:28,570 INFO L280 TraceCheckUtils]: 45: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,570 INFO L280 TraceCheckUtils]: 46: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,570 INFO L280 TraceCheckUtils]: 47: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,570 INFO L280 TraceCheckUtils]: 48: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,570 INFO L280 TraceCheckUtils]: 49: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,570 INFO L280 TraceCheckUtils]: 50: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,570 INFO L280 TraceCheckUtils]: 51: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,571 INFO L280 TraceCheckUtils]: 52: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,571 INFO L280 TraceCheckUtils]: 53: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,571 INFO L280 TraceCheckUtils]: 54: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,571 INFO L280 TraceCheckUtils]: 55: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,571 INFO L280 TraceCheckUtils]: 56: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,571 INFO L280 TraceCheckUtils]: 57: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,571 INFO L280 TraceCheckUtils]: 58: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,571 INFO L280 TraceCheckUtils]: 59: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,572 INFO L280 TraceCheckUtils]: 60: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,572 INFO L280 TraceCheckUtils]: 61: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-07-29 03:25:28,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046131575] [2020-07-29 03:25:28,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3270996] [2020-07-29 03:25:28,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:28,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:25:28,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:28,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 03:25:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:28,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:28,941 INFO L280 TraceCheckUtils]: 0: Hoare triple {5568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5568#true} is VALID [2020-07-29 03:25:28,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {5568#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {5568#true} is VALID [2020-07-29 03:25:28,941 INFO L280 TraceCheckUtils]: 2: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,942 INFO L280 TraceCheckUtils]: 3: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,942 INFO L280 TraceCheckUtils]: 4: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,942 INFO L280 TraceCheckUtils]: 5: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,942 INFO L280 TraceCheckUtils]: 6: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,942 INFO L280 TraceCheckUtils]: 7: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,943 INFO L280 TraceCheckUtils]: 8: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,943 INFO L280 TraceCheckUtils]: 9: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,943 INFO L280 TraceCheckUtils]: 10: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,943 INFO L280 TraceCheckUtils]: 11: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,944 INFO L280 TraceCheckUtils]: 13: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,944 INFO L280 TraceCheckUtils]: 14: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,944 INFO L280 TraceCheckUtils]: 15: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,944 INFO L280 TraceCheckUtils]: 16: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,944 INFO L280 TraceCheckUtils]: 17: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,944 INFO L280 TraceCheckUtils]: 18: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,944 INFO L280 TraceCheckUtils]: 19: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,945 INFO L280 TraceCheckUtils]: 20: Hoare triple {5568#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {5568#true} is VALID [2020-07-29 03:25:28,945 INFO L280 TraceCheckUtils]: 21: Hoare triple {5568#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {5568#true} is VALID [2020-07-29 03:25:28,945 INFO L280 TraceCheckUtils]: 22: Hoare triple {5568#true} assume !(main_~i~1 < 10); {5568#true} is VALID [2020-07-29 03:25:28,946 INFO L280 TraceCheckUtils]: 23: Hoare triple {5568#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {5652#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:28,946 INFO L280 TraceCheckUtils]: 24: Hoare triple {5652#(<= ULTIMATE.start_sum_~i~0 0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5652#(<= ULTIMATE.start_sum_~i~0 0)} is VALID [2020-07-29 03:25:28,947 INFO L280 TraceCheckUtils]: 25: Hoare triple {5652#(<= ULTIMATE.start_sum_~i~0 0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5571#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:28,947 INFO L280 TraceCheckUtils]: 26: Hoare triple {5571#(<= ULTIMATE.start_sum_~i~0 1)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5571#(<= ULTIMATE.start_sum_~i~0 1)} is VALID [2020-07-29 03:25:28,948 INFO L280 TraceCheckUtils]: 27: Hoare triple {5571#(<= ULTIMATE.start_sum_~i~0 1)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5572#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:28,948 INFO L280 TraceCheckUtils]: 28: Hoare triple {5572#(<= ULTIMATE.start_sum_~i~0 2)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5572#(<= ULTIMATE.start_sum_~i~0 2)} is VALID [2020-07-29 03:25:28,949 INFO L280 TraceCheckUtils]: 29: Hoare triple {5572#(<= ULTIMATE.start_sum_~i~0 2)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5573#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:28,949 INFO L280 TraceCheckUtils]: 30: Hoare triple {5573#(<= ULTIMATE.start_sum_~i~0 3)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5573#(<= ULTIMATE.start_sum_~i~0 3)} is VALID [2020-07-29 03:25:28,950 INFO L280 TraceCheckUtils]: 31: Hoare triple {5573#(<= ULTIMATE.start_sum_~i~0 3)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5574#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:28,951 INFO L280 TraceCheckUtils]: 32: Hoare triple {5574#(<= ULTIMATE.start_sum_~i~0 4)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5574#(<= ULTIMATE.start_sum_~i~0 4)} is VALID [2020-07-29 03:25:28,951 INFO L280 TraceCheckUtils]: 33: Hoare triple {5574#(<= ULTIMATE.start_sum_~i~0 4)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5575#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:28,952 INFO L280 TraceCheckUtils]: 34: Hoare triple {5575#(<= ULTIMATE.start_sum_~i~0 5)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5575#(<= ULTIMATE.start_sum_~i~0 5)} is VALID [2020-07-29 03:25:28,952 INFO L280 TraceCheckUtils]: 35: Hoare triple {5575#(<= ULTIMATE.start_sum_~i~0 5)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5576#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:28,953 INFO L280 TraceCheckUtils]: 36: Hoare triple {5576#(<= ULTIMATE.start_sum_~i~0 6)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5576#(<= ULTIMATE.start_sum_~i~0 6)} is VALID [2020-07-29 03:25:28,953 INFO L280 TraceCheckUtils]: 37: Hoare triple {5576#(<= ULTIMATE.start_sum_~i~0 6)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5577#(<= ULTIMATE.start_sum_~i~0 7)} is VALID [2020-07-29 03:25:28,954 INFO L280 TraceCheckUtils]: 38: Hoare triple {5577#(<= ULTIMATE.start_sum_~i~0 7)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5577#(<= ULTIMATE.start_sum_~i~0 7)} is VALID [2020-07-29 03:25:28,955 INFO L280 TraceCheckUtils]: 39: Hoare triple {5577#(<= ULTIMATE.start_sum_~i~0 7)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5578#(<= ULTIMATE.start_sum_~i~0 8)} is VALID [2020-07-29 03:25:28,955 INFO L280 TraceCheckUtils]: 40: Hoare triple {5578#(<= ULTIMATE.start_sum_~i~0 8)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5578#(<= ULTIMATE.start_sum_~i~0 8)} is VALID [2020-07-29 03:25:28,956 INFO L280 TraceCheckUtils]: 41: Hoare triple {5578#(<= ULTIMATE.start_sum_~i~0 8)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5579#(<= ULTIMATE.start_sum_~i~0 9)} is VALID [2020-07-29 03:25:28,956 INFO L280 TraceCheckUtils]: 42: Hoare triple {5579#(<= ULTIMATE.start_sum_~i~0 9)} assume !(sum_~i~0 < 10); {5569#false} is VALID [2020-07-29 03:25:28,956 INFO L280 TraceCheckUtils]: 43: Hoare triple {5569#false} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {5569#false} is VALID [2020-07-29 03:25:28,956 INFO L280 TraceCheckUtils]: 44: Hoare triple {5569#false} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {5569#false} is VALID [2020-07-29 03:25:28,957 INFO L280 TraceCheckUtils]: 45: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,957 INFO L280 TraceCheckUtils]: 46: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,957 INFO L280 TraceCheckUtils]: 47: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,957 INFO L280 TraceCheckUtils]: 48: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,957 INFO L280 TraceCheckUtils]: 49: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,957 INFO L280 TraceCheckUtils]: 50: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,957 INFO L280 TraceCheckUtils]: 51: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,958 INFO L280 TraceCheckUtils]: 52: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,958 INFO L280 TraceCheckUtils]: 53: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,958 INFO L280 TraceCheckUtils]: 54: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,958 INFO L280 TraceCheckUtils]: 55: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,958 INFO L280 TraceCheckUtils]: 56: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,958 INFO L280 TraceCheckUtils]: 57: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,958 INFO L280 TraceCheckUtils]: 58: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,958 INFO L280 TraceCheckUtils]: 59: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,959 INFO L280 TraceCheckUtils]: 60: Hoare triple {5569#false} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {5569#false} is VALID [2020-07-29 03:25:28,959 INFO L280 TraceCheckUtils]: 61: Hoare triple {5569#false} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {5569#false} is VALID [2020-07-29 03:25:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-07-29 03:25:28,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:28,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-07-29 03:25:28,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494853632] [2020-07-29 03:25:28,962 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:28,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:28,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 10 times [2020-07-29 03:25:28,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:28,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669311839] [2020-07-29 03:25:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:28,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:28,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:28,967 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:29,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:29,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 03:25:29,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-07-29 03:25:29,011 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. cyclomatic complexity: 9 Second operand 13 states. [2020-07-29 03:25:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:29,433 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2020-07-29 03:25:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 03:25:29,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 03:25:29,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:29,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2020-07-29 03:25:29,492 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:29,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2020-07-29 03:25:29,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-07-29 03:25:29,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-07-29 03:25:29,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2020-07-29 03:25:29,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:29,494 INFO L688 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2020-07-29 03:25:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2020-07-29 03:25:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2020-07-29 03:25:29,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:29,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states and 98 transitions. Second operand 75 states. [2020-07-29 03:25:29,497 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states and 98 transitions. Second operand 75 states. [2020-07-29 03:25:29,497 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 75 states. [2020-07-29 03:25:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:29,500 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2020-07-29 03:25:29,501 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2020-07-29 03:25:29,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:29,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:29,502 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 94 states and 98 transitions. [2020-07-29 03:25:29,502 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 94 states and 98 transitions. [2020-07-29 03:25:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:29,505 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2020-07-29 03:25:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2020-07-29 03:25:29,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:29,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:29,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:29,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-29 03:25:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2020-07-29 03:25:29,508 INFO L711 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2020-07-29 03:25:29,509 INFO L591 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2020-07-29 03:25:29,509 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2020-07-29 03:25:29,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2020-07-29 03:25:29,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:29,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:29,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:29,511 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:29,512 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:29,512 INFO L794 eck$LassoCheckResult]: Stem: 5877#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5876#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5872#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5873#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5874#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5875#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5918#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5916#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5914#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5912#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5910#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5908#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5906#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5904#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5902#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5900#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5898#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5896#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5894#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5892#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5890#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 5888#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 5887#L23-3 assume !(main_~i~1 < 10); 5871#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 5862#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5863#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5864#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5865#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5934#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5933#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5932#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5931#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5930#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5929#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5928#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5927#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5926#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5925#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5924#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5923#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5922#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5921#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5920#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5884#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5883#L9-3 assume !(sum_~i~0 < 10); 5860#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 5861#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 5880#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5881#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5882#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5919#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5917#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5915#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5913#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5911#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5909#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5907#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5905#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5903#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5901#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5899#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5897#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5895#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5893#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5891#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5889#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5886#L9-7 [2020-07-29 03:25:29,512 INFO L796 eck$LassoCheckResult]: Loop: 5886#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 5885#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5886#L9-7 [2020-07-29 03:25:29,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:29,513 INFO L82 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 9 times [2020-07-29 03:25:29,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:29,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755569268] [2020-07-29 03:25:29,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:29,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:29,977 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:30,006 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:30,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:30,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 11 times [2020-07-29 03:25:30,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:30,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366156821] [2020-07-29 03:25:30,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:30,021 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:30,023 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:30,024 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:30,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:30,025 INFO L82 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 10 times [2020-07-29 03:25:30,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:30,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431154839] [2020-07-29 03:25:30,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:30,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {6130#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6130#true} is VALID [2020-07-29 03:25:30,270 INFO L280 TraceCheckUtils]: 1: Hoare triple {6130#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {6130#true} is VALID [2020-07-29 03:25:30,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,271 INFO L280 TraceCheckUtils]: 3: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,271 INFO L280 TraceCheckUtils]: 4: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,271 INFO L280 TraceCheckUtils]: 5: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,271 INFO L280 TraceCheckUtils]: 6: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,271 INFO L280 TraceCheckUtils]: 7: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,272 INFO L280 TraceCheckUtils]: 8: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,272 INFO L280 TraceCheckUtils]: 9: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,272 INFO L280 TraceCheckUtils]: 10: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,273 INFO L280 TraceCheckUtils]: 11: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,273 INFO L280 TraceCheckUtils]: 12: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,273 INFO L280 TraceCheckUtils]: 13: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,273 INFO L280 TraceCheckUtils]: 14: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,273 INFO L280 TraceCheckUtils]: 15: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,274 INFO L280 TraceCheckUtils]: 16: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,274 INFO L280 TraceCheckUtils]: 17: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,274 INFO L280 TraceCheckUtils]: 18: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,274 INFO L280 TraceCheckUtils]: 19: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,274 INFO L280 TraceCheckUtils]: 20: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,274 INFO L280 TraceCheckUtils]: 21: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,275 INFO L280 TraceCheckUtils]: 22: Hoare triple {6130#true} assume !(main_~i~1 < 10); {6130#true} is VALID [2020-07-29 03:25:30,275 INFO L280 TraceCheckUtils]: 23: Hoare triple {6130#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {6130#true} is VALID [2020-07-29 03:25:30,275 INFO L280 TraceCheckUtils]: 24: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,275 INFO L280 TraceCheckUtils]: 25: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,276 INFO L280 TraceCheckUtils]: 26: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,276 INFO L280 TraceCheckUtils]: 27: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,276 INFO L280 TraceCheckUtils]: 28: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,277 INFO L280 TraceCheckUtils]: 29: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,277 INFO L280 TraceCheckUtils]: 30: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,277 INFO L280 TraceCheckUtils]: 31: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,277 INFO L280 TraceCheckUtils]: 32: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,277 INFO L280 TraceCheckUtils]: 33: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,278 INFO L280 TraceCheckUtils]: 34: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,278 INFO L280 TraceCheckUtils]: 35: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,278 INFO L280 TraceCheckUtils]: 36: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,278 INFO L280 TraceCheckUtils]: 37: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,279 INFO L280 TraceCheckUtils]: 38: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,279 INFO L280 TraceCheckUtils]: 39: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,279 INFO L280 TraceCheckUtils]: 40: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,279 INFO L280 TraceCheckUtils]: 41: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,279 INFO L280 TraceCheckUtils]: 42: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,280 INFO L280 TraceCheckUtils]: 43: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,280 INFO L280 TraceCheckUtils]: 44: Hoare triple {6130#true} assume !(sum_~i~0 < 10); {6130#true} is VALID [2020-07-29 03:25:30,280 INFO L280 TraceCheckUtils]: 45: Hoare triple {6130#true} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {6130#true} is VALID [2020-07-29 03:25:30,282 INFO L280 TraceCheckUtils]: 46: Hoare triple {6130#true} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {6132#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,283 INFO L280 TraceCheckUtils]: 47: Hoare triple {6132#(= 0 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6132#(= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,283 INFO L280 TraceCheckUtils]: 48: Hoare triple {6132#(= 0 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6133#(<= 1 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,284 INFO L280 TraceCheckUtils]: 49: Hoare triple {6133#(<= 1 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6133#(<= 1 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,285 INFO L280 TraceCheckUtils]: 50: Hoare triple {6133#(<= 1 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6134#(<= 2 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,285 INFO L280 TraceCheckUtils]: 51: Hoare triple {6134#(<= 2 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6134#(<= 2 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,286 INFO L280 TraceCheckUtils]: 52: Hoare triple {6134#(<= 2 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6135#(<= 3 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,287 INFO L280 TraceCheckUtils]: 53: Hoare triple {6135#(<= 3 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6135#(<= 3 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,288 INFO L280 TraceCheckUtils]: 54: Hoare triple {6135#(<= 3 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6136#(<= 4 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,288 INFO L280 TraceCheckUtils]: 55: Hoare triple {6136#(<= 4 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6136#(<= 4 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,289 INFO L280 TraceCheckUtils]: 56: Hoare triple {6136#(<= 4 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6137#(<= 5 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,290 INFO L280 TraceCheckUtils]: 57: Hoare triple {6137#(<= 5 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6137#(<= 5 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,290 INFO L280 TraceCheckUtils]: 58: Hoare triple {6137#(<= 5 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6138#(<= 6 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,291 INFO L280 TraceCheckUtils]: 59: Hoare triple {6138#(<= 6 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6138#(<= 6 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,292 INFO L280 TraceCheckUtils]: 60: Hoare triple {6138#(<= 6 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6139#(<= 7 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,292 INFO L280 TraceCheckUtils]: 61: Hoare triple {6139#(<= 7 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6139#(<= 7 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,293 INFO L280 TraceCheckUtils]: 62: Hoare triple {6139#(<= 7 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6140#(<= 8 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,293 INFO L280 TraceCheckUtils]: 63: Hoare triple {6140#(<= 8 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6140#(<= 8 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,294 INFO L280 TraceCheckUtils]: 64: Hoare triple {6140#(<= 8 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6141#(<= 9 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,295 INFO L280 TraceCheckUtils]: 65: Hoare triple {6141#(<= 9 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6141#(<= 9 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,295 INFO L280 TraceCheckUtils]: 66: Hoare triple {6141#(<= 9 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6142#(<= 10 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,296 INFO L280 TraceCheckUtils]: 67: Hoare triple {6142#(<= 10 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6131#false} is VALID [2020-07-29 03:25:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 81 proven. 19 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2020-07-29 03:25:30,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431154839] [2020-07-29 03:25:30,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442140637] [2020-07-29 03:25:30,300 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:30,377 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 03:25:30,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:30,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 03:25:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:30,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:30,694 INFO L280 TraceCheckUtils]: 0: Hoare triple {6130#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6130#true} is VALID [2020-07-29 03:25:30,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {6130#true} havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; {6130#true} is VALID [2020-07-29 03:25:30,695 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,695 INFO L280 TraceCheckUtils]: 3: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,695 INFO L280 TraceCheckUtils]: 4: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,695 INFO L280 TraceCheckUtils]: 7: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,696 INFO L280 TraceCheckUtils]: 8: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,696 INFO L280 TraceCheckUtils]: 9: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,696 INFO L280 TraceCheckUtils]: 10: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,697 INFO L280 TraceCheckUtils]: 11: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,697 INFO L280 TraceCheckUtils]: 12: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,697 INFO L280 TraceCheckUtils]: 13: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,697 INFO L280 TraceCheckUtils]: 14: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,697 INFO L280 TraceCheckUtils]: 15: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,698 INFO L280 TraceCheckUtils]: 16: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,698 INFO L280 TraceCheckUtils]: 17: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,698 INFO L280 TraceCheckUtils]: 18: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,698 INFO L280 TraceCheckUtils]: 19: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,699 INFO L280 TraceCheckUtils]: 20: Hoare triple {6130#true} assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; {6130#true} is VALID [2020-07-29 03:25:30,699 INFO L280 TraceCheckUtils]: 21: Hoare triple {6130#true} main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; {6130#true} is VALID [2020-07-29 03:25:30,699 INFO L280 TraceCheckUtils]: 22: Hoare triple {6130#true} assume !(main_~i~1 < 10); {6130#true} is VALID [2020-07-29 03:25:30,699 INFO L280 TraceCheckUtils]: 23: Hoare triple {6130#true} sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {6130#true} is VALID [2020-07-29 03:25:30,700 INFO L280 TraceCheckUtils]: 24: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,700 INFO L280 TraceCheckUtils]: 25: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,700 INFO L280 TraceCheckUtils]: 26: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,700 INFO L280 TraceCheckUtils]: 27: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,700 INFO L280 TraceCheckUtils]: 28: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,701 INFO L280 TraceCheckUtils]: 29: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,701 INFO L280 TraceCheckUtils]: 30: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,701 INFO L280 TraceCheckUtils]: 31: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,702 INFO L280 TraceCheckUtils]: 32: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,702 INFO L280 TraceCheckUtils]: 33: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,703 INFO L280 TraceCheckUtils]: 34: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,703 INFO L280 TraceCheckUtils]: 35: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,703 INFO L280 TraceCheckUtils]: 36: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,703 INFO L280 TraceCheckUtils]: 37: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,704 INFO L280 TraceCheckUtils]: 38: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,704 INFO L280 TraceCheckUtils]: 39: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,704 INFO L280 TraceCheckUtils]: 40: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,705 INFO L280 TraceCheckUtils]: 41: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,705 INFO L280 TraceCheckUtils]: 42: Hoare triple {6130#true} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6130#true} is VALID [2020-07-29 03:25:30,705 INFO L280 TraceCheckUtils]: 43: Hoare triple {6130#true} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6130#true} is VALID [2020-07-29 03:25:30,706 INFO L280 TraceCheckUtils]: 44: Hoare triple {6130#true} assume !(sum_~i~0 < 10); {6130#true} is VALID [2020-07-29 03:25:30,706 INFO L280 TraceCheckUtils]: 45: Hoare triple {6130#true} sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); {6130#true} is VALID [2020-07-29 03:25:30,708 INFO L280 TraceCheckUtils]: 46: Hoare triple {6130#true} main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; {6284#(<= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,709 INFO L280 TraceCheckUtils]: 47: Hoare triple {6284#(<= 0 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6284#(<= 0 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,711 INFO L280 TraceCheckUtils]: 48: Hoare triple {6284#(<= 0 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6133#(<= 1 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,711 INFO L280 TraceCheckUtils]: 49: Hoare triple {6133#(<= 1 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6133#(<= 1 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,712 INFO L280 TraceCheckUtils]: 50: Hoare triple {6133#(<= 1 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6134#(<= 2 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,713 INFO L280 TraceCheckUtils]: 51: Hoare triple {6134#(<= 2 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6134#(<= 2 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,714 INFO L280 TraceCheckUtils]: 52: Hoare triple {6134#(<= 2 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6135#(<= 3 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,715 INFO L280 TraceCheckUtils]: 53: Hoare triple {6135#(<= 3 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6135#(<= 3 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,716 INFO L280 TraceCheckUtils]: 54: Hoare triple {6135#(<= 3 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6136#(<= 4 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,717 INFO L280 TraceCheckUtils]: 55: Hoare triple {6136#(<= 4 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6136#(<= 4 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,718 INFO L280 TraceCheckUtils]: 56: Hoare triple {6136#(<= 4 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6137#(<= 5 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,719 INFO L280 TraceCheckUtils]: 57: Hoare triple {6137#(<= 5 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6137#(<= 5 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,720 INFO L280 TraceCheckUtils]: 58: Hoare triple {6137#(<= 5 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6138#(<= 6 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,721 INFO L280 TraceCheckUtils]: 59: Hoare triple {6138#(<= 6 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6138#(<= 6 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,722 INFO L280 TraceCheckUtils]: 60: Hoare triple {6138#(<= 6 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6139#(<= 7 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,724 INFO L280 TraceCheckUtils]: 61: Hoare triple {6139#(<= 7 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6139#(<= 7 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,725 INFO L280 TraceCheckUtils]: 62: Hoare triple {6139#(<= 7 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6140#(<= 8 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,726 INFO L280 TraceCheckUtils]: 63: Hoare triple {6140#(<= 8 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6140#(<= 8 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,726 INFO L280 TraceCheckUtils]: 64: Hoare triple {6140#(<= 8 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6141#(<= 9 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,727 INFO L280 TraceCheckUtils]: 65: Hoare triple {6141#(<= 9 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6141#(<= 9 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,728 INFO L280 TraceCheckUtils]: 66: Hoare triple {6141#(<= 9 ULTIMATE.start_sum_~i~0)} sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; {6142#(<= 10 ULTIMATE.start_sum_~i~0)} is VALID [2020-07-29 03:25:30,729 INFO L280 TraceCheckUtils]: 67: Hoare triple {6142#(<= 10 ULTIMATE.start_sum_~i~0)} assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; {6131#false} is VALID [2020-07-29 03:25:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2020-07-29 03:25:30,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 03:25:30,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2020-07-29 03:25:30,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798477255] [2020-07-29 03:25:30,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:30,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 03:25:30,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-07-29 03:25:30,774 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 9 Second operand 13 states. [2020-07-29 03:25:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:31,242 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-07-29 03:25:31,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-29 03:25:31,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 03:25:31,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:31,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2020-07-29 03:25:31,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:31,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2020-07-29 03:25:31,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-07-29 03:25:31,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-07-29 03:25:31,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2020-07-29 03:25:31,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:31,306 INFO L688 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-07-29 03:25:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2020-07-29 03:25:31,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-07-29 03:25:31,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:31,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states and 73 transitions. Second operand 72 states. [2020-07-29 03:25:31,308 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states and 73 transitions. Second operand 72 states. [2020-07-29 03:25:31,308 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 72 states. [2020-07-29 03:25:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:31,309 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2020-07-29 03:25:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-07-29 03:25:31,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:31,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:31,310 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states and 73 transitions. [2020-07-29 03:25:31,310 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states and 73 transitions. [2020-07-29 03:25:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:31,312 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2020-07-29 03:25:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-07-29 03:25:31,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:31,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:31,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:31,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-29 03:25:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-07-29 03:25:31,314 INFO L711 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-07-29 03:25:31,314 INFO L591 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-07-29 03:25:31,314 INFO L424 BuchiCegarLoop]: ======== Iteration 24============ [2020-07-29 03:25:31,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2020-07-29 03:25:31,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:31,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:31,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:31,316 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:31,316 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:31,316 INFO L794 eck$LassoCheckResult]: Stem: 6454#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6451#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 6447#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 6448#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6449#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 6450#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6493#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 6492#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6490#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 6488#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6486#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 6484#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6482#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 6480#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6478#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 6476#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6474#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 6472#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6470#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 6468#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6466#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 6463#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 6462#L23-3 assume !(main_~i~1 < 10); 6446#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 6441#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6442#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6443#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6491#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6489#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6487#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6485#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6483#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6481#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6479#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6477#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6475#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6473#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6471#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6469#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6467#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6465#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6464#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6461#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6460#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6459#L9-3 assume !(sum_~i~0 < 10); 6439#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 6440#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 6457#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6458#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6455#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6456#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6510#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6509#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6508#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6507#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6506#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6505#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6504#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6503#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6502#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6501#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6500#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6499#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6498#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6497#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6496#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6495#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 6494#L9-8 assume !(sum_~i~0 < 10); 6452#L9-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 6453#L12-1 main_#t~ret7 := sum_#res;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 6444#L32-3 [2020-07-29 03:25:31,316 INFO L796 eck$LassoCheckResult]: Loop: 6444#L32-3 assume !!(main_~i~2 < 9);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 6445#L32-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 6444#L32-3 [2020-07-29 03:25:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:31,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2020-07-29 03:25:31,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:31,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878804566] [2020-07-29 03:25:31,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,481 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:206) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:337) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:223) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:883) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:797) 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:25:31,486 INFO L168 Benchmark]: Toolchain (without parser) took 25302.90 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 486.5 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 322.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:31,486 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:31,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:31,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:31,487 INFO L168 Benchmark]: Boogie Preprocessor took 35.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:31,488 INFO L168 Benchmark]: RCFGBuilder took 654.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:31,488 INFO L168 Benchmark]: BuchiAutomizer took 24221.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 342.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.9 MB). Peak memory consumption was 321.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:31,490 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 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 654.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24221.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 342.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.9 MB). Peak memory consumption was 321.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...