./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array10_pattern.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array10_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0942a0394519a722254bfe5a1820a904a71ba1b47e3e66c2c8dc2abe6585692f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:22:18,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:22:18,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:22:18,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:22:18,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:22:18,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:22:18,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:22:18,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:22:18,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:22:18,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:22:18,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:22:18,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:22:18,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:22:18,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:22:18,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:22:18,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:22:18,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:22:18,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:22:18,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:22:18,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:22:18,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:22:18,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:22:18,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:22:18,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:22:18,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:22:18,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:22:18,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:22:18,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:22:18,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:22:18,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:22:18,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:22:18,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:22:18,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:22:18,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:22:18,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:22:18,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:22:18,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:22:18,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:22:18,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:22:18,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:22:18,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:22:18,723 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:22:18,749 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:22:18,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:22:18,750 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:22:18,750 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:22:18,751 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:22:18,751 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:22:18,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:22:18,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:22:18,752 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:22:18,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:22:18,752 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:22:18,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:22:18,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:22:18,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:22:18,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:22:18,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:22:18,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:22:18,753 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:22:18,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:22:18,754 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:22:18,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:22:18,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:22:18,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:22:18,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:22:18,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:18,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:22:18,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:22:18,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:22:18,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:22:18,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:22:18,755 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:22:18,755 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:22:18,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:22:18,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(G ! call(reach_error())) ) 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 -> 0942a0394519a722254bfe5a1820a904a71ba1b47e3e66c2c8dc2abe6585692f [2022-02-20 14:22:18,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:22:18,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:22:18,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:22:18,982 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:22:18,983 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:22:18,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array10_pattern.c [2022-02-20 14:22:19,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ff1dff39/1c5e2d4048b84abab0f018cefd35b224/FLAG453d4821d [2022-02-20 14:22:19,400 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:22:19,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array10_pattern.c [2022-02-20 14:22:19,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ff1dff39/1c5e2d4048b84abab0f018cefd35b224/FLAG453d4821d [2022-02-20 14:22:19,414 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ff1dff39/1c5e2d4048b84abab0f018cefd35b224 [2022-02-20 14:22:19,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:22:19,418 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:22:19,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:19,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:22:19,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:22:19,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:19" (1/1) ... [2022-02-20 14:22:19,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e41d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:19, skipping insertion in model container [2022-02-20 14:22:19,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:19" (1/1) ... [2022-02-20 14:22:19,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:22:19,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:22:19,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array10_pattern.c[1326,1339] [2022-02-20 14:22:19,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:19,575 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:22:19,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array10_pattern.c[1326,1339] [2022-02-20 14:22:19,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:19,599 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:22:19,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:19 WrapperNode [2022-02-20 14:22:19,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:19,601 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:19,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:22:19,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:22:19,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:19" (1/1) ... [2022-02-20 14:22:19,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:19" (1/1) ... [2022-02-20 14:22:19,635 INFO L137 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2022-02-20 14:22:19,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:19,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:22:19,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:22:19,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:22:19,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:19" (1/1) ... [2022-02-20 14:22:19,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:19" (1/1) ... [2022-02-20 14:22:19,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:19" (1/1) ... [2022-02-20 14:22:19,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:19" (1/1) ... [2022-02-20 14:22:19,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:19" (1/1) ... [2022-02-20 14:22:19,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:19" (1/1) ... [2022-02-20 14:22:19,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:19" (1/1) ... [2022-02-20 14:22:19,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:22:19,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:22:19,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:22:19,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:22:19,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:19" (1/1) ... [2022-02-20 14:22:19,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:19,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:19,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:22:19,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:22:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:22:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:22:19,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:22:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:22:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:22:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:22:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:22:19,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:22:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:22:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:22:19,778 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:22:19,779 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:22:20,079 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder has thrown an exception: java.lang.AssertionError: transformation to positive normal form unsound at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.positiveNormalForm(PolynomialRelation.java:434) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.comparison(SmtUtils.java:1324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.termWithLocalSimplification(SmtUtils.java:1459) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Expression2Term.translate(Expression2Term.java:219) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Expression2Term.translate(Expression2Term.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Expression2Term.translateToTerm(Expression2Term.java:120) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Statements2TransFormula.addAssignment(Statements2TransFormula.java:288) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Statements2TransFormula.statementSequence(Statements2TransFormula.java:703) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.util.TransFormulaAdder.addTransitionFormulas(TransFormulaAdder.java:119) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.CfgBuilder$ProcedureCfgBuilder.buildProcedureCfgFromImplementation(CfgBuilder.java:733) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.CfgBuilder.createIcfg(CfgBuilder.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBuilderObserver.process(RCFGBuilderObserver.java:88) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.DFSTreeWalker.runObserver(DFSTreeWalker.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 14:22:20,082 INFO L158 Benchmark]: Toolchain (without parser) took 663.18ms. Allocated memory is still 109.1MB. Free memory was 76.2MB in the beginning and 66.2MB in the end (delta: 10.1MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-02-20 14:22:20,083 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 75.5MB. Free memory was 38.1MB in the beginning and 38.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:22:20,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.19ms. Allocated memory is still 109.1MB. Free memory was 76.0MB in the beginning and 83.0MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:22:20,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.28ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 81.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:22:20,087 INFO L158 Benchmark]: Boogie Preprocessor took 38.75ms. Allocated memory is still 109.1MB. Free memory was 81.2MB in the beginning and 79.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:22:20,087 INFO L158 Benchmark]: RCFGBuilder took 405.08ms. Allocated memory is still 109.1MB. Free memory was 79.9MB in the beginning and 66.2MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 14:22:20,092 INFO L339 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.14ms. Allocated memory is still 75.5MB. Free memory was 38.1MB in the beginning and 38.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.19ms. Allocated memory is still 109.1MB. Free memory was 76.0MB in the beginning and 83.0MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.28ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 81.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.75ms. Allocated memory is still 109.1MB. Free memory was 81.2MB in the beginning and 79.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 405.08ms. Allocated memory is still 109.1MB. Free memory was 79.9MB in the beginning and 66.2MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: - ExceptionOrErrorResult: AssertionError: transformation to positive normal form unsound de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: AssertionError: transformation to positive normal form unsound: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.positiveNormalForm(PolynomialRelation.java:434) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 14:22:20,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array10_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0942a0394519a722254bfe5a1820a904a71ba1b47e3e66c2c8dc2abe6585692f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:22:21,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:22:21,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:22:21,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:22:21,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:22:21,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:22:21,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:22:21,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:22:21,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:22:21,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:22:21,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:22:21,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:22:21,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:22:21,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:22:21,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:22:21,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:22:21,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:22:21,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:22:21,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:22:21,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:22:21,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:22:21,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:22:21,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:22:21,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:22:21,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:22:21,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:22:21,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:22:21,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:22:21,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:22:21,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:22:21,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:22:21,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:22:21,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:22:21,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:22:21,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:22:21,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:22:21,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:22:21,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:22:21,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:22:21,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:22:21,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:22:21,962 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 14:22:21,986 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:22:21,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:22:21,986 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:22:21,986 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:22:21,987 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:22:21,987 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:22:21,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:22:21,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:22:21,988 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:22:21,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:22:21,988 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:22:21,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:22:21,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:22:21,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:22:21,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:22:21,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:22:21,989 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 14:22:21,989 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 14:22:21,989 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 14:22:21,990 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:22:21,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:22:21,990 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:22:21,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:22:21,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:22:21,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:22:21,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:22:21,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:21,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:22:22,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:22:22,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:22:22,000 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 14:22:22,000 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 14:22:22,000 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:22:22,000 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:22:22,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:22:22,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 14:22:22,001 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(G ! call(reach_error())) ) 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 -> 0942a0394519a722254bfe5a1820a904a71ba1b47e3e66c2c8dc2abe6585692f [2022-02-20 14:22:22,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:22:22,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:22:22,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:22:22,298 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:22:22,299 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:22:22,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array10_pattern.c [2022-02-20 14:22:22,346 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1828c79a2/765d9cef24b14a908ad711521c484a43/FLAG6d5462a5d [2022-02-20 14:22:22,703 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:22:22,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array10_pattern.c [2022-02-20 14:22:22,709 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1828c79a2/765d9cef24b14a908ad711521c484a43/FLAG6d5462a5d [2022-02-20 14:22:22,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1828c79a2/765d9cef24b14a908ad711521c484a43 [2022-02-20 14:22:22,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:22:22,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:22:22,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:22,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:22:22,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:22:22,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:22" (1/1) ... [2022-02-20 14:22:22,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74bdaeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:22, skipping insertion in model container [2022-02-20 14:22:22,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:22" (1/1) ... [2022-02-20 14:22:22,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:22:22,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:22:22,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array10_pattern.c[1326,1339] [2022-02-20 14:22:22,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:22,933 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:22:22,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array10_pattern.c[1326,1339] [2022-02-20 14:22:22,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:23,011 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:22:23,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:23 WrapperNode [2022-02-20 14:22:23,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:23,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:23,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:22:23,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:22:23,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:23" (1/1) ... [2022-02-20 14:22:23,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:23" (1/1) ... [2022-02-20 14:22:23,064 INFO L137 Inliner]: procedures = 18, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2022-02-20 14:22:23,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:23,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:22:23,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:22:23,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:22:23,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:23" (1/1) ... [2022-02-20 14:22:23,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:23" (1/1) ... [2022-02-20 14:22:23,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:23" (1/1) ... [2022-02-20 14:22:23,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:23" (1/1) ... [2022-02-20 14:22:23,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:23" (1/1) ... [2022-02-20 14:22:23,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:23" (1/1) ... [2022-02-20 14:22:23,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:23" (1/1) ... [2022-02-20 14:22:23,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:22:23,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:22:23,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:22:23,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:22:23,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:23" (1/1) ... [2022-02-20 14:22:23,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:23,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:23,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:22:23,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:22:23,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 14:22:23,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:22:23,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:22:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:22:23,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:22:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 14:22:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:22:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:22:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:22:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 14:22:23,230 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:22:23,231 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:22:23,578 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:22:23,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:22:23,582 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:22:23,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:22:23 BoogieIcfgContainer [2022-02-20 14:22:23,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:22:23,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:22:23,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:22:23,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:22:23,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:22:22" (1/3) ... [2022-02-20 14:22:23,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e06b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:22:23, skipping insertion in model container [2022-02-20 14:22:23,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:23" (2/3) ... [2022-02-20 14:22:23,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e06b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:22:23, skipping insertion in model container [2022-02-20 14:22:23,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:22:23" (3/3) ... [2022-02-20 14:22:23,589 INFO L111 eAbstractionObserver]: Analyzing ICFG array10_pattern.c [2022-02-20 14:22:23,593 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:22:23,593 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:22:23,644 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:22:23,648 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:22:23,649 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:22:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:22:23,664 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:23,664 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:23,665 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:23,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1199380475, now seen corresponding path program 1 times [2022-02-20 14:22:23,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:22:23,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093355289] [2022-02-20 14:22:23,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:23,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:22:23,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:22:23,682 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:22:23,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 14:22:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:23,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 14:22:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:23,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:23,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ARR_SIZE~0 := 0bv64; {30#true} is VALID [2022-02-20 14:22:23,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~ite8#1, main_#t~mem7#1, main_#t~nondet9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;~ARR_SIZE~0 := ~sign_extendFrom16To64(main_#t~nondet4#1);havoc main_#t~nondet4#1; {30#true} is VALID [2022-02-20 14:22:23,890 INFO L272 TraceCheckUtils]: 2: Hoare triple {30#true} call assume_abort_if_not((if ~bvsgt64(~ARR_SIZE~0, 0bv64) then 1bv32 else 0bv32)); {30#true} is VALID [2022-02-20 14:22:23,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 14:22:23,891 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#true} assume 0bv32 == ~cond;assume false; {30#true} is VALID [2022-02-20 14:22:23,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} assume true; {30#true} is VALID [2022-02-20 14:22:23,892 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {30#true} {30#true} #80#return; {30#true} is VALID [2022-02-20 14:22:23,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));main_~count~0#1 := 0bv32;main_~num~0#1 := 4294967295bv32;main_~sum~0#1 := 0bv64;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0bv32; {30#true} is VALID [2022-02-20 14:22:23,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-02-20 14:22:23,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume false; {31#false} is VALID [2022-02-20 14:22:23,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#false} main_~count~0#1 := 0bv32; {31#false} is VALID [2022-02-20 14:22:23,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {31#false} is VALID [2022-02-20 14:22:23,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle64(~bvmul64(4bv64, main_~sum~0#1), ~bvmul64(~bvsub64(~ARR_SIZE~0, 1bv64), ~bvadd64(1bv64, ~ARR_SIZE~0))) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {31#false} is VALID [2022-02-20 14:22:23,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {31#false} is VALID [2022-02-20 14:22:23,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 14:22:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:22:23,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:22:23,897 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:22:23,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093355289] [2022-02-20 14:22:23,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093355289] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:23,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:23,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:22:23,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882627165] [2022-02-20 14:22:23,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:23,904 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:22:23,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:23,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:23,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:23,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:22:23,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:22:23,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:22:23,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:22:23,971 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:24,208 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-02-20 14:22:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:22:24,209 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:22:24,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 14:22:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 14:22:24,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 72 transitions. [2022-02-20 14:22:24,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:24,448 INFO L225 Difference]: With dead ends: 51 [2022-02-20 14:22:24,449 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 14:22:24,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:22:24,456 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:24,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:22:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 14:22:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 14:22:24,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:24,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:24,484 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:24,484 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:24,491 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 14:22:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:22:24,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:24,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:24,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-20 14:22:24,493 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-20 14:22:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:24,499 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 14:22:24,500 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:22:24,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:24,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:24,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:24,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 14:22:24,516 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-02-20 14:22:24,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:24,517 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 14:22:24,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:22:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:22:24,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:24,518 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:24,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:22:24,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 14:22:24,728 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:24,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash 966180883, now seen corresponding path program 1 times [2022-02-20 14:22:24,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:22:24,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468551260] [2022-02-20 14:22:24,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:24,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:22:24,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:22:24,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:22:24,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 14:22:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:24,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:22:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:24,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:25,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ARR_SIZE~0 := 0bv64; {212#true} is VALID [2022-02-20 14:22:25,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~ite8#1, main_#t~mem7#1, main_#t~nondet9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;~ARR_SIZE~0 := ~sign_extendFrom16To64(main_#t~nondet4#1);havoc main_#t~nondet4#1; {220#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0))} is VALID [2022-02-20 14:22:25,190 INFO L272 TraceCheckUtils]: 2: Hoare triple {220#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0))} call assume_abort_if_not((if ~bvsgt64(~ARR_SIZE~0, 0bv64) then 1bv32 else 0bv32)); {220#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0))} is VALID [2022-02-20 14:22:25,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {220#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0))} ~cond := #in~cond; {227#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0)) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))} is VALID [2022-02-20 14:22:25,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {227#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0)) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))} assume !(0bv32 == ~cond); {231#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:25,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0)))} assume true; {231#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:25,193 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {231#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0)))} {220#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0))} #80#return; {238#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:25,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0)))} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));main_~count~0#1 := 0bv32;main_~num~0#1 := 4294967295bv32;main_~sum~0#1 := 0bv64;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0bv32; {242#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:22:25,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {242#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_6| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_6|) ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {213#false} is VALID [2022-02-20 14:22:25,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#false} assume !false;main_~index~0#1 := ~sign_extendFrom16To64(main_#t~nondet6#1);havoc main_#t~nondet6#1; {213#false} is VALID [2022-02-20 14:22:25,195 INFO L272 TraceCheckUtils]: 10: Hoare triple {213#false} call assume_abort_if_not((if ~bvsge64(main_~index~0#1, 0bv64) && ~bvslt64(main_~index~0#1, ~ARR_SIZE~0) then 1bv32 else 0bv32)); {213#false} is VALID [2022-02-20 14:22:25,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2022-02-20 14:22:25,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#false} assume !(0bv32 == ~cond); {213#false} is VALID [2022-02-20 14:22:25,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {213#false} assume true; {213#false} is VALID [2022-02-20 14:22:25,196 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {213#false} {213#false} #82#return; {213#false} is VALID [2022-02-20 14:22:25,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {213#false} call write~intINTTYPE4(~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1))))[32:0], main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32); {213#false} is VALID [2022-02-20 14:22:25,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {213#false} assume !(0bv64 != ~bvsrem64(main_~index~0#1, 2bv64));call main_#t~mem7#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);main_#t~ite8#1 := ~sign_extendFrom32To64(main_#t~mem7#1); {213#false} is VALID [2022-02-20 14:22:25,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {213#false} call write~intINTTYPE4(main_#t~ite8#1[32:0], main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);havoc main_#t~ite8#1;havoc main_#t~mem7#1;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {213#false} is VALID [2022-02-20 14:22:25,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {213#false} assume 0bv32 == main_~temp~0#1; {213#false} is VALID [2022-02-20 14:22:25,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {213#false} main_~count~0#1 := 0bv32; {213#false} is VALID [2022-02-20 14:22:25,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {213#false} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {213#false} is VALID [2022-02-20 14:22:25,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {213#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle64(~bvmul64(4bv64, main_~sum~0#1), ~bvmul64(~bvsub64(~ARR_SIZE~0, 1bv64), ~bvadd64(1bv64, ~ARR_SIZE~0))) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {213#false} is VALID [2022-02-20 14:22:25,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {213#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {213#false} is VALID [2022-02-20 14:22:25,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-02-20 14:22:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:22:25,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:22:25,199 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:22:25,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468551260] [2022-02-20 14:22:25,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468551260] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:25,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:25,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 14:22:25,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639217164] [2022-02-20 14:22:25,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:25,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-02-20 14:22:25,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:25,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:25,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:25,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:22:25,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:22:25,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:22:25,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:22:25,275 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:25,662 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-02-20 14:22:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:22:25,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-02-20 14:22:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-02-20 14:22:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-02-20 14:22:25,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-02-20 14:22:25,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:25,837 INFO L225 Difference]: With dead ends: 45 [2022-02-20 14:22:25,837 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 14:22:25,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:22:25,838 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:25,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-02-20 14:22:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 14:22:25,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 14:22:25,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:25,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:25,841 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:25,842 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:25,843 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-20 14:22:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-20 14:22:25,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:25,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:25,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-02-20 14:22:25,846 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-02-20 14:22:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:25,847 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-20 14:22:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-20 14:22:25,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:25,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:25,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:25,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-02-20 14:22:25,849 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 24 [2022-02-20 14:22:25,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:25,849 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-02-20 14:22:25,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:22:25,849 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-20 14:22:25,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:22:25,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:25,850 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:25,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:22:26,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 14:22:26,050 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:26,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:26,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1699168939, now seen corresponding path program 1 times [2022-02-20 14:22:26,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:22:26,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598734466] [2022-02-20 14:22:26,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:26,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:22:26,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:22:26,053 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:22:26,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 14:22:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:26,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 14:22:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:26,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:26,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {436#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ARR_SIZE~0 := 0bv64; {436#true} is VALID [2022-02-20 14:22:26,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~ite8#1, main_#t~mem7#1, main_#t~nondet9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;~ARR_SIZE~0 := ~sign_extendFrom16To64(main_#t~nondet4#1);havoc main_#t~nondet4#1; {444#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|)))} is VALID [2022-02-20 14:22:26,619 INFO L272 TraceCheckUtils]: 2: Hoare triple {444#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|)))} call assume_abort_if_not((if ~bvsgt64(~ARR_SIZE~0, 0bv64) then 1bv32 else 0bv32)); {444#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|)))} is VALID [2022-02-20 14:22:26,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {444#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|)))} ~cond := #in~cond; {451#(and (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} is VALID [2022-02-20 14:22:26,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {451#(and (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} assume !(0bv32 == ~cond); {455#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} is VALID [2022-02-20 14:22:26,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {455#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} assume true; {455#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} is VALID [2022-02-20 14:22:26,625 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {455#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} {444#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|)))} #80#return; {462#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} is VALID [2022-02-20 14:22:26,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));main_~count~0#1 := 0bv32;main_~num~0#1 := 4294967295bv32;main_~sum~0#1 := 0bv64;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0bv32; {466#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} is VALID [2022-02-20 14:22:26,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call write~intINTTYPE4(0bv32, main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call write~intINTTYPE4(0bv32, main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32); {466#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} is VALID [2022-02-20 14:22:26,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {473#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~count~0#1|) (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} is VALID [2022-02-20 14:22:26,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~count~0#1|) (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_8| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_8|))))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:26,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !false;main_~index~0#1 := ~sign_extendFrom16To64(main_#t~nondet6#1);havoc main_#t~nondet6#1; {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:26,632 INFO L272 TraceCheckUtils]: 12: Hoare triple {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} call assume_abort_if_not((if ~bvsge64(main_~index~0#1, 0bv64) && ~bvslt64(main_~index~0#1, ~ARR_SIZE~0) then 1bv32 else 0bv32)); {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:26,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} ~cond := #in~cond; {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:26,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !(0bv32 == ~cond); {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:26,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume true; {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:26,636 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} #82#return; {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:26,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} call write~intINTTYPE4(~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1))))[32:0], main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32); {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:26,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !(0bv64 != ~bvsrem64(main_~index~0#1, 2bv64));call main_#t~mem7#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);main_#t~ite8#1 := ~sign_extendFrom32To64(main_#t~mem7#1); {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:26,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} call write~intINTTYPE4(main_#t~ite8#1[32:0], main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);havoc main_#t~ite8#1;havoc main_#t~mem7#1;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:26,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume 0bv32 == main_~temp~0#1; {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:26,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {477#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} main_~count~0#1 := 0bv32; {511#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:26,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {511#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {437#false} is VALID [2022-02-20 14:22:26,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {437#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle64(~bvmul64(4bv64, main_~sum~0#1), ~bvmul64(~bvsub64(~ARR_SIZE~0, 1bv64), ~bvadd64(1bv64, ~ARR_SIZE~0))) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {437#false} is VALID [2022-02-20 14:22:26,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {437#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {437#false} is VALID [2022-02-20 14:22:26,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {437#false} assume !false; {437#false} is VALID [2022-02-20 14:22:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:22:26,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:22:27,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {437#false} assume !false; {437#false} is VALID [2022-02-20 14:22:27,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {437#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {437#false} is VALID [2022-02-20 14:22:27,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {437#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle64(~bvmul64(4bv64, main_~sum~0#1), ~bvmul64(~bvsub64(~ARR_SIZE~0, 1bv64), ~bvadd64(1bv64, ~ARR_SIZE~0))) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {437#false} is VALID [2022-02-20 14:22:27,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {533#(bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {437#false} is VALID [2022-02-20 14:22:27,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} main_~count~0#1 := 0bv32; {533#(bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} is VALID [2022-02-20 14:22:27,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} assume 0bv32 == main_~temp~0#1; {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:22:27,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} call write~intINTTYPE4(main_#t~ite8#1[32:0], main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);havoc main_#t~ite8#1;havoc main_#t~mem7#1;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:22:27,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} assume !(0bv64 != ~bvsrem64(main_~index~0#1, 2bv64));call main_#t~mem7#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);main_#t~ite8#1 := ~sign_extendFrom32To64(main_#t~mem7#1); {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:22:27,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} call write~intINTTYPE4(~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1))))[32:0], main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32); {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:22:27,022 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {436#true} {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} #82#return; {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:22:27,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {436#true} assume true; {436#true} is VALID [2022-02-20 14:22:27,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {436#true} assume !(0bv32 == ~cond); {436#true} is VALID [2022-02-20 14:22:27,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#true} ~cond := #in~cond; {436#true} is VALID [2022-02-20 14:22:27,023 INFO L272 TraceCheckUtils]: 12: Hoare triple {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} call assume_abort_if_not((if ~bvsge64(main_~index~0#1, 0bv64) && ~bvslt64(main_~index~0#1, ~ARR_SIZE~0) then 1bv32 else 0bv32)); {436#true} is VALID [2022-02-20 14:22:27,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} assume !false;main_~index~0#1 := ~sign_extendFrom16To64(main_#t~nondet6#1);havoc main_#t~nondet6#1; {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:22:27,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#(or (bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0) (bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:22:27,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#(or (bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0) (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {571#(or (bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0) (bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0))} is VALID [2022-02-20 14:22:27,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {575#(or (bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0) (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call write~intINTTYPE4(0bv32, main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call write~intINTTYPE4(0bv32, main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32); {575#(or (bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0) (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:22:27,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));main_~count~0#1 := 0bv32;main_~num~0#1 := 4294967295bv32;main_~sum~0#1 := 0bv64;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0bv32; {575#(or (bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0) (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:22:27,053 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {588#(or (bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))))} {436#true} #80#return; {537#(bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:22:27,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#(or (bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))))} assume true; {588#(or (bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))))} is VALID [2022-02-20 14:22:27,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {595#(or (bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= assume_abort_if_not_~cond (_ bv0 32)))} assume !(0bv32 == ~cond); {588#(or (bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))))} is VALID [2022-02-20 14:22:27,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {436#true} ~cond := #in~cond; {595#(or (bvslt ((_ sign_extend 32) (_ bv0 32)) ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= assume_abort_if_not_~cond (_ bv0 32)))} is VALID [2022-02-20 14:22:27,055 INFO L272 TraceCheckUtils]: 2: Hoare triple {436#true} call assume_abort_if_not((if ~bvsgt64(~ARR_SIZE~0, 0bv64) then 1bv32 else 0bv32)); {436#true} is VALID [2022-02-20 14:22:27,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~ite8#1, main_#t~mem7#1, main_#t~nondet9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;~ARR_SIZE~0 := ~sign_extendFrom16To64(main_#t~nondet4#1);havoc main_#t~nondet4#1; {436#true} is VALID [2022-02-20 14:22:27,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {436#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ARR_SIZE~0 := 0bv64; {436#true} is VALID [2022-02-20 14:22:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:22:27,055 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:22:27,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598734466] [2022-02-20 14:22:27,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598734466] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:22:27,056 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:22:27,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2022-02-20 14:22:27,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948913376] [2022-02-20 14:22:27,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:22:27,056 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2022-02-20 14:22:27,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:27,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:22:27,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:27,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 14:22:27,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:22:27,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 14:22:27,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-02-20 14:22:27,203 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:22:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:29,472 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-02-20 14:22:29,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 14:22:29,472 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2022-02-20 14:22:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:22:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-02-20 14:22:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:22:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-02-20 14:22:29,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 77 transitions. [2022-02-20 14:22:29,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:29,788 INFO L225 Difference]: With dead ends: 65 [2022-02-20 14:22:29,788 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 14:22:29,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2022-02-20 14:22:29,790 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 58 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:29,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 140 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 61 Unchecked, 0.3s Time] [2022-02-20 14:22:29,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 14:22:29,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-02-20 14:22:29,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:29,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:22:29,796 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:22:29,797 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:22:29,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:29,799 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-02-20 14:22:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-02-20 14:22:29,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:29,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:29,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 61 states. [2022-02-20 14:22:29,801 INFO L87 Difference]: Start difference. First operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 61 states. [2022-02-20 14:22:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:29,803 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-02-20 14:22:29,804 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-02-20 14:22:29,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:29,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:29,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:29,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:22:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-02-20 14:22:29,807 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 26 [2022-02-20 14:22:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:29,807 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-02-20 14:22:29,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:22:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-02-20 14:22:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:22:29,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:29,808 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:29,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 14:22:30,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 14:22:30,017 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:30,018 INFO L85 PathProgramCache]: Analyzing trace with hash -760544265, now seen corresponding path program 1 times [2022-02-20 14:22:30,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:22:30,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893465962] [2022-02-20 14:22:30,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:30,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:22:30,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:22:30,019 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:22:30,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 14:22:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:30,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 14:22:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:30,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:30,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 14:22:30,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:22:30,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-02-20 14:22:30,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-02-20 14:22:31,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-02-20 14:22:33,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:22:33,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2022-02-20 14:22:36,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:22:36,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2022-02-20 14:22:38,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {879#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ARR_SIZE~0 := 0bv64; {879#true} is VALID [2022-02-20 14:22:38,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {879#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~ite8#1, main_#t~mem7#1, main_#t~nondet9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;~ARR_SIZE~0 := ~sign_extendFrom16To64(main_#t~nondet4#1);havoc main_#t~nondet4#1; {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} is VALID [2022-02-20 14:22:38,843 INFO L272 TraceCheckUtils]: 2: Hoare triple {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} call assume_abort_if_not((if ~bvsgt64(~ARR_SIZE~0, 0bv64) then 1bv32 else 0bv32)); {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} is VALID [2022-02-20 14:22:38,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} ~cond := #in~cond; {894#(and (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))))} is VALID [2022-02-20 14:22:38,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {894#(and (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))))} assume !(0bv32 == ~cond); {898#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))))} is VALID [2022-02-20 14:22:38,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {898#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))))} assume true; {898#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))))} is VALID [2022-02-20 14:22:38,846 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {898#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))))} {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} #80#return; {905#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))))} is VALID [2022-02-20 14:22:38,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {905#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))))} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));main_~count~0#1 := 0bv32;main_~num~0#1 := 4294967295bv32;main_~sum~0#1 := 0bv64;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0bv32; {909#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:22:38,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {909#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call write~intINTTYPE4(0bv32, main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call write~intINTTYPE4(0bv32, main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32); {913#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~count~0#1|) |ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:22:38,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~count~0#1|) |ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {917#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (_ bv1 32) |ULTIMATE.start_main_~count~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:22:38,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {917#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (_ bv1 32) |ULTIMATE.start_main_~count~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {921#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:22:38,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {921#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} assume !false;main_~index~0#1 := ~sign_extendFrom16To64(main_#t~nondet6#1);havoc main_#t~nondet6#1; {925#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_5| (_ BitVec 16))) (= |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_5|))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:22:38,855 INFO L272 TraceCheckUtils]: 12: Hoare triple {925#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_5| (_ BitVec 16))) (= |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_5|))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} call assume_abort_if_not((if ~bvsge64(main_~index~0#1, 0bv64) && ~bvslt64(main_~index~0#1, ~ARR_SIZE~0) then 1bv32 else 0bv32)); {929#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:38,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {929#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} ~cond := #in~cond; {933#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:38,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !(0bv32 == ~cond); {937#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:38,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {937#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume true; {937#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:38,864 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {937#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} {925#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_5| (_ BitVec 16))) (= |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_5|))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} #82#return; {944#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:22:38,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {944#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} call write~intINTTYPE4(~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1))))[32:0], main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32); {948#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|)))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:22:38,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {948#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|)))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} assume !(0bv64 != ~bvsrem64(main_~index~0#1, 2bv64));call main_#t~mem7#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);main_#t~ite8#1 := ~sign_extendFrom32To64(main_#t~mem7#1); {952#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|)))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ sign_extend 32) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) |ULTIMATE.start_main_#t~ite8#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:22:38,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {952#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|)))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ sign_extend 32) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) |ULTIMATE.start_main_#t~ite8#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} call write~intINTTYPE4(main_#t~ite8#1[32:0], main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);havoc main_#t~ite8#1;havoc main_#t~mem7#1;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {956#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:22:38,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {956#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} assume 0bv32 == main_~temp~0#1; {956#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:22:38,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {956#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} main_~count~0#1 := 0bv32; {963#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:22:38,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {963#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call main_#t~mem11#1 := read~intINTTYPE4(main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call main_#t~mem12#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);main_~sum~0#1 := ~bvadd64(~bvadd64(main_~sum~0#1, ~sign_extendFrom32To64(main_#t~mem11#1)), ~sign_extendFrom32To64(main_#t~mem12#1));havoc main_#t~mem11#1;havoc main_#t~mem12#1; {967#(and (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~sum~0#1| (bvadd ((_ sign_extend 32) ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))))) ((_ sign_extend 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:39,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#(and (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~sum~0#1| (bvadd ((_ sign_extend 32) ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))))) ((_ sign_extend 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post10#1);havoc main_#t~post10#1; {967#(and (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~sum~0#1| (bvadd ((_ sign_extend 32) ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))))) ((_ sign_extend 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:39,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#(and (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~sum~0#1| (bvadd ((_ sign_extend 32) ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))))) ((_ sign_extend 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {967#(and (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~sum~0#1| (bvadd ((_ sign_extend 32) ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))))) ((_ sign_extend 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:22:39,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {967#(and (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~sum~0#1| (bvadd ((_ sign_extend 32) ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))))) ((_ sign_extend 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle64(~bvmul64(4bv64, main_~sum~0#1), ~bvmul64(~bvsub64(~ARR_SIZE~0, 1bv64), ~bvadd64(1bv64, ~ARR_SIZE~0))) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {977#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} is VALID [2022-02-20 14:22:39,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {977#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond#1; {880#false} is VALID [2022-02-20 14:22:39,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {880#false} assume !false; {880#false} is VALID [2022-02-20 14:22:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:22:39,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:22:59,408 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:22:59,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893465962] [2022-02-20 14:22:59,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893465962] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:22:59,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [382030058] [2022-02-20 14:22:59,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:59,408 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 14:22:59,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 14:22:59,410 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 14:22:59,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-02-20 14:22:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:59,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 14:22:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:59,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:59,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 14:23:00,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:00,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-02-20 14:23:00,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-02-20 14:23:01,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-02-20 14:23:01,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:01,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2022-02-20 14:23:03,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:03,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2022-02-20 14:23:04,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {879#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ARR_SIZE~0 := 0bv64; {879#true} is VALID [2022-02-20 14:23:04,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {879#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~ite8#1, main_#t~mem7#1, main_#t~nondet9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;~ARR_SIZE~0 := ~sign_extendFrom16To64(main_#t~nondet4#1);havoc main_#t~nondet4#1; {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} is VALID [2022-02-20 14:23:04,659 INFO L272 TraceCheckUtils]: 2: Hoare triple {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} call assume_abort_if_not((if ~bvsgt64(~ARR_SIZE~0, 0bv64) then 1bv32 else 0bv32)); {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} is VALID [2022-02-20 14:23:04,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} ~cond := #in~cond; {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} is VALID [2022-02-20 14:23:04,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} assume !(0bv32 == ~cond); {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} is VALID [2022-02-20 14:23:04,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} assume true; {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} is VALID [2022-02-20 14:23:04,661 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} #80#return; {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} is VALID [2022-02-20 14:23:04,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {887#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|)))} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));main_~count~0#1 := 0bv32;main_~num~0#1 := 4294967295bv32;main_~sum~0#1 := 0bv64;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0bv32; {1048#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:23:04,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call write~intINTTYPE4(0bv32, main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call write~intINTTYPE4(0bv32, main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32); {913#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~count~0#1|) |ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:23:04,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~count~0#1|) |ULTIMATE.start_main_~#array2~0#1.offset|)) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {917#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (_ bv1 32) |ULTIMATE.start_main_~count~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:23:04,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {917#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (_ bv1 32) |ULTIMATE.start_main_~count~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_10| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_10|))) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {921#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:23:04,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {921#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} assume !false;main_~index~0#1 := ~sign_extendFrom16To64(main_#t~nondet6#1);havoc main_#t~nondet6#1; {925#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_5| (_ BitVec 16))) (= |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_5|))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:23:04,682 INFO L272 TraceCheckUtils]: 12: Hoare triple {925#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_5| (_ BitVec 16))) (= |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_5|))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} call assume_abort_if_not((if ~bvsge64(main_~index~0#1, 0bv64) && ~bvslt64(main_~index~0#1, ~ARR_SIZE~0) then 1bv32 else 0bv32)); {929#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:04,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {929#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} ~cond := #in~cond; {933#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:04,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !(0bv32 == ~cond); {937#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:04,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {937#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume true; {937#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:04,686 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {937#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} {925#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_5| (_ BitVec 16))) (= |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_5|))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} #82#return; {944#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:23:04,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {944#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} call write~intINTTYPE4(~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1))))[32:0], main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32); {948#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|)))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:23:04,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {948#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|)))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} assume !(0bv64 != ~bvsrem64(main_~index~0#1, 2bv64));call main_#t~mem7#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);main_#t~ite8#1 := ~sign_extendFrom32To64(main_#t~mem7#1); {952#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|)))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ sign_extend 32) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) |ULTIMATE.start_main_#t~ite8#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:23:04,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {952#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32))) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|)))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ sign_extend 32) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) |ULTIMATE.start_main_#t~ite8#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} call write~intINTTYPE4(main_#t~ite8#1[32:0], main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);havoc main_#t~ite8#1;havoc main_#t~mem7#1;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {956#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:23:04,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {956#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} assume 0bv32 == main_~temp~0#1; {956#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:23:04,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {956#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} main_~count~0#1 := 0bv32; {963#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:23:04,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {963#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (bvadd |ULTIMATE.start_main_~#array2~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|)))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (bvadd |ULTIMATE.start_main_~#array1~0#1.offset| (bvmul (_ bv4 32) ((_ extract 31 0) |ULTIMATE.start_main_~index~0#1|))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (= |ULTIMATE.start_main_~#array1~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#array1~0#1.base| |ULTIMATE.start_main_~#array2~0#1.base|)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)) (= (_ bv0 64) |ULTIMATE.start_main_~sum~0#1|))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call main_#t~mem11#1 := read~intINTTYPE4(main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call main_#t~mem12#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);main_~sum~0#1 := ~bvadd64(~bvadd64(main_~sum~0#1, ~sign_extendFrom32To64(main_#t~mem11#1)), ~sign_extendFrom32To64(main_#t~mem12#1));havoc main_#t~mem11#1;havoc main_#t~mem12#1; {967#(and (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~sum~0#1| (bvadd ((_ sign_extend 32) ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))))) ((_ sign_extend 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:04,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#(and (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~sum~0#1| (bvadd ((_ sign_extend 32) ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))))) ((_ sign_extend 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post10#1);havoc main_#t~post10#1; {967#(and (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~sum~0#1| (bvadd ((_ sign_extend 32) ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))))) ((_ sign_extend 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:04,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#(and (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~sum~0#1| (bvadd ((_ sign_extend 32) ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))))) ((_ sign_extend 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {967#(and (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~sum~0#1| (bvadd ((_ sign_extend 32) ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))))) ((_ sign_extend 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:04,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {967#(and (exists ((|ULTIMATE.start_main_~num~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~sum~0#1| (bvadd ((_ sign_extend 32) ((_ extract 31 0) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~index~0#1|)) ((_ sign_extend 32) |ULTIMATE.start_main_~num~0#1|))))) ((_ sign_extend 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle64(~bvmul64(4bv64, main_~sum~0#1), ~bvmul64(~bvsub64(~ARR_SIZE~0, 1bv64), ~bvadd64(1bv64, ~ARR_SIZE~0))) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {977#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} is VALID [2022-02-20 14:23:04,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {977#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond#1; {880#false} is VALID [2022-02-20 14:23:04,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {880#false} assume !false; {880#false} is VALID [2022-02-20 14:23:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:23:04,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:08,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [382030058] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:23:08,970 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:08,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 22 [2022-02-20 14:23:08,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231500780] [2022-02-20 14:23:08,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:08,970 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-02-20 14:23:08,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:08,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:23:09,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:09,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 14:23:09,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:23:09,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 14:23:09,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2022-02-20 14:23:09,344 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:23:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:14,282 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-02-20 14:23:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 14:23:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-02-20 14:23:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:23:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 57 transitions. [2022-02-20 14:23:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:23:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 57 transitions. [2022-02-20 14:23:14,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 57 transitions. [2022-02-20 14:23:14,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:14,993 INFO L225 Difference]: With dead ends: 70 [2022-02-20 14:23:14,993 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 14:23:14,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2022-02-20 14:23:14,994 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:14,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 128 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2022-02-20 14:23:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 14:23:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2022-02-20 14:23:14,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:14,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 63 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:14,999 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 63 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:15,000 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 63 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:15,006 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-02-20 14:23:15,006 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-02-20 14:23:15,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:15,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:15,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 66 states. [2022-02-20 14:23:15,012 INFO L87 Difference]: Start difference. First operand has 63 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 66 states. [2022-02-20 14:23:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:15,017 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-02-20 14:23:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-02-20 14:23:15,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:15,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:15,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:15,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-02-20 14:23:15,019 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 28 [2022-02-20 14:23:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:15,020 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-02-20 14:23:15,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:23:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-02-20 14:23:15,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:23:15,021 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:15,021 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:15,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:23:15,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:23:15,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-02-20 14:23:15,431 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:15,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:15,432 INFO L85 PathProgramCache]: Analyzing trace with hash -367517255, now seen corresponding path program 1 times [2022-02-20 14:23:15,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:23:15,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619214209] [2022-02-20 14:23:15,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:15,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:23:15,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:23:15,433 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:23:15,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 14:23:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:15,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 14:23:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:15,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:16,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {1445#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ARR_SIZE~0 := 0bv64; {1445#true} is VALID [2022-02-20 14:23:16,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {1445#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~ite8#1, main_#t~mem7#1, main_#t~nondet9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;~ARR_SIZE~0 := ~sign_extendFrom16To64(main_#t~nondet4#1);havoc main_#t~nondet4#1; {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} is VALID [2022-02-20 14:23:16,295 INFO L272 TraceCheckUtils]: 2: Hoare triple {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} call assume_abort_if_not((if ~bvsgt64(~ARR_SIZE~0, 0bv64) then 1bv32 else 0bv32)); {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} is VALID [2022-02-20 14:23:16,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} ~cond := #in~cond; {1460#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))} is VALID [2022-02-20 14:23:16,297 INFO L290 TraceCheckUtils]: 4: Hoare triple {1460#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))} assume !(0bv32 == ~cond); {1464#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))))} is VALID [2022-02-20 14:23:16,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {1464#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))))} assume true; {1464#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))))} is VALID [2022-02-20 14:23:16,298 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1464#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))))} {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} #80#return; {1471#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))))} is VALID [2022-02-20 14:23:16,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))))} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));main_~count~0#1 := 0bv32;main_~num~0#1 := 4294967295bv32;main_~sum~0#1 := 0bv64;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0bv32; {1475#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:23:16,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {1475#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call write~intINTTYPE4(0bv32, main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call write~intINTTYPE4(0bv32, main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32); {1475#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:23:16,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {1475#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {1482#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~count~0#1|) (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))))} is VALID [2022-02-20 14:23:16,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {1482#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~count~0#1|) (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {1486#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:16,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {1486#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !false;main_~index~0#1 := ~sign_extendFrom16To64(main_#t~nondet6#1);havoc main_#t~nondet6#1; {1486#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:16,303 INFO L272 TraceCheckUtils]: 12: Hoare triple {1486#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} call assume_abort_if_not((if ~bvsge64(main_~index~0#1, 0bv64) && ~bvslt64(main_~index~0#1, ~ARR_SIZE~0) then 1bv32 else 0bv32)); {1486#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:16,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {1486#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} ~cond := #in~cond; {1496#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:16,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {1496#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !(0bv32 == ~cond); {1500#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:16,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {1500#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume true; {1500#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:16,307 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1500#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} {1486#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} #82#return; {1507#(and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (bvslt |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 32) (_ bv1 32))))} is VALID [2022-02-20 14:23:16,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {1507#(and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (bvslt |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 32) (_ bv1 32))))} call write~intINTTYPE4(~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1))))[32:0], main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32); {1507#(and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (bvslt |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 32) (_ bv1 32))))} is VALID [2022-02-20 14:23:16,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {1507#(and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (bvslt |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 32) (_ bv1 32))))} assume 0bv64 != ~bvsrem64(main_~index~0#1, 2bv64);main_#t~ite8#1 := ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1); {1446#false} is VALID [2022-02-20 14:23:16,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {1446#false} call write~intINTTYPE4(main_#t~ite8#1[32:0], main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);havoc main_#t~ite8#1;havoc main_#t~mem7#1;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1446#false} is VALID [2022-02-20 14:23:16,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {1446#false} assume 0bv32 == main_~temp~0#1; {1446#false} is VALID [2022-02-20 14:23:16,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {1446#false} main_~count~0#1 := 0bv32; {1446#false} is VALID [2022-02-20 14:23:16,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {1446#false} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call main_#t~mem11#1 := read~intINTTYPE4(main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call main_#t~mem12#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);main_~sum~0#1 := ~bvadd64(~bvadd64(main_~sum~0#1, ~sign_extendFrom32To64(main_#t~mem11#1)), ~sign_extendFrom32To64(main_#t~mem12#1));havoc main_#t~mem11#1;havoc main_#t~mem12#1; {1446#false} is VALID [2022-02-20 14:23:16,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {1446#false} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post10#1);havoc main_#t~post10#1; {1446#false} is VALID [2022-02-20 14:23:16,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {1446#false} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {1446#false} is VALID [2022-02-20 14:23:16,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {1446#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle64(~bvmul64(4bv64, main_~sum~0#1), ~bvmul64(~bvsub64(~ARR_SIZE~0, 1bv64), ~bvadd64(1bv64, ~ARR_SIZE~0))) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1446#false} is VALID [2022-02-20 14:23:16,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {1446#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {1446#false} is VALID [2022-02-20 14:23:16,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {1446#false} assume !false; {1446#false} is VALID [2022-02-20 14:23:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:23:16,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:16,551 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:23:16,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619214209] [2022-02-20 14:23:16,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619214209] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:23:16,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [294058798] [2022-02-20 14:23:16,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:16,551 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 14:23:16,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 14:23:16,552 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 14:23:16,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-02-20 14:23:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:16,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:23:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:16,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:17,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {1445#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ARR_SIZE~0 := 0bv64; {1445#true} is VALID [2022-02-20 14:23:17,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {1445#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~ite8#1, main_#t~mem7#1, main_#t~nondet9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;~ARR_SIZE~0 := ~sign_extendFrom16To64(main_#t~nondet4#1);havoc main_#t~nondet4#1; {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} is VALID [2022-02-20 14:23:17,404 INFO L272 TraceCheckUtils]: 2: Hoare triple {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} call assume_abort_if_not((if ~bvsgt64(~ARR_SIZE~0, 0bv64) then 1bv32 else 0bv32)); {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} is VALID [2022-02-20 14:23:17,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} ~cond := #in~cond; {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} is VALID [2022-02-20 14:23:17,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} assume !(0bv32 == ~cond); {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} is VALID [2022-02-20 14:23:17,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} assume true; {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} is VALID [2022-02-20 14:23:17,406 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} #80#return; {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} is VALID [2022-02-20 14:23:17,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {1453#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|)))} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));main_~count~0#1 := 0bv32;main_~num~0#1 := 4294967295bv32;main_~sum~0#1 := 0bv64;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0bv32; {1600#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:23:17,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {1600#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call write~intINTTYPE4(0bv32, main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call write~intINTTYPE4(0bv32, main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32); {1475#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:23:17,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {1475#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {1482#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~count~0#1|) (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))))} is VALID [2022-02-20 14:23:17,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {1482#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~count~0#1|) (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_14| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_14|))))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {1486#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:17,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {1486#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !false;main_~index~0#1 := ~sign_extendFrom16To64(main_#t~nondet6#1);havoc main_#t~nondet6#1; {1613#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_7| (_ BitVec 16))) (= |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_7|))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:17,418 INFO L272 TraceCheckUtils]: 12: Hoare triple {1613#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_7| (_ BitVec 16))) (= |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_7|))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} call assume_abort_if_not((if ~bvsge64(main_~index~0#1, 0bv64) && ~bvslt64(main_~index~0#1, ~ARR_SIZE~0) then 1bv32 else 0bv32)); {1486#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:17,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {1486#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} ~cond := #in~cond; {1496#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:17,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {1496#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !(0bv32 == ~cond); {1500#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:17,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {1500#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume true; {1500#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:17,422 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1500#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} {1613#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet6#1_7| (_ BitVec 16))) (= |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet6#1_7|))) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} #82#return; {1507#(and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (bvslt |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 32) (_ bv1 32))))} is VALID [2022-02-20 14:23:17,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {1507#(and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (bvslt |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 32) (_ bv1 32))))} call write~intINTTYPE4(~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1))))[32:0], main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32); {1507#(and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (bvslt |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 32) (_ bv1 32))))} is VALID [2022-02-20 14:23:17,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {1507#(and (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)) (bvslt |ULTIMATE.start_main_~index~0#1| ((_ sign_extend 32) (_ bv1 32))))} assume 0bv64 != ~bvsrem64(main_~index~0#1, 2bv64);main_#t~ite8#1 := ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1); {1446#false} is VALID [2022-02-20 14:23:17,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {1446#false} call write~intINTTYPE4(main_#t~ite8#1[32:0], main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);havoc main_#t~ite8#1;havoc main_#t~mem7#1;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1446#false} is VALID [2022-02-20 14:23:17,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {1446#false} assume 0bv32 == main_~temp~0#1; {1446#false} is VALID [2022-02-20 14:23:17,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {1446#false} main_~count~0#1 := 0bv32; {1446#false} is VALID [2022-02-20 14:23:17,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {1446#false} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call main_#t~mem11#1 := read~intINTTYPE4(main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call main_#t~mem12#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);main_~sum~0#1 := ~bvadd64(~bvadd64(main_~sum~0#1, ~sign_extendFrom32To64(main_#t~mem11#1)), ~sign_extendFrom32To64(main_#t~mem12#1));havoc main_#t~mem11#1;havoc main_#t~mem12#1; {1446#false} is VALID [2022-02-20 14:23:17,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {1446#false} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post10#1);havoc main_#t~post10#1; {1446#false} is VALID [2022-02-20 14:23:17,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {1446#false} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {1446#false} is VALID [2022-02-20 14:23:17,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {1446#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle64(~bvmul64(4bv64, main_~sum~0#1), ~bvmul64(~bvsub64(~ARR_SIZE~0, 1bv64), ~bvadd64(1bv64, ~ARR_SIZE~0))) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1446#false} is VALID [2022-02-20 14:23:17,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {1446#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {1446#false} is VALID [2022-02-20 14:23:17,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {1446#false} assume !false; {1446#false} is VALID [2022-02-20 14:23:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:23:17,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:18,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {1446#false} assume !false; {1446#false} is VALID [2022-02-20 14:23:18,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {1446#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {1446#false} is VALID [2022-02-20 14:23:18,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {1446#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle64(~bvmul64(4bv64, main_~sum~0#1), ~bvmul64(~bvsub64(~ARR_SIZE~0, 1bv64), ~bvadd64(1bv64, ~ARR_SIZE~0))) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1446#false} is VALID [2022-02-20 14:23:18,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {1446#false} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {1446#false} is VALID [2022-02-20 14:23:18,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {1446#false} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post10#1);havoc main_#t~post10#1; {1446#false} is VALID [2022-02-20 14:23:18,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {1446#false} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call main_#t~mem11#1 := read~intINTTYPE4(main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call main_#t~mem12#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);main_~sum~0#1 := ~bvadd64(~bvadd64(main_~sum~0#1, ~sign_extendFrom32To64(main_#t~mem11#1)), ~sign_extendFrom32To64(main_#t~mem12#1));havoc main_#t~mem11#1;havoc main_#t~mem12#1; {1446#false} is VALID [2022-02-20 14:23:18,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {1446#false} main_~count~0#1 := 0bv32; {1446#false} is VALID [2022-02-20 14:23:18,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {1446#false} assume 0bv32 == main_~temp~0#1; {1446#false} is VALID [2022-02-20 14:23:18,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {1446#false} call write~intINTTYPE4(main_#t~ite8#1[32:0], main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);havoc main_#t~ite8#1;havoc main_#t~mem7#1;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1446#false} is VALID [2022-02-20 14:23:18,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {1568#(= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64)))} assume 0bv64 != ~bvsrem64(main_~index~0#1, 2bv64);main_#t~ite8#1 := ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1); {1446#false} is VALID [2022-02-20 14:23:18,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {1568#(= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64)))} call write~intINTTYPE4(~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1))))[32:0], main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32); {1568#(= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64)))} is VALID [2022-02-20 14:23:18,342 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1699#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {1695#(or (= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64))) (not (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0)) (not (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64))))} #82#return; {1568#(= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64)))} is VALID [2022-02-20 14:23:18,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {1699#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {1699#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:23:18,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {1706#(or (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= assume_abort_if_not_~cond (_ bv0 32)))} assume !(0bv32 == ~cond); {1699#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 14:23:18,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {1445#true} ~cond := #in~cond; {1706#(or (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= assume_abort_if_not_~cond (_ bv0 32)))} is VALID [2022-02-20 14:23:18,345 INFO L272 TraceCheckUtils]: 12: Hoare triple {1695#(or (= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64))) (not (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0)) (not (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64))))} call assume_abort_if_not((if ~bvsge64(main_~index~0#1, 0bv64) && ~bvslt64(main_~index~0#1, ~ARR_SIZE~0) then 1bv32 else 0bv32)); {1445#true} is VALID [2022-02-20 14:23:18,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {1575#(forall ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (or (= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64))) (not (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0)) (not (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)))))} assume !false;main_~index~0#1 := ~sign_extendFrom16To64(main_#t~nondet6#1);havoc main_#t~nondet6#1; {1695#(or (= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64))) (not (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0)) (not (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64))))} is VALID [2022-02-20 14:23:18,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {1716#(or (bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0) (forall ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (or (= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64))) (not (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0)) (not (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64))))))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {1575#(forall ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (or (= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64))) (not (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0)) (not (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64)))))} is VALID [2022-02-20 14:23:18,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {1720#(or (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (forall ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (or (= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64))) (not (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0)) (not (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64))))))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {1716#(or (bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0) (forall ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (or (= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64))) (not (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0)) (not (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64))))))} is VALID [2022-02-20 14:23:18,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {1724#(or (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (forall ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (or (= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64))) (not (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0)) (not (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64))))) (not (bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call write~intINTTYPE4(0bv32, main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call write~intINTTYPE4(0bv32, main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32); {1720#(or (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (forall ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (or (= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64))) (not (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0)) (not (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64))))))} is VALID [2022-02-20 14:23:18,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {1445#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));main_~count~0#1 := 0bv32;main_~num~0#1 := 4294967295bv32;main_~sum~0#1 := 0bv64;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0bv32; {1724#(or (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (forall ((|ULTIMATE.start_main_~index~0#1| (_ BitVec 64))) (or (= (_ bv0 64) (bvsrem |ULTIMATE.start_main_~index~0#1| (_ bv2 64))) (not (bvslt |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0)) (not (bvsge |ULTIMATE.start_main_~index~0#1| (_ bv0 64))))) (not (bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:18,373 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1445#true} {1445#true} #80#return; {1445#true} is VALID [2022-02-20 14:23:18,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {1445#true} assume true; {1445#true} is VALID [2022-02-20 14:23:18,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {1445#true} assume !(0bv32 == ~cond); {1445#true} is VALID [2022-02-20 14:23:18,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {1445#true} ~cond := #in~cond; {1445#true} is VALID [2022-02-20 14:23:18,373 INFO L272 TraceCheckUtils]: 2: Hoare triple {1445#true} call assume_abort_if_not((if ~bvsgt64(~ARR_SIZE~0, 0bv64) then 1bv32 else 0bv32)); {1445#true} is VALID [2022-02-20 14:23:18,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {1445#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~ite8#1, main_#t~mem7#1, main_#t~nondet9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;~ARR_SIZE~0 := ~sign_extendFrom16To64(main_#t~nondet4#1);havoc main_#t~nondet4#1; {1445#true} is VALID [2022-02-20 14:23:18,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {1445#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ARR_SIZE~0 := 0bv64; {1445#true} is VALID [2022-02-20 14:23:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:23:18,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [294058798] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:18,374 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:23:18,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 22 [2022-02-20 14:23:18,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705974466] [2022-02-20 14:23:18,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:18,374 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 28 [2022-02-20 14:23:18,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:18,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 14:23:18,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:18,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 14:23:18,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:23:18,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 14:23:18,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2022-02-20 14:23:18,597 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 22 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 14:23:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:20,419 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2022-02-20 14:23:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 14:23:20,419 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 28 [2022-02-20 14:23:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 14:23:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2022-02-20 14:23:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 14:23:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2022-02-20 14:23:20,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 63 transitions. [2022-02-20 14:23:20,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:20,713 INFO L225 Difference]: With dead ends: 93 [2022-02-20 14:23:20,713 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 14:23:20,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2022-02-20 14:23:20,714 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:20,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 136 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 48 Unchecked, 0.1s Time] [2022-02-20 14:23:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 14:23:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2022-02-20 14:23:20,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:20,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 71 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:23:20,727 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 71 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:23:20,727 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 71 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:23:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:20,729 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2022-02-20 14:23:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2022-02-20 14:23:20,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:20,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:20,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 75 states. [2022-02-20 14:23:20,730 INFO L87 Difference]: Start difference. First operand has 71 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 75 states. [2022-02-20 14:23:20,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:20,732 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2022-02-20 14:23:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2022-02-20 14:23:20,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:20,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:20,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:20,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:23:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2022-02-20 14:23:20,738 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 28 [2022-02-20 14:23:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:20,738 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2022-02-20 14:23:20,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 14:23:20,739 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-02-20 14:23:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:23:20,739 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:20,739 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:20,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-02-20 14:23:20,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 14:23:21,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 14:23:21,144 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:21,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash -685364711, now seen corresponding path program 2 times [2022-02-20 14:23:21,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:23:21,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140014005] [2022-02-20 14:23:21,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:23:21,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:23:21,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:23:21,146 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:23:21,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 14:23:21,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:23:21,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:21,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:23:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:21,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:21,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {2102#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ARR_SIZE~0 := 0bv64; {2102#true} is VALID [2022-02-20 14:23:21,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~ite8#1, main_#t~mem7#1, main_#t~nondet9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;~ARR_SIZE~0 := ~sign_extendFrom16To64(main_#t~nondet4#1);havoc main_#t~nondet4#1; {2110#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|)))} is VALID [2022-02-20 14:23:21,930 INFO L272 TraceCheckUtils]: 2: Hoare triple {2110#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|)))} call assume_abort_if_not((if ~bvsgt64(~ARR_SIZE~0, 0bv64) then 1bv32 else 0bv32)); {2110#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|)))} is VALID [2022-02-20 14:23:21,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {2110#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|)))} ~cond := #in~cond; {2117#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))} is VALID [2022-02-20 14:23:21,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {2117#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))} assume !(0bv32 == ~cond); {2121#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))))} is VALID [2022-02-20 14:23:21,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {2121#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))))} assume true; {2121#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))))} is VALID [2022-02-20 14:23:21,933 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2121#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))) (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))))} {2110#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|)))} #80#return; {2128#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))))} is VALID [2022-02-20 14:23:21,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {2128#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))))} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));main_~count~0#1 := 0bv32;main_~num~0#1 := 4294967295bv32;main_~sum~0#1 := 0bv64;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0bv32; {2132#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:23:21,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {2132#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call write~intINTTYPE4(0bv32, main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call write~intINTTYPE4(0bv32, main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32); {2132#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:23:21,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {2132#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {2139#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))) (= (_ bv1 32) |ULTIMATE.start_main_~count~0#1|))} is VALID [2022-02-20 14:23:21,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {2139#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_18| (_ BitVec 16))) (= ~ARR_SIZE~0 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_18|))) (= (_ bv1 32) |ULTIMATE.start_main_~count~0#1|))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !false;main_~index~0#1 := ~sign_extendFrom16To64(main_#t~nondet6#1);havoc main_#t~nondet6#1; {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,938 INFO L272 TraceCheckUtils]: 12: Hoare triple {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} call assume_abort_if_not((if ~bvsge64(main_~index~0#1, 0bv64) && ~bvslt64(main_~index~0#1, ~ARR_SIZE~0) then 1bv32 else 0bv32)); {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} ~cond := #in~cond; {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !(0bv32 == ~cond); {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume true; {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,940 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} #82#return; {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} call write~intINTTYPE4(~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1))))[32:0], main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32); {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !(0bv64 != ~bvsrem64(main_~index~0#1, 2bv64));call main_#t~mem7#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);main_#t~ite8#1 := ~sign_extendFrom32To64(main_#t~mem7#1); {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} call write~intINTTYPE4(main_#t~ite8#1[32:0], main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);havoc main_#t~ite8#1;havoc main_#t~mem7#1;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume 0bv32 == main_~temp~0#1; {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {2143#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} main_~count~0#1 := 0bv32; {2177#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {2177#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call main_#t~mem11#1 := read~intINTTYPE4(main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call main_#t~mem12#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);main_~sum~0#1 := ~bvadd64(~bvadd64(main_~sum~0#1, ~sign_extendFrom32To64(main_#t~mem11#1)), ~sign_extendFrom32To64(main_#t~mem12#1));havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2177#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {2177#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post10#1);havoc main_#t~post10#1; {2184#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (_ bv1 32) |ULTIMATE.start_main_~count~0#1|) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:21,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {2184#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (_ bv1 32) |ULTIMATE.start_main_~count~0#1|) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call main_#t~mem11#1 := read~intINTTYPE4(main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call main_#t~mem12#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);main_~sum~0#1 := ~bvadd64(~bvadd64(main_~sum~0#1, ~sign_extendFrom32To64(main_#t~mem11#1)), ~sign_extendFrom32To64(main_#t~mem12#1));havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2103#false} is VALID [2022-02-20 14:23:21,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {2103#false} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post10#1);havoc main_#t~post10#1; {2103#false} is VALID [2022-02-20 14:23:21,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {2103#false} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {2103#false} is VALID [2022-02-20 14:23:21,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {2103#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle64(~bvmul64(4bv64, main_~sum~0#1), ~bvmul64(~bvsub64(~ARR_SIZE~0, 1bv64), ~bvadd64(1bv64, ~ARR_SIZE~0))) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2103#false} is VALID [2022-02-20 14:23:21,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {2103#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {2103#false} is VALID [2022-02-20 14:23:21,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {2103#false} assume !false; {2103#false} is VALID [2022-02-20 14:23:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:23:21,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:22,627 INFO L290 TraceCheckUtils]: 29: Hoare triple {2103#false} assume !false; {2103#false} is VALID [2022-02-20 14:23:22,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {2103#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {2103#false} is VALID [2022-02-20 14:23:22,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {2103#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle64(~bvmul64(4bv64, main_~sum~0#1), ~bvmul64(~bvsub64(~ARR_SIZE~0, 1bv64), ~bvadd64(1bv64, ~ARR_SIZE~0))) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2103#false} is VALID [2022-02-20 14:23:22,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {2212#(bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {2103#false} is VALID [2022-02-20 14:23:22,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {2216#(bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post10#1);havoc main_#t~post10#1; {2212#(bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:22,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {2220#(or (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call main_#t~mem11#1 := read~intINTTYPE4(main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call main_#t~mem12#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);main_~sum~0#1 := ~bvadd64(~bvadd64(main_~sum~0#1, ~sign_extendFrom32To64(main_#t~mem11#1)), ~sign_extendFrom32To64(main_#t~mem12#1));havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2216#(bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:22,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {2224#(or (bvslt ((_ sign_extend 32) (bvadd (_ bv2 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post10#1);havoc main_#t~post10#1; {2220#(or (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:22,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {2224#(or (bvslt ((_ sign_extend 32) (bvadd (_ bv2 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call main_#t~mem11#1 := read~intINTTYPE4(main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call main_#t~mem12#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);main_~sum~0#1 := ~bvadd64(~bvadd64(main_~sum~0#1, ~sign_extendFrom32To64(main_#t~mem11#1)), ~sign_extendFrom32To64(main_#t~mem12#1));havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2224#(or (bvslt ((_ sign_extend 32) (bvadd (_ bv2 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:22,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} main_~count~0#1 := 0bv32; {2224#(or (bvslt ((_ sign_extend 32) (bvadd (_ bv2 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:22,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume 0bv32 == main_~temp~0#1; {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:22,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} call write~intINTTYPE4(main_#t~ite8#1[32:0], main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);havoc main_#t~ite8#1;havoc main_#t~mem7#1;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:22,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !(0bv64 != ~bvsrem64(main_~index~0#1, 2bv64));call main_#t~mem7#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);main_#t~ite8#1 := ~sign_extendFrom32To64(main_#t~mem7#1); {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:22,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} call write~intINTTYPE4(~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1))))[32:0], main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32); {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:22,705 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2102#true} {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} #82#return; {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:22,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {2102#true} assume true; {2102#true} is VALID [2022-02-20 14:23:22,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {2102#true} assume !(0bv32 == ~cond); {2102#true} is VALID [2022-02-20 14:23:22,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {2102#true} ~cond := #in~cond; {2102#true} is VALID [2022-02-20 14:23:22,706 INFO L272 TraceCheckUtils]: 12: Hoare triple {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} call assume_abort_if_not((if ~bvsge64(main_~index~0#1, 0bv64) && ~bvslt64(main_~index~0#1, ~ARR_SIZE~0) then 1bv32 else 0bv32)); {2102#true} is VALID [2022-02-20 14:23:22,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !false;main_~index~0#1 := ~sign_extendFrom16To64(main_#t~nondet6#1);havoc main_#t~nondet6#1; {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:22,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {2265#(or (bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0) (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {2231#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:22,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {2269#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {2265#(or (bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0) (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:22,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {2269#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call write~intINTTYPE4(0bv32, main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call write~intINTTYPE4(0bv32, main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32); {2269#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:22,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {2102#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));main_~count~0#1 := 0bv32;main_~num~0#1 := 4294967295bv32;main_~sum~0#1 := 0bv64;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0bv32; {2269#(or (bvslt ((_ sign_extend 32) (_ bv2 32)) ~ARR_SIZE~0) (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:22,711 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2102#true} {2102#true} #80#return; {2102#true} is VALID [2022-02-20 14:23:22,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#true} assume true; {2102#true} is VALID [2022-02-20 14:23:22,711 INFO L290 TraceCheckUtils]: 4: Hoare triple {2102#true} assume !(0bv32 == ~cond); {2102#true} is VALID [2022-02-20 14:23:22,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {2102#true} ~cond := #in~cond; {2102#true} is VALID [2022-02-20 14:23:22,711 INFO L272 TraceCheckUtils]: 2: Hoare triple {2102#true} call assume_abort_if_not((if ~bvsgt64(~ARR_SIZE~0, 0bv64) then 1bv32 else 0bv32)); {2102#true} is VALID [2022-02-20 14:23:22,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~ite8#1, main_#t~mem7#1, main_#t~nondet9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;~ARR_SIZE~0 := ~sign_extendFrom16To64(main_#t~nondet4#1);havoc main_#t~nondet4#1; {2102#true} is VALID [2022-02-20 14:23:22,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {2102#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ARR_SIZE~0 := 0bv64; {2102#true} is VALID [2022-02-20 14:23:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:23:22,712 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:23:22,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140014005] [2022-02-20 14:23:22,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140014005] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:22,712 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:22,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2022-02-20 14:23:22,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571905378] [2022-02-20 14:23:22,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:22,713 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2022-02-20 14:23:22,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:22,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:23:22,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:22,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 14:23:22,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:23:22,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 14:23:22,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-02-20 14:23:22,956 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:23:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:27,424 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2022-02-20 14:23:27,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 14:23:27,424 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2022-02-20 14:23:27,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:23:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-02-20 14:23:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:23:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-02-20 14:23:27,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 65 transitions. [2022-02-20 14:23:27,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:27,808 INFO L225 Difference]: With dead ends: 91 [2022-02-20 14:23:27,808 INFO L226 Difference]: Without dead ends: 81 [2022-02-20 14:23:27,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2022-02-20 14:23:27,809 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 80 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:27,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 168 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 49 Unchecked, 0.6s Time] [2022-02-20 14:23:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-20 14:23:27,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2022-02-20 14:23:27,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:27,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 72 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:23:27,821 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 72 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:23:27,821 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 72 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:23:27,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:27,824 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-02-20 14:23:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-02-20 14:23:27,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:27,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:27,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 81 states. [2022-02-20 14:23:27,825 INFO L87 Difference]: Start difference. First operand has 72 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 81 states. [2022-02-20 14:23:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:27,827 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-02-20 14:23:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-02-20 14:23:27,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:27,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:27,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:27,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:23:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-02-20 14:23:27,829 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 30 [2022-02-20 14:23:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:27,829 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-02-20 14:23:27,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 17 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:23:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-02-20 14:23:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:23:27,830 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:27,830 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:27,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 14:23:28,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 14:23:28,041 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:28,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1406627783, now seen corresponding path program 3 times [2022-02-20 14:23:28,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:23:28,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507238419] [2022-02-20 14:23:28,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:23:28,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:23:28,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:23:28,044 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:23:28,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 14:23:28,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 14:23:28,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:28,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 14:23:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:28,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:29,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {2672#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ARR_SIZE~0 := 0bv64; {2672#true} is VALID [2022-02-20 14:23:29,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~ite8#1, main_#t~mem7#1, main_#t~nondet9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;~ARR_SIZE~0 := ~sign_extendFrom16To64(main_#t~nondet4#1);havoc main_#t~nondet4#1; {2680#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,384 INFO L272 TraceCheckUtils]: 2: Hoare triple {2680#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0))} call assume_abort_if_not((if ~bvsgt64(~ARR_SIZE~0, 0bv64) then 1bv32 else 0bv32)); {2680#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {2680#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0))} ~cond := #in~cond; {2687#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))} is VALID [2022-02-20 14:23:29,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {2687#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))} assume !(0bv32 == ~cond); {2691#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:29,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {2691#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)))} assume true; {2691#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:29,387 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2691#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)))} {2680#(exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0))} #80#return; {2698#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:29,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {2698#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)))} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));main_~count~0#1 := 0bv32;main_~num~0#1 := 4294967295bv32;main_~sum~0#1 := 0bv64;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0bv32; {2702#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:23:29,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {2702#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call write~intINTTYPE4(0bv32, main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call write~intINTTYPE4(0bv32, main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32); {2702#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:23:29,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {2702#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {2709#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~count~0#1|) (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:29,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {2709#(and (bvsgt ~ARR_SIZE~0 (_ bv0 64)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~count~0#1|) (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call write~intINTTYPE4(0bv32, main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call write~intINTTYPE4(0bv32, main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32); {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} assume !false;main_~index~0#1 := ~sign_extendFrom16To64(main_#t~nondet6#1);havoc main_#t~nondet6#1; {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,393 INFO L272 TraceCheckUtils]: 14: Hoare triple {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} call assume_abort_if_not((if ~bvsge64(main_~index~0#1, 0bv64) && ~bvslt64(main_~index~0#1, ~ARR_SIZE~0) then 1bv32 else 0bv32)); {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} ~cond := #in~cond; {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} assume !(0bv32 == ~cond); {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} assume true; {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,395 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} #82#return; {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} call write~intINTTYPE4(~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1))))[32:0], main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32); {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} assume !(0bv64 != ~bvsrem64(main_~index~0#1, 2bv64));call main_#t~mem7#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);main_#t~ite8#1 := ~sign_extendFrom32To64(main_#t~mem7#1); {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} call write~intINTTYPE4(main_#t~ite8#1[32:0], main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);havoc main_#t~ite8#1;havoc main_#t~mem7#1;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} assume 0bv32 == main_~temp~0#1; {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {2713#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} main_~count~0#1 := 0bv32; {2753#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:23:29,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {2753#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call main_#t~mem11#1 := read~intINTTYPE4(main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call main_#t~mem12#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);main_~sum~0#1 := ~bvadd64(~bvadd64(main_~sum~0#1, ~sign_extendFrom32To64(main_#t~mem11#1)), ~sign_extendFrom32To64(main_#t~mem12#1));havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2753#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} is VALID [2022-02-20 14:23:29,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {2753#(and (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0) (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32)))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post10#1);havoc main_#t~post10#1; {2760#(and (= (_ bv1 32) |ULTIMATE.start_main_~count~0#1|) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {2760#(and (= (_ bv1 32) |ULTIMATE.start_main_~count~0#1|) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_20| (_ BitVec 16))) (= ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_20|) ~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0))} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {2673#false} is VALID [2022-02-20 14:23:29,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {2673#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle64(~bvmul64(4bv64, main_~sum~0#1), ~bvmul64(~bvsub64(~ARR_SIZE~0, 1bv64), ~bvadd64(1bv64, ~ARR_SIZE~0))) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2673#false} is VALID [2022-02-20 14:23:29,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {2673#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {2673#false} is VALID [2022-02-20 14:23:29,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-02-20 14:23:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:23:29,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:29,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-02-20 14:23:29,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {2673#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {2673#false} is VALID [2022-02-20 14:23:29,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {2673#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle64(~bvmul64(4bv64, main_~sum~0#1), ~bvmul64(~bvsub64(~ARR_SIZE~0, 1bv64), ~bvadd64(1bv64, ~ARR_SIZE~0))) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2673#false} is VALID [2022-02-20 14:23:29,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {2782#(bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {2673#false} is VALID [2022-02-20 14:23:29,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {2786#(bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post10#1);havoc main_#t~post10#1; {2782#(bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:29,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {2786#(bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call main_#t~mem11#1 := read~intINTTYPE4(main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call main_#t~mem12#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);main_~sum~0#1 := ~bvadd64(~bvadd64(main_~sum~0#1, ~sign_extendFrom32To64(main_#t~mem11#1)), ~sign_extendFrom32To64(main_#t~mem12#1));havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2786#(bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:29,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} main_~count~0#1 := 0bv32; {2786#(bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:29,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} assume 0bv32 == main_~temp~0#1; {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:29,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} call write~intINTTYPE4(main_#t~ite8#1[32:0], main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);havoc main_#t~ite8#1;havoc main_#t~mem7#1;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:29,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} assume !(0bv64 != ~bvsrem64(main_~index~0#1, 2bv64));call main_#t~mem7#1 := read~intINTTYPE4(main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32);main_#t~ite8#1 := ~sign_extendFrom32To64(main_#t~mem7#1); {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:29,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} call write~intINTTYPE4(~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), ~bvmul64(~sign_extendFrom32To64(main_~num~0#1), main_~index~0#1))))[32:0], main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~index~0#1[32:0])), 4bv32); {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:29,885 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2672#true} {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} #82#return; {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:29,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-02-20 14:23:29,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {2672#true} assume !(0bv32 == ~cond); {2672#true} is VALID [2022-02-20 14:23:29,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-02-20 14:23:29,885 INFO L272 TraceCheckUtils]: 14: Hoare triple {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} call assume_abort_if_not((if ~bvsge64(main_~index~0#1, 0bv64) && ~bvslt64(main_~index~0#1, ~ARR_SIZE~0) then 1bv32 else 0bv32)); {2672#true} is VALID [2022-02-20 14:23:29,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} assume !false;main_~index~0#1 := ~sign_extendFrom16To64(main_#t~nondet6#1);havoc main_#t~nondet6#1; {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:29,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} assume !~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0); {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:29,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:29,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {2833#(or (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call write~intINTTYPE4(0bv32, main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call write~intINTTYPE4(0bv32, main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32); {2793#(bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:29,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {2837#(or (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {2833#(or (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:29,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {2837#(or (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)))} assume !!~bvslt64(~sign_extendFrom32To64(main_~count~0#1), ~ARR_SIZE~0);call write~intINTTYPE4(0bv32, main_~#array1~0#1.base, ~bvadd32(main_~#array1~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32);call write~intINTTYPE4(0bv32, main_~#array2~0#1.base, ~bvadd32(main_~#array2~0#1.offset, ~bvmul32(4bv32, main_~count~0#1)), 4bv32); {2837#(or (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:29,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {2672#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, ~ARR_SIZE~0[32:0]));main_~count~0#1 := 0bv32;main_~num~0#1 := 4294967295bv32;main_~sum~0#1 := 0bv64;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0bv32; {2837#(or (bvslt ((_ sign_extend 32) (_ bv1 32)) ~ARR_SIZE~0) (not (bvslt ((_ sign_extend 32) (bvadd (_ bv1 32) |ULTIMATE.start_main_~count~0#1|)) ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:29,924 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2672#true} {2672#true} #80#return; {2672#true} is VALID [2022-02-20 14:23:29,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-02-20 14:23:29,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {2672#true} assume !(0bv32 == ~cond); {2672#true} is VALID [2022-02-20 14:23:29,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-02-20 14:23:29,924 INFO L272 TraceCheckUtils]: 2: Hoare triple {2672#true} call assume_abort_if_not((if ~bvsgt64(~ARR_SIZE~0, 0bv64) then 1bv32 else 0bv32)); {2672#true} is VALID [2022-02-20 14:23:29,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~ite8#1, main_#t~mem7#1, main_#t~nondet9#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;~ARR_SIZE~0 := ~sign_extendFrom16To64(main_#t~nondet4#1);havoc main_#t~nondet4#1; {2672#true} is VALID [2022-02-20 14:23:29,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {2672#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(18bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ARR_SIZE~0 := 0bv64; {2672#true} is VALID [2022-02-20 14:23:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:23:29,925 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:23:29,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507238419] [2022-02-20 14:23:29,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507238419] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:29,925 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:29,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2022-02-20 14:23:29,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225393770] [2022-02-20 14:23:29,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:29,925 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2022-02-20 14:23:29,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:29,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:23:30,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:30,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 14:23:30,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:23:30,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 14:23:30,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-02-20 14:23:30,127 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:23:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:33,724 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2022-02-20 14:23:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 14:23:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2022-02-20 14:23:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:23:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 75 transitions. [2022-02-20 14:23:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:23:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 75 transitions. [2022-02-20 14:23:33,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 75 transitions.