./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array8_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/array8_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 06625eaf591a62e295090a882d83c1e11aaafca7ac8895e7d4adcf51d5b26e02 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:24:55,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:24:55,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:24:55,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:24:55,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:24:55,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:24:55,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:24:55,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:24:55,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:24:55,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:24:55,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:24:55,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:24:55,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:24:55,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:24:55,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:24:55,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:24:55,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:24:55,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:24:55,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:24:55,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:24:55,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:24:55,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:24:55,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:24:55,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:24:55,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:24:55,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:24:55,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:24:55,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:24:55,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:24:55,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:24:55,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:24:55,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:24:55,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:24:55,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:24:55,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:24:55,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:24:55,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:24:55,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:24:55,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:24:55,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:24:55,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:24:55,449 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:24:55,465 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:24:55,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:24:55,472 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:24:55,472 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:24:55,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:24:55,473 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:24:55,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:24:55,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:24:55,474 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:24:55,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:24:55,475 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:24:55,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:24:55,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:24:55,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:24:55,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:24:55,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:24:55,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:24:55,476 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:24:55,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:24:55,476 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:24:55,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:24:55,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:24:55,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:24:55,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:24:55,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:55,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:24:55,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:24:55,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:24:55,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:24:55,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:24:55,478 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:24:55,478 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:24:55,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:24:55,479 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 -> 06625eaf591a62e295090a882d83c1e11aaafca7ac8895e7d4adcf51d5b26e02 [2022-02-20 14:24:55,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:24:55,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:24:55,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:24:55,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:24:55,709 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:24:55,711 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array8_pattern.c [2022-02-20 14:24:55,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407781b20/90f1105fae2a40298cf620bb1d0152f6/FLAGc7969503c [2022-02-20 14:24:56,103 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:24:56,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array8_pattern.c [2022-02-20 14:24:56,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407781b20/90f1105fae2a40298cf620bb1d0152f6/FLAGc7969503c [2022-02-20 14:24:56,133 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407781b20/90f1105fae2a40298cf620bb1d0152f6 [2022-02-20 14:24:56,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:24:56,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:24:56,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:56,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:24:56,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:24:56,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@553461e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56, skipping insertion in model container [2022-02-20 14:24:56,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:24:56,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:24:56,287 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/array8_pattern.c[1321,1334] [2022-02-20 14:24:56,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:56,315 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:24:56,323 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/array8_pattern.c[1321,1334] [2022-02-20 14:24:56,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:56,343 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:24:56,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56 WrapperNode [2022-02-20 14:24:56,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:56,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:56,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:24:56,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:24:56,350 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:24:56" (1/1) ... [2022-02-20 14:24:56,363 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:24:56" (1/1) ... [2022-02-20 14:24:56,381 INFO L137 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2022-02-20 14:24:56,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:56,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:24:56,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:24:56,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:24:56,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:24:56,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:24:56,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:24:56,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:24:56,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (1/1) ... [2022-02-20 14:24:56,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:56,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:56,429 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:24:56,431 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:24:56,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:24:56,454 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:24:56,454 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:24:56,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:24:56,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:24:56,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:24:56,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:24:56,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:24:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:24:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:24:56,503 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:24:56,504 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:24:56,663 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:24:56,668 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:24:56,668 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:24:56,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:56 BoogieIcfgContainer [2022-02-20 14:24:56,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:24:56,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:24:56,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:24:56,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:24:56,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:24:56" (1/3) ... [2022-02-20 14:24:56,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b57ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:56, skipping insertion in model container [2022-02-20 14:24:56,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:56" (2/3) ... [2022-02-20 14:24:56,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b57ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:56, skipping insertion in model container [2022-02-20 14:24:56,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:56" (3/3) ... [2022-02-20 14:24:56,676 INFO L111 eAbstractionObserver]: Analyzing ICFG array8_pattern.c [2022-02-20 14:24:56,679 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:24:56,679 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:24:56,707 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:24:56,712 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:24:56,712 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:24:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 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:24:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:24:56,731 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:56,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:56,732 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:56,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1127586545, now seen corresponding path program 1 times [2022-02-20 14:24:56,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:56,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84287499] [2022-02-20 14:24:56,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:56,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:56,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:24:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:56,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 14:24:56,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 14:24:56,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 14:24:56,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #82#return; {32#false} is VALID [2022-02-20 14:24:56,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {31#true} is VALID [2022-02-20 14:24:56,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {31#true} is VALID [2022-02-20 14:24:56,931 INFO L272 TraceCheckUtils]: 2: Hoare triple {31#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {31#true} is VALID [2022-02-20 14:24:56,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 14:24:56,933 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 14:24:56,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 14:24:56,934 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {32#false} {31#true} #82#return; {32#false} is VALID [2022-02-20 14:24:56,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#false} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {32#false} is VALID [2022-02-20 14:24:56,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 14:24:56,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} main_~count~0#1 := 1; {32#false} is VALID [2022-02-20 14:24:56,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} assume false; {32#false} is VALID [2022-02-20 14:24:56,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} main_~count~0#1 := 0; {32#false} is VALID [2022-02-20 14:24:56,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {32#false} is VALID [2022-02-20 14:24:56,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {32#false} is VALID [2022-02-20 14:24:56,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume 0 == __VERIFIER_assert_~cond#1; {32#false} is VALID [2022-02-20 14:24:56,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 14:24:56,940 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:24:56,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:56,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84287499] [2022-02-20 14:24:56,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84287499] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:56,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:56,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:24:56,944 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763855012] [2022-02-20 14:24:56,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:56,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 16 [2022-02-20 14:24:56,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:56,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:24:56,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:56,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:24:56,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:57,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:24:57,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:24:57,015 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:24:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,073 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2022-02-20 14:24:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:24:57,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 16 [2022-02-20 14:24:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:24:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 14:24:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:24:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 14:24:57,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2022-02-20 14:24:57,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:57,176 INFO L225 Difference]: With dead ends: 53 [2022-02-20 14:24:57,177 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 14:24:57,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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:24:57,185 INFO L933 BasicCegarLoop]: 32 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, 32 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:24:57,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 14:24:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 14:24:57,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:57,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:24:57,216 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:24:57,216 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:24:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,219 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 14:24:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:24:57,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:57,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:57,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 24 states. [2022-02-20 14:24:57,221 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 24 states. [2022-02-20 14:24:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,223 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 14:24:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:24:57,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:57,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:57,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:57,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:24:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-02-20 14:24:57,227 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-02-20 14:24:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:57,227 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-02-20 14:24:57,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:24:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:24:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:24:57,228 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:57,229 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] [2022-02-20 14:24:57,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:24:57,229 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1008571545, now seen corresponding path program 1 times [2022-02-20 14:24:57,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:57,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161612030] [2022-02-20 14:24:57,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:57,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:57,276 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:57,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124425278] [2022-02-20 14:24:57,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:57,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:57,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:57,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:24:57,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:24:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:57,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:24:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:57,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:57,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {183#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {183#true} is VALID [2022-02-20 14:24:57,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {183#true} is VALID [2022-02-20 14:24:57,552 INFO L272 TraceCheckUtils]: 2: Hoare triple {183#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {183#true} is VALID [2022-02-20 14:24:57,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {183#true} ~cond := #in~cond; {197#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 14:24:57,553 INFO L290 TraceCheckUtils]: 4: Hoare triple {197#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {201#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:24:57,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {201#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {201#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:24:57,555 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {201#(not (= |assume_abort_if_not_#in~cond| 0))} {183#true} #82#return; {208#(< 0 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:57,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(< 0 ~ARR_SIZE~0)} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {212#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:24:57,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {184#false} is VALID [2022-02-20 14:24:57,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#false} main_~count~0#1 := 1; {184#false} is VALID [2022-02-20 14:24:57,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {184#false} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {184#false} is VALID [2022-02-20 14:24:57,557 INFO L272 TraceCheckUtils]: 11: Hoare triple {184#false} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {184#false} is VALID [2022-02-20 14:24:57,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#false} ~cond := #in~cond; {184#false} is VALID [2022-02-20 14:24:57,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {184#false} assume !(0 == ~cond); {184#false} is VALID [2022-02-20 14:24:57,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {184#false} assume true; {184#false} is VALID [2022-02-20 14:24:57,557 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {184#false} {184#false} #84#return; {184#false} is VALID [2022-02-20 14:24:57,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {184#false} call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4); {184#false} is VALID [2022-02-20 14:24:57,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {184#false} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2);call main_#t~mem7#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);main_#t~ite8#1 := main_#t~mem7#1; {184#false} is VALID [2022-02-20 14:24:57,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {184#false} call write~int(main_#t~ite8#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~ite8#1;havoc main_#t~mem7#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {184#false} is VALID [2022-02-20 14:24:57,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {184#false} assume 0 == main_~temp~0#1; {184#false} is VALID [2022-02-20 14:24:57,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {184#false} main_~count~0#1 := 0; {184#false} is VALID [2022-02-20 14:24:57,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {184#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {184#false} is VALID [2022-02-20 14:24:57,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {184#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {184#false} is VALID [2022-02-20 14:24:57,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {184#false} assume 0 == __VERIFIER_assert_~cond#1; {184#false} is VALID [2022-02-20 14:24:57,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-02-20 14:24:57,559 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:24:57,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:57,560 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:57,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161612030] [2022-02-20 14:24:57,560 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:57,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124425278] [2022-02-20 14:24:57,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124425278] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:57,561 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:57,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 14:24:57,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759582198] [2022-02-20 14:24:57,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:57,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 25 [2022-02-20 14:24:57,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:57,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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:24:57,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:57,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 14:24:57,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:57,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 14:24:57,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 14:24:57,583 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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:24:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,746 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-02-20 14:24:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:24:57,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 25 [2022-02-20 14:24:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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:24:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-02-20 14:24:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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:24:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-02-20 14:24:57,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2022-02-20 14:24:57,796 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:24:57,797 INFO L225 Difference]: With dead ends: 50 [2022-02-20 14:24:57,797 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 14:24:57,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:24:57,800 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:57,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 57 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 14:24:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-02-20 14:24:57,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:57,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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:24:57,814 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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:24:57,814 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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:24:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,818 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 14:24:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 14:24:57,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:57,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:57,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 32 states. [2022-02-20 14:24:57,820 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 32 states. [2022-02-20 14:24:57,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,825 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 14:24:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 14:24:57,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:57,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:57,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:57,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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:24:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-20 14:24:57,827 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-02-20 14:24:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:57,827 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-20 14:24:57,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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:24:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 14:24:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:24:57,830 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:57,830 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, 1] [2022-02-20 14:24:57,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:24:58,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:58,040 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:58,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:58,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1890411897, now seen corresponding path program 1 times [2022-02-20 14:24:58,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:58,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261986184] [2022-02-20 14:24:58,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:58,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:58,069 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:58,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1263180197] [2022-02-20 14:24:58,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:58,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:58,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:58,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:24:58,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 14:24:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-20 14:24:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:58,211 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 10 treesize of output 8 [2022-02-20 14:24:58,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:58,299 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:24:58,312 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:24:58,926 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 23 treesize of output 22 [2022-02-20 14:24:59,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:24:59,213 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 45 treesize of output 32 [2022-02-20 14:24:59,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:24:59,714 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 32 treesize of output 12 [2022-02-20 14:24:59,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {435#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {435#true} is VALID [2022-02-20 14:24:59,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {435#true} is VALID [2022-02-20 14:24:59,925 INFO L272 TraceCheckUtils]: 2: Hoare triple {435#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {435#true} is VALID [2022-02-20 14:24:59,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {435#true} ~cond := #in~cond; {435#true} is VALID [2022-02-20 14:24:59,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {435#true} assume !(0 == ~cond); {435#true} is VALID [2022-02-20 14:24:59,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 14:24:59,926 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {435#true} {435#true} #82#return; {435#true} is VALID [2022-02-20 14:24:59,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {435#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {461#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {461#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {465#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {465#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {469#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {469#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {473#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {473#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_~count~0#1 := 1; {477#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {477#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {477#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,936 INFO L272 TraceCheckUtils]: 13: Hoare triple {477#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {484#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0)))} is VALID [2022-02-20 14:24:59,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {484#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0)))} ~cond := #in~cond; {488#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0)))} is VALID [2022-02-20 14:24:59,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {488#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0)))} assume !(0 == ~cond); {492#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0)))} is VALID [2022-02-20 14:24:59,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {492#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0)))} assume true; {492#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0)))} is VALID [2022-02-20 14:24:59,940 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {492#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_1|) 0) 0)))} {477#(and (< 0 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} #84#return; {499#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {499#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4); {503#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {503#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2);call main_#t~mem7#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);main_#t~ite8#1 := main_#t~mem7#1; {507#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= 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| (* 4 |ULTIMATE.start_main_~index~0#1|)))) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {507#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (<= 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| (* 4 |ULTIMATE.start_main_~index~0#1|)))) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} call write~int(main_#t~ite8#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~ite8#1;havoc main_#t~mem7#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {511#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 0) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1))))} is VALID [2022-02-20 14:24:59,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {511#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 0) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1))))} assume 0 == main_~temp~0#1; {511#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 0) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1))))} is VALID [2022-02-20 14:24:59,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {511#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 0) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1))))} main_~count~0#1 := 0; {518#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 0) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1))))} is VALID [2022-02-20 14:24:59,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {518#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 0) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1))))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {522#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (<= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:24:59,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {522#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (<= |ULTIMATE.start_main_~sum~0#1| 1))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {522#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (<= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:24:59,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {522#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (<= |ULTIMATE.start_main_~sum~0#1| 1))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {522#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (<= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:24:59,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {522#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (<= |ULTIMATE.start_main_~sum~0#1| 1))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {532#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:24:59,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {532#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {436#false} is VALID [2022-02-20 14:24:59,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {436#false} assume !false; {436#false} is VALID [2022-02-20 14:24:59,950 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:24:59,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:00,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:00,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261986184] [2022-02-20 14:25:00,704 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:00,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263180197] [2022-02-20 14:25:00,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263180197] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:25:00,704 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:25:00,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-02-20 14:25:00,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061421440] [2022-02-20 14:25:00,705 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:00,705 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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 29 [2022-02-20 14:25:00,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:00,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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:25:00,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:00,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 14:25:00,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:00,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 14:25:00,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-02-20 14:25:00,748 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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:25:01,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:01,332 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-02-20 14:25:01,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 14:25:01,333 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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 29 [2022-02-20 14:25:01,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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:25:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2022-02-20 14:25:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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:25:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2022-02-20 14:25:01,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 75 transitions. [2022-02-20 14:25:01,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:01,424 INFO L225 Difference]: With dead ends: 70 [2022-02-20 14:25:01,425 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 14:25:01,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2022-02-20 14:25:01,429 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:01,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 175 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 96 Invalid, 0 Unknown, 63 Unchecked, 0.1s Time] [2022-02-20 14:25:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 14:25:01,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-02-20 14:25:01,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:01,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 46 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:01,462 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 46 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:01,463 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 46 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:01,464 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-02-20 14:25:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-02-20 14:25:01,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:01,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:01,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 50 states. [2022-02-20 14:25:01,465 INFO L87 Difference]: Start difference. First operand has 46 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 50 states. [2022-02-20 14:25:01,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:01,467 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-02-20 14:25:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-02-20 14:25:01,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:01,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:01,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:01,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-02-20 14:25:01,469 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 29 [2022-02-20 14:25:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:01,469 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-02-20 14:25:01,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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:25:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-02-20 14:25:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:25:01,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:01,470 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, 1] [2022-02-20 14:25:01,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:25:01,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 14:25:01,684 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:01,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:01,684 INFO L85 PathProgramCache]: Analyzing trace with hash -32099493, now seen corresponding path program 2 times [2022-02-20 14:25:01,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:01,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828828850] [2022-02-20 14:25:01,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:01,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:01,725 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:01,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304978087] [2022-02-20 14:25:01,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:25:01,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:01,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:01,729 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:25:01,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 14:25:01,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:25:01,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:01,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:25:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:01,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:01,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {841#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {841#true} is VALID [2022-02-20 14:25:01,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {841#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {841#true} is VALID [2022-02-20 14:25:01,961 INFO L272 TraceCheckUtils]: 2: Hoare triple {841#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {841#true} is VALID [2022-02-20 14:25:01,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {841#true} ~cond := #in~cond; {841#true} is VALID [2022-02-20 14:25:01,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {841#true} assume !(0 == ~cond); {841#true} is VALID [2022-02-20 14:25:01,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {841#true} assume true; {841#true} is VALID [2022-02-20 14:25:01,962 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {841#true} {841#true} #82#return; {841#true} is VALID [2022-02-20 14:25:01,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {841#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {867#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:01,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {867#(<= |ULTIMATE.start_main_~count~0#1| 0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {867#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:01,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#(<= |ULTIMATE.start_main_~count~0#1| 0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {874#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:01,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {874#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:01,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {878#(<= ~ARR_SIZE~0 1)} main_~count~0#1 := 1; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:01,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {878#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:01,965 INFO L272 TraceCheckUtils]: 13: Hoare triple {878#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:01,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {878#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:01,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {878#(<= ~ARR_SIZE~0 1)} assume !(0 == ~cond); {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:01,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {878#(<= ~ARR_SIZE~0 1)} assume true; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:01,967 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {878#(<= ~ARR_SIZE~0 1)} {878#(<= ~ARR_SIZE~0 1)} #84#return; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:01,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {878#(<= ~ARR_SIZE~0 1)} call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4); {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:01,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {878#(<= ~ARR_SIZE~0 1)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2);call main_#t~mem7#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);main_#t~ite8#1 := main_#t~mem7#1; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:01,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {878#(<= ~ARR_SIZE~0 1)} call write~int(main_#t~ite8#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~ite8#1;havoc main_#t~mem7#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:01,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {878#(<= ~ARR_SIZE~0 1)} assume 0 == main_~temp~0#1; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:01,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {878#(<= ~ARR_SIZE~0 1)} main_~count~0#1 := 0; {915#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 1))} is VALID [2022-02-20 14:25:01,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {915#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 1))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {915#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 1))} is VALID [2022-02-20 14:25:01,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {915#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 1))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {922#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 1))} is VALID [2022-02-20 14:25:01,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {922#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 1))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {842#false} is VALID [2022-02-20 14:25:01,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {842#false} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {842#false} is VALID [2022-02-20 14:25:01,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {842#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {842#false} is VALID [2022-02-20 14:25:01,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {842#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {842#false} is VALID [2022-02-20 14:25:01,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {842#false} assume 0 == __VERIFIER_assert_~cond#1; {842#false} is VALID [2022-02-20 14:25:01,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {842#false} assume !false; {842#false} is VALID [2022-02-20 14:25:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:01,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:02,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {842#false} assume !false; {842#false} is VALID [2022-02-20 14:25:02,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {842#false} assume 0 == __VERIFIER_assert_~cond#1; {842#false} is VALID [2022-02-20 14:25:02,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {842#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {842#false} is VALID [2022-02-20 14:25:02,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {842#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {842#false} is VALID [2022-02-20 14:25:02,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {842#false} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {842#false} is VALID [2022-02-20 14:25:02,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {956#(not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {842#false} is VALID [2022-02-20 14:25:02,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {960#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {956#(not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:02,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {960#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {960#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:25:02,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {878#(<= ~ARR_SIZE~0 1)} main_~count~0#1 := 0; {960#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:25:02,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {878#(<= ~ARR_SIZE~0 1)} assume 0 == main_~temp~0#1; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:02,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {878#(<= ~ARR_SIZE~0 1)} call write~int(main_#t~ite8#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~ite8#1;havoc main_#t~mem7#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:02,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {878#(<= ~ARR_SIZE~0 1)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2);call main_#t~mem7#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);main_#t~ite8#1 := main_#t~mem7#1; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:02,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {878#(<= ~ARR_SIZE~0 1)} call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4); {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:02,112 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {841#true} {878#(<= ~ARR_SIZE~0 1)} #84#return; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:02,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#true} assume true; {841#true} is VALID [2022-02-20 14:25:02,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {841#true} assume !(0 == ~cond); {841#true} is VALID [2022-02-20 14:25:02,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {841#true} ~cond := #in~cond; {841#true} is VALID [2022-02-20 14:25:02,113 INFO L272 TraceCheckUtils]: 13: Hoare triple {878#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {841#true} is VALID [2022-02-20 14:25:02,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {878#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:02,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {878#(<= ~ARR_SIZE~0 1)} main_~count~0#1 := 1; {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:02,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {874#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {878#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:25:02,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#(<= |ULTIMATE.start_main_~count~0#1| 0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {874#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:02,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {867#(<= |ULTIMATE.start_main_~count~0#1| 0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {867#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:02,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {841#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {867#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:02,116 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {841#true} {841#true} #82#return; {841#true} is VALID [2022-02-20 14:25:02,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {841#true} assume true; {841#true} is VALID [2022-02-20 14:25:02,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {841#true} assume !(0 == ~cond); {841#true} is VALID [2022-02-20 14:25:02,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {841#true} ~cond := #in~cond; {841#true} is VALID [2022-02-20 14:25:02,117 INFO L272 TraceCheckUtils]: 2: Hoare triple {841#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {841#true} is VALID [2022-02-20 14:25:02,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {841#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {841#true} is VALID [2022-02-20 14:25:02,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {841#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {841#true} is VALID [2022-02-20 14:25:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:25:02,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:02,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828828850] [2022-02-20 14:25:02,118 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:02,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304978087] [2022-02-20 14:25:02,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304978087] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:02,118 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:25:02,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:25:02,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873178949] [2022-02-20 14:25:02,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:02,119 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-02-20 14:25:02,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:02,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:02,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:02,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:25:02,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:02,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:25:02,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:25:02,146 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:02,387 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-02-20 14:25:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 14:25:02,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-02-20 14:25:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-02-20 14:25:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-02-20 14:25:02,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 63 transitions. [2022-02-20 14:25:02,438 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:25:02,439 INFO L225 Difference]: With dead ends: 61 [2022-02-20 14:25:02,439 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 14:25:02,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:25:02,440 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 53 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:02,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 98 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:25:02,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 14:25:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-02-20 14:25:02,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:02,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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:25:02,455 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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:25:02,455 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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:25:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:02,456 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-02-20 14:25:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-02-20 14:25:02,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:02,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:02,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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 40 states. [2022-02-20 14:25:02,457 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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 40 states. [2022-02-20 14:25:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:02,458 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-02-20 14:25:02,458 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-02-20 14:25:02,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:02,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:02,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:02,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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:25:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-02-20 14:25:02,460 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 31 [2022-02-20 14:25:02,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:02,460 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-02-20 14:25:02,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 14:25:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:25:02,461 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:02,461 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, 1] [2022-02-20 14:25:02,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 14:25:02,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:02,679 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:02,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:02,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1857874167, now seen corresponding path program 3 times [2022-02-20 14:25:02,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:02,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343327712] [2022-02-20 14:25:02,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:02,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:02,704 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:02,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165456659] [2022-02-20 14:25:02,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:25:02,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:02,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:02,705 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:25:02,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 14:25:02,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 14:25:02,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:02,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:25:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:02,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:02,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {1238#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1238#true} is VALID [2022-02-20 14:25:02,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {1238#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1238#true} is VALID [2022-02-20 14:25:02,965 INFO L272 TraceCheckUtils]: 2: Hoare triple {1238#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1238#true} is VALID [2022-02-20 14:25:02,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {1238#true} ~cond := #in~cond; {1238#true} is VALID [2022-02-20 14:25:02,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {1238#true} assume !(0 == ~cond); {1238#true} is VALID [2022-02-20 14:25:02,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-02-20 14:25:02,966 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1238#true} {1238#true} #82#return; {1238#true} is VALID [2022-02-20 14:25:02,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {1238#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {1264#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:02,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#(<= 0 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1264#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:02,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {1264#(<= 0 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1271#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:02,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {1271#(<= 1 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} main_~count~0#1 := 1; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,969 INFO L272 TraceCheckUtils]: 15: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} ~cond := #in~cond; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} assume !(0 == ~cond); {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} assume true; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,971 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1275#(< 1 ~ARR_SIZE~0)} {1275#(< 1 ~ARR_SIZE~0)} #84#return; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4); {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2);call main_#t~mem7#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);main_#t~ite8#1 := main_#t~mem7#1; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} call write~int(main_#t~ite8#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~ite8#1;havoc main_#t~mem7#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} main_~count~0#1 := 0; {1318#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:25:02,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {1318#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {1318#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:25:02,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {1318#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1325#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:25:02,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {1325#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 1))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1239#false} is VALID [2022-02-20 14:25:02,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {1239#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1239#false} is VALID [2022-02-20 14:25:02,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {1239#false} assume 0 == __VERIFIER_assert_~cond#1; {1239#false} is VALID [2022-02-20 14:25:02,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {1239#false} assume !false; {1239#false} is VALID [2022-02-20 14:25:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:02,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:03,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {1239#false} assume !false; {1239#false} is VALID [2022-02-20 14:25:03,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {1239#false} assume 0 == __VERIFIER_assert_~cond#1; {1239#false} is VALID [2022-02-20 14:25:03,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {1239#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1239#false} is VALID [2022-02-20 14:25:03,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {1347#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1239#false} is VALID [2022-02-20 14:25:03,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {1351#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1347#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:03,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {1351#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {1351#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:03,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} main_~count~0#1 := 0; {1351#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:03,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:03,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} call write~int(main_#t~ite8#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~ite8#1;havoc main_#t~mem7#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:03,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2);call main_#t~mem7#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);main_#t~ite8#1 := main_#t~mem7#1; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:03,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4); {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:03,120 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1238#true} {1275#(< 1 ~ARR_SIZE~0)} #84#return; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:03,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-02-20 14:25:03,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {1238#true} assume !(0 == ~cond); {1238#true} is VALID [2022-02-20 14:25:03,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {1238#true} ~cond := #in~cond; {1238#true} is VALID [2022-02-20 14:25:03,121 INFO L272 TraceCheckUtils]: 15: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1238#true} is VALID [2022-02-20 14:25:03,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:03,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} main_~count~0#1 := 1; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:03,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:03,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:03,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {1271#(<= 1 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1275#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:03,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {1264#(<= 0 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1271#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:03,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#(<= 0 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1264#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:03,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {1238#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {1264#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:03,131 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1238#true} {1238#true} #82#return; {1238#true} is VALID [2022-02-20 14:25:03,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-02-20 14:25:03,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {1238#true} assume !(0 == ~cond); {1238#true} is VALID [2022-02-20 14:25:03,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {1238#true} ~cond := #in~cond; {1238#true} is VALID [2022-02-20 14:25:03,132 INFO L272 TraceCheckUtils]: 2: Hoare triple {1238#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1238#true} is VALID [2022-02-20 14:25:03,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {1238#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1238#true} is VALID [2022-02-20 14:25:03,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {1238#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1238#true} is VALID [2022-02-20 14:25:03,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:25:03,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:03,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343327712] [2022-02-20 14:25:03,133 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:03,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165456659] [2022-02-20 14:25:03,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165456659] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:03,133 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:25:03,133 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:25:03,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853069011] [2022-02-20 14:25:03,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:03,134 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-02-20 14:25:03,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:03,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:03,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:03,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:25:03,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:03,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:25:03,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:25:03,161 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:03,375 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 14:25:03,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 14:25:03,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-02-20 14:25:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-02-20 14:25:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-02-20 14:25:03,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-02-20 14:25:03,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:03,416 INFO L225 Difference]: With dead ends: 39 [2022-02-20 14:25:03,416 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 14:25:03,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:25:03,417 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 58 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:03,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 56 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:25:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 14:25:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-02-20 14:25:03,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:03,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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:25:03,438 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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:25:03,438 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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:25:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:03,439 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-02-20 14:25:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-02-20 14:25:03,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:03,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:03,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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 35 states. [2022-02-20 14:25:03,440 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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 35 states. [2022-02-20 14:25:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:03,441 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-02-20 14:25:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-02-20 14:25:03,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:03,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:03,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:03,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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:25:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-02-20 14:25:03,443 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 31 [2022-02-20 14:25:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:03,443 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-02-20 14:25:03,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-02-20 14:25:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:25:03,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:03,444 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:03,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:25:03,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:03,647 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:03,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:03,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1236086951, now seen corresponding path program 4 times [2022-02-20 14:25:03,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:03,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038414948] [2022-02-20 14:25:03,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:03,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:03,683 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:03,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565648930] [2022-02-20 14:25:03,683 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:25:03,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:03,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:03,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:25:03,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 14:25:03,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:25:03,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:03,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-20 14:25:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:03,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:03,815 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 10 treesize of output 8 [2022-02-20 14:25:03,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:03,857 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:25:03,861 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:25:04,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:04,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-02-20 14:25:06,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:06,728 INFO L356 Elim1Store]: treesize reduction 30, result has 42.3 percent of original size [2022-02-20 14:25:06,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 67 [2022-02-20 14:25:07,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:07,635 INFO L356 Elim1Store]: treesize reduction 81, result has 47.4 percent of original size [2022-02-20 14:25:07,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 132 [2022-02-20 14:25:16,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:16,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:16,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:16,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:16,559 INFO L356 Elim1Store]: treesize reduction 16, result has 87.6 percent of original size [2022-02-20 14:25:16,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 5 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 118 treesize of output 166 [2022-02-20 14:25:17,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {1604#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1604#true} is VALID [2022-02-20 14:25:17,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {1604#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1604#true} is VALID [2022-02-20 14:25:17,919 INFO L272 TraceCheckUtils]: 2: Hoare triple {1604#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1604#true} is VALID [2022-02-20 14:25:17,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {1604#true} ~cond := #in~cond; {1604#true} is VALID [2022-02-20 14:25:17,920 INFO L290 TraceCheckUtils]: 4: Hoare triple {1604#true} assume !(0 == ~cond); {1604#true} is VALID [2022-02-20 14:25:17,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {1604#true} assume true; {1604#true} is VALID [2022-02-20 14:25:17,920 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1604#true} {1604#true} #82#return; {1604#true} is VALID [2022-02-20 14:25:17,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {1604#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {1630#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:17,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {1630#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1634#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:17,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {1634#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1638#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:17,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {1638#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1642#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:17,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {1642#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1646#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 2 |ULTIMATE.start_main_~count~0#1|) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0))} is VALID [2022-02-20 14:25:17,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {1646#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 2 |ULTIMATE.start_main_~count~0#1|) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1650#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~count~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (<= 2 |ULTIMATE.start_main_~count~0#1|) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:17,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {1650#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~count~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (<= 2 |ULTIMATE.start_main_~count~0#1|) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_~count~0#1 := 1; {1654#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~count~0#1| 1) (exists ((|ULTIMATE.start_main_~count~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (<= 2 |ULTIMATE.start_main_~count~0#1|) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:17,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~count~0#1| 1) (exists ((|ULTIMATE.start_main_~count~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (<= 2 |ULTIMATE.start_main_~count~0#1|) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1654#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~count~0#1| 1) (exists ((|ULTIMATE.start_main_~count~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (<= 2 |ULTIMATE.start_main_~count~0#1|) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:17,935 INFO L272 TraceCheckUtils]: 15: Hoare triple {1654#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~count~0#1| 1) (exists ((|ULTIMATE.start_main_~count~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (<= 2 |ULTIMATE.start_main_~count~0#1|) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1661#(exists ((|ULTIMATE.start_main_~count~0#1| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|)) (<= 2 |ULTIMATE.start_main_~count~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1))))} is VALID [2022-02-20 14:25:17,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {1661#(exists ((|ULTIMATE.start_main_~count~0#1| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|)) (<= 2 |ULTIMATE.start_main_~count~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1))))} ~cond := #in~cond; {1665#(and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|ULTIMATE.start_main_~count~0#1| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|)) (<= 2 |ULTIMATE.start_main_~count~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)))))} is VALID [2022-02-20 14:25:17,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {1665#(and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (exists ((|ULTIMATE.start_main_~count~0#1| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|)) (<= 2 |ULTIMATE.start_main_~count~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)))))} assume !(0 == ~cond); {1669#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|ULTIMATE.start_main_~count~0#1| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|)) (<= 2 |ULTIMATE.start_main_~count~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)))))} is VALID [2022-02-20 14:25:17,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {1669#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|ULTIMATE.start_main_~count~0#1| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|)) (<= 2 |ULTIMATE.start_main_~count~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)))))} assume true; {1669#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|ULTIMATE.start_main_~count~0#1| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|)) (<= 2 |ULTIMATE.start_main_~count~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)))))} is VALID [2022-02-20 14:25:17,941 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1669#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|ULTIMATE.start_main_~count~0#1| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|)) (<= 2 |ULTIMATE.start_main_~count~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)))))} {1654#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~count~0#1| 1) (exists ((|ULTIMATE.start_main_~count~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (<= 2 |ULTIMATE.start_main_~count~0#1|) (not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~count~0#1| (+ ~ARR_SIZE~0 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0))) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} #84#return; {1676#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (exists ((|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (not (< |v_ULTIMATE.start_main_~count~0#1_38| ~ARR_SIZE~0)) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:17,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {1676#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (exists ((|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (not (< |v_ULTIMATE.start_main_~count~0#1_38| ~ARR_SIZE~0)) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4); {1680#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (exists ((|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (+ (* 4 |ULTIMATE.start_main_~index~0#1|) 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (not (< |v_ULTIMATE.start_main_~count~0#1_38| ~ARR_SIZE~0)) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:17,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {1680#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (exists ((|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (+ (* 4 |ULTIMATE.start_main_~index~0#1|) 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (not (< |v_ULTIMATE.start_main_~count~0#1_38| ~ARR_SIZE~0)) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2);call main_#t~mem7#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);main_#t~ite8#1 := main_#t~mem7#1; {1684#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) |ULTIMATE.start_main_#t~ite8#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (exists ((|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (+ (* 4 |ULTIMATE.start_main_~index~0#1|) 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (not (< |v_ULTIMATE.start_main_~count~0#1_38| ~ARR_SIZE~0)) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (= (mod |ULTIMATE.start_main_~index~0#1| 2) 0))} is VALID [2022-02-20 14:25:17,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {1684#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) |ULTIMATE.start_main_#t~ite8#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (exists ((|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (+ (* 4 |ULTIMATE.start_main_~index~0#1|) 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (not (< |v_ULTIMATE.start_main_~count~0#1_38| ~ARR_SIZE~0)) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (= (mod |ULTIMATE.start_main_~index~0#1| 2) 0))} call write~int(main_#t~ite8#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~ite8#1;havoc main_#t~mem7#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1688#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (<= ~ARR_SIZE~0 |v_ULTIMATE.start_main_~count~0#1_38|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (+ 4 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)))) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 0) (not (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4)))) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:17,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {1688#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (<= ~ARR_SIZE~0 |v_ULTIMATE.start_main_~count~0#1_38|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (+ 4 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)))) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 0) (not (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4)))) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume 0 == main_~temp~0#1; {1688#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (<= ~ARR_SIZE~0 |v_ULTIMATE.start_main_~count~0#1_38|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (+ 4 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)))) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 0) (not (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4)))) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:17,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {1688#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (<= ~ARR_SIZE~0 |v_ULTIMATE.start_main_~count~0#1_38|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (+ 4 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)))) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 0) (not (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4)))) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_~count~0#1 := 0; {1695#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (<= ~ARR_SIZE~0 |v_ULTIMATE.start_main_~count~0#1_38|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (+ 4 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)))) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 0) (not (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4)))) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:17,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {1695#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (<= ~ARR_SIZE~0 |v_ULTIMATE.start_main_~count~0#1_38|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (+ 4 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)))) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 0) (not (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4)))) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {1699#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (<= ~ARR_SIZE~0 |v_ULTIMATE.start_main_~count~0#1_38|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (+ 4 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)))) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 0) (not (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4)))) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))))) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:17,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {1699#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (<= ~ARR_SIZE~0 |v_ULTIMATE.start_main_~count~0#1_38|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (+ 4 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)))) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 0) (not (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4)))) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))))) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1703#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (<= ~ARR_SIZE~0 |v_ULTIMATE.start_main_~count~0#1_38|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (+ 4 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)))) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 0) (not (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4)))) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))))))} is VALID [2022-02-20 14:25:17,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {1703#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int) (|v_ULTIMATE.start_main_~count~0#1_38| Int)) (and (<= ~ARR_SIZE~0 |v_ULTIMATE.start_main_~count~0#1_38|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (- 8))) 0) (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |v_ULTIMATE.start_main_~count~0#1_38| 4))) 0) (= (* |v_ULTIMATE.start_main_~count~0#1_38| 4) (+ 4 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)))) (< |v_ULTIMATE.start_main_~count~0#1_38| (+ ~ARR_SIZE~0 1)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 0) (not (= (+ 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (* |v_ULTIMATE.start_main_~count~0#1_38| 4)))) (<= 2 |v_ULTIMATE.start_main_~count~0#1_38|))) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))))))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {1707#(and (or (< 0 (+ (div (+ (- 3) ~ARR_SIZE~0) 2) 1)) (<= |ULTIMATE.start_main_~sum~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:17,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {1707#(and (or (< 0 (+ (div (+ (- 3) ~ARR_SIZE~0) 2) 1)) (<= |ULTIMATE.start_main_~sum~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1711#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (< 1 ~ARR_SIZE~0) (or (< 0 (+ (div (+ (- 3) ~ARR_SIZE~0) 2) 1)) (<= |ULTIMATE.start_main_~sum~0#1| 1)))} is VALID [2022-02-20 14:25:17,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {1711#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (< 1 ~ARR_SIZE~0) (or (< 0 (+ (div (+ (- 3) ~ARR_SIZE~0) 2) 1)) (<= |ULTIMATE.start_main_~sum~0#1| 1)))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1715#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:17,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {1715#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1719#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:25:17,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {1719#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1605#false} is VALID [2022-02-20 14:25:17,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {1605#false} assume !false; {1605#false} is VALID [2022-02-20 14:25:17,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:17,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:29,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:29,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038414948] [2022-02-20 14:25:29,793 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:29,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565648930] [2022-02-20 14:25:29,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565648930] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:25:29,793 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:25:29,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-02-20 14:25:29,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593609153] [2022-02-20 14:25:29,793 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:29,794 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 21 states have internal predecessors, (29), 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 33 [2022-02-20 14:25:29,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:29,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 21 states have internal predecessors, (29), 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:25:29,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:29,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-20 14:25:29,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:29,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-20 14:25:29,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=953, Unknown=6, NotChecked=0, Total=1122 [2022-02-20 14:25:29,871 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 21 states have internal predecessors, (29), 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:25:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:35,909 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-02-20 14:25:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:25:35,909 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 21 states have internal predecessors, (29), 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 33 [2022-02-20 14:25:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 21 states have internal predecessors, (29), 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:25:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 57 transitions. [2022-02-20 14:25:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 21 states have internal predecessors, (29), 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:25:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 57 transitions. [2022-02-20 14:25:35,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 57 transitions. [2022-02-20 14:25:36,043 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:25:36,044 INFO L225 Difference]: With dead ends: 57 [2022-02-20 14:25:36,044 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 14:25:36,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=220, Invalid=1255, Unknown=7, NotChecked=0, Total=1482 [2022-02-20 14:25:36,045 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:36,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 216 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 108 Unchecked, 0.1s Time] [2022-02-20 14:25:36,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 14:25:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-02-20 14:25:36,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:36,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 47 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:36,093 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 47 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:36,094 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 47 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:36,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:36,095 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-02-20 14:25:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-02-20 14:25:36,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:36,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:36,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 53 states. [2022-02-20 14:25:36,096 INFO L87 Difference]: Start difference. First operand has 47 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 53 states. [2022-02-20 14:25:36,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:36,097 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-02-20 14:25:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-02-20 14:25:36,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:36,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:36,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:36,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:36,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-02-20 14:25:36,099 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 33 [2022-02-20 14:25:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:36,099 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-02-20 14:25:36,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 21 states have internal predecessors, (29), 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:25:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-02-20 14:25:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:25:36,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:36,100 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:36,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:25:36,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:36,301 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:36,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:36,302 INFO L85 PathProgramCache]: Analyzing trace with hash -977921513, now seen corresponding path program 1 times [2022-02-20 14:25:36,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:36,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466521584] [2022-02-20 14:25:36,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:36,320 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:36,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448039967] [2022-02-20 14:25:36,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:36,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:36,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:36,321 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:25:36,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 14:25:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:36,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 60 conjunts are in the unsatisfiable core [2022-02-20 14:25:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:36,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:36,425 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 10 treesize of output 8 [2022-02-20 14:25:36,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:36,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-02-20 14:25:36,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-02-20 14:25:36,496 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:25:36,500 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:25:36,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:36,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:36,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2022-02-20 14:25:37,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:37,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:37,748 INFO L356 Elim1Store]: treesize reduction 42, result has 40.8 percent of original size [2022-02-20 14:25:37,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 68 [2022-02-20 14:25:39,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:39,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:39,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:39,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:39,557 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-02-20 14:25:39,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 96 [2022-02-20 14:25:42,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:42,907 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:25:42,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 76 [2022-02-20 14:25:43,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {2032#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2032#true} is VALID [2022-02-20 14:25:43,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {2032#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2032#true} is VALID [2022-02-20 14:25:43,970 INFO L272 TraceCheckUtils]: 2: Hoare triple {2032#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2032#true} is VALID [2022-02-20 14:25:43,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {2032#true} ~cond := #in~cond; {2032#true} is VALID [2022-02-20 14:25:43,970 INFO L290 TraceCheckUtils]: 4: Hoare triple {2032#true} assume !(0 == ~cond); {2032#true} is VALID [2022-02-20 14:25:43,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {2032#true} assume true; {2032#true} is VALID [2022-02-20 14:25:43,970 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2032#true} {2032#true} #82#return; {2032#true} is VALID [2022-02-20 14:25:43,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {2032#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {2058#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:43,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {2058#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2062#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:43,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {2062#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2066#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:43,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {2066#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2070#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:43,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {2070#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2070#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:43,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {2070#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2070#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:43,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {2070#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_~count~0#1 := 1; {2080#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:43,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {2080#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2080#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:43,984 INFO L272 TraceCheckUtils]: 15: Hoare triple {2080#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2087#(and (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:43,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {2087#(and (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (< 1 ~ARR_SIZE~0))} ~cond := #in~cond; {2091#(and (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (< 1 ~ARR_SIZE~0) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-02-20 14:25:43,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {2091#(and (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (< 1 ~ARR_SIZE~0) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {2095#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:43,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {2095#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (< 1 ~ARR_SIZE~0))} assume true; {2095#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:43,993 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2095#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (< 1 ~ARR_SIZE~0))} {2080#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} #84#return; {2102#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< 1 ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:43,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {2102#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< 1 ~ARR_SIZE~0) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4); {2106#(and (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< 1 ~ARR_SIZE~0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:43,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {2106#(and (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< 1 ~ARR_SIZE~0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !(0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2));main_#t~ite8#1 := main_~num~0#1 * main_~count~0#1; {2110#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_#t~ite8#1| 1) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (not (= (mod |ULTIMATE.start_main_~index~0#1| 2) 0)) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:44,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {2110#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_#t~ite8#1| 1) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (not (= (mod |ULTIMATE.start_main_~index~0#1| 2) 0)) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} call write~int(main_#t~ite8#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~ite8#1;havoc main_#t~mem7#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {2114#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) 0) (< (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:44,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {2114#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) 0) (< (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume 0 == main_~temp~0#1; {2114#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) 0) (< (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:44,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {2114#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) 0) (< (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_~count~0#1 := 0; {2121#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) 0) (< (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:44,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {2121#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) 0) (< (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2125#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) 0) (< (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)))) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:44,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {2125#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) 0) (< (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)))) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2129#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) 0) (< (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)))) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))))))} is VALID [2022-02-20 14:25:44,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {2129#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (exists ((|aux_mod_ULTIMATE.start_main_~index~0#1_40| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 2) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) 0) (< (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) 4)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|) (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (+ (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)))) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))))))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2133#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:44,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {2133#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2133#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:44,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {2133#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2133#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:44,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {2133#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2143#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:25:44,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {2143#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2033#false} is VALID [2022-02-20 14:25:44,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {2033#false} assume !false; {2033#false} is VALID [2022-02-20 14:25:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:44,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:47,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:47,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466521584] [2022-02-20 14:25:47,773 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:47,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448039967] [2022-02-20 14:25:47,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448039967] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:25:47,773 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:25:47,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-02-20 14:25:47,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980496985] [2022-02-20 14:25:47,773 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:47,774 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 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 33 [2022-02-20 14:25:47,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:47,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 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:25:49,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:49,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 14:25:49,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:49,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 14:25:49,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=630, Unknown=2, NotChecked=0, Total=756 [2022-02-20 14:25:49,848 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 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:25:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:50,360 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-02-20 14:25:50,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 14:25:50,360 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 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 33 [2022-02-20 14:25:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 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:25:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-02-20 14:25:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 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:25:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-02-20 14:25:50,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 61 transitions. [2022-02-20 14:25:50,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:50,506 INFO L225 Difference]: With dead ends: 73 [2022-02-20 14:25:50,506 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 14:25:50,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=129, Invalid=681, Unknown=2, NotChecked=0, Total=812 [2022-02-20 14:25:50,507 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 18 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:50,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 207 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 136 Unchecked, 0.1s Time] [2022-02-20 14:25:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 14:25:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-02-20 14:25:50,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:50,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:50,594 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:50,594 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:50,595 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-02-20 14:25:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2022-02-20 14:25:50,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:50,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:50,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 69 states. [2022-02-20 14:25:50,596 INFO L87 Difference]: Start difference. First operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 69 states. [2022-02-20 14:25:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:50,598 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-02-20 14:25:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2022-02-20 14:25:50,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:50,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:50,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:50,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-02-20 14:25:50,600 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 33 [2022-02-20 14:25:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:50,600 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-02-20 14:25:50,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 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:25:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-02-20 14:25:50,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 14:25:50,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:50,601 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:50,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-20 14:25:50,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:50,819 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:50,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1879614779, now seen corresponding path program 5 times [2022-02-20 14:25:50,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:50,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7688253] [2022-02-20 14:25:50,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:50,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:50,843 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:50,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [888807194] [2022-02-20 14:25:50,843 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:25:50,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:50,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:50,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:25:50,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 14:25:50,905 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-02-20 14:25:50,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:50,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:25:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:50,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:51,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {2514#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2514#true} is VALID [2022-02-20 14:25:51,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {2514#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2514#true} is VALID [2022-02-20 14:25:51,077 INFO L272 TraceCheckUtils]: 2: Hoare triple {2514#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2514#true} is VALID [2022-02-20 14:25:51,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {2514#true} ~cond := #in~cond; {2514#true} is VALID [2022-02-20 14:25:51,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {2514#true} assume !(0 == ~cond); {2514#true} is VALID [2022-02-20 14:25:51,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {2514#true} assume true; {2514#true} is VALID [2022-02-20 14:25:51,078 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2514#true} {2514#true} #82#return; {2514#true} is VALID [2022-02-20 14:25:51,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {2514#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {2540#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:51,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {2540#(<= |ULTIMATE.start_main_~count~0#1| 0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2540#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:51,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {2540#(<= |ULTIMATE.start_main_~count~0#1| 0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2547#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:51,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {2547#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2547#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:51,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {2547#(<= |ULTIMATE.start_main_~count~0#1| 1)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2554#(<= |ULTIMATE.start_main_~count~0#1| 2)} is VALID [2022-02-20 14:25:51,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {2554#(<= |ULTIMATE.start_main_~count~0#1| 2)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} main_~count~0#1 := 1; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,082 INFO L272 TraceCheckUtils]: 15: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} ~cond := #in~cond; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} assume !(0 == ~cond); {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} assume true; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,083 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2558#(<= ~ARR_SIZE~0 2)} {2558#(<= ~ARR_SIZE~0 2)} #84#return; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4); {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2);call main_#t~mem7#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);main_#t~ite8#1 := main_#t~mem7#1; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} call write~int(main_#t~ite8#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~ite8#1;havoc main_#t~mem7#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} assume 0 == main_~temp~0#1; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} main_~count~0#1 := 0; {2595#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:51,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {2595#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2595#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:51,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {2595#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2602#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:51,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {2602#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2602#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:51,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {2602#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2609#(and (<= 2 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:51,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {2609#(and (<= 2 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2515#false} is VALID [2022-02-20 14:25:51,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {2515#false} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2515#false} is VALID [2022-02-20 14:25:51,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {2515#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2515#false} is VALID [2022-02-20 14:25:51,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {2515#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2515#false} is VALID [2022-02-20 14:25:51,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {2515#false} assume 0 == __VERIFIER_assert_~cond#1; {2515#false} is VALID [2022-02-20 14:25:51,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {2515#false} assume !false; {2515#false} is VALID [2022-02-20 14:25:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:51,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:51,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {2515#false} assume !false; {2515#false} is VALID [2022-02-20 14:25:51,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {2515#false} assume 0 == __VERIFIER_assert_~cond#1; {2515#false} is VALID [2022-02-20 14:25:51,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {2515#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2515#false} is VALID [2022-02-20 14:25:51,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {2515#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2515#false} is VALID [2022-02-20 14:25:51,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {2515#false} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2515#false} is VALID [2022-02-20 14:25:51,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {2643#(not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2515#false} is VALID [2022-02-20 14:25:51,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {2647#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2643#(not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:51,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {2647#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2647#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:25:51,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {2654#(<= ~ARR_SIZE~0 (+ 2 |ULTIMATE.start_main_~count~0#1|))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2647#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:25:51,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {2654#(<= ~ARR_SIZE~0 (+ 2 |ULTIMATE.start_main_~count~0#1|))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2654#(<= ~ARR_SIZE~0 (+ 2 |ULTIMATE.start_main_~count~0#1|))} is VALID [2022-02-20 14:25:51,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} main_~count~0#1 := 0; {2654#(<= ~ARR_SIZE~0 (+ 2 |ULTIMATE.start_main_~count~0#1|))} is VALID [2022-02-20 14:25:51,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} assume 0 == main_~temp~0#1; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} call write~int(main_#t~ite8#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~ite8#1;havoc main_#t~mem7#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2);call main_#t~mem7#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);main_#t~ite8#1 := main_#t~mem7#1; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4); {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,239 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2514#true} {2558#(<= ~ARR_SIZE~0 2)} #84#return; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {2514#true} assume true; {2514#true} is VALID [2022-02-20 14:25:51,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {2514#true} assume !(0 == ~cond); {2514#true} is VALID [2022-02-20 14:25:51,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {2514#true} ~cond := #in~cond; {2514#true} is VALID [2022-02-20 14:25:51,239 INFO L272 TraceCheckUtils]: 15: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2514#true} is VALID [2022-02-20 14:25:51,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {2558#(<= ~ARR_SIZE~0 2)} main_~count~0#1 := 1; {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {2554#(<= |ULTIMATE.start_main_~count~0#1| 2)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2558#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:51,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {2547#(<= |ULTIMATE.start_main_~count~0#1| 1)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2554#(<= |ULTIMATE.start_main_~count~0#1| 2)} is VALID [2022-02-20 14:25:51,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {2547#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2547#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:51,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {2540#(<= |ULTIMATE.start_main_~count~0#1| 0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2547#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:51,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {2540#(<= |ULTIMATE.start_main_~count~0#1| 0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2540#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:51,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {2514#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {2540#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:51,243 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2514#true} {2514#true} #82#return; {2514#true} is VALID [2022-02-20 14:25:51,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {2514#true} assume true; {2514#true} is VALID [2022-02-20 14:25:51,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {2514#true} assume !(0 == ~cond); {2514#true} is VALID [2022-02-20 14:25:51,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {2514#true} ~cond := #in~cond; {2514#true} is VALID [2022-02-20 14:25:51,243 INFO L272 TraceCheckUtils]: 2: Hoare triple {2514#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2514#true} is VALID [2022-02-20 14:25:51,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {2514#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2514#true} is VALID [2022-02-20 14:25:51,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {2514#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2514#true} is VALID [2022-02-20 14:25:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:25:51,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:51,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7688253] [2022-02-20 14:25:51,246 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:51,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888807194] [2022-02-20 14:25:51,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888807194] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:51,247 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:25:51,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-02-20 14:25:51,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779875116] [2022-02-20 14:25:51,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:51,248 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-02-20 14:25:51,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:51,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:51,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:51,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:25:51,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:51,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:25:51,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:25:51,282 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:51,732 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-02-20 14:25:51,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 14:25:51,733 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-02-20 14:25:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2022-02-20 14:25:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2022-02-20 14:25:51,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2022-02-20 14:25:51,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:51,804 INFO L225 Difference]: With dead ends: 103 [2022-02-20 14:25:51,804 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 14:25:51,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-02-20 14:25:51,804 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 73 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:51,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 115 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:25:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 14:25:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2022-02-20 14:25:51,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:51,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 76 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:25:51,922 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 76 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:25:51,922 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 76 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:25:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:51,924 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-02-20 14:25:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-02-20 14:25:51,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:51,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:51,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 91 states. [2022-02-20 14:25:51,924 INFO L87 Difference]: Start difference. First operand has 76 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 91 states. [2022-02-20 14:25:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:51,926 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-02-20 14:25:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-02-20 14:25:51,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:51,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:51,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:51,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:25:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-02-20 14:25:51,928 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 35 [2022-02-20 14:25:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:51,933 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-02-20 14:25:51,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-02-20 14:25:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 14:25:51,934 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:51,934 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:51,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 14:25:52,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:52,147 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:52,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:52,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1631301269, now seen corresponding path program 2 times [2022-02-20 14:25:52,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:52,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515854483] [2022-02-20 14:25:52,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:52,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:52,165 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:52,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2130839252] [2022-02-20 14:25:52,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:25:52,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:52,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:52,167 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:25:52,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 14:25:52,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:25:52,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:52,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:25:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:52,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:52,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {3158#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {3158#true} is VALID [2022-02-20 14:25:52,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {3158#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3158#true} is VALID [2022-02-20 14:25:52,409 INFO L272 TraceCheckUtils]: 2: Hoare triple {3158#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {3158#true} is VALID [2022-02-20 14:25:52,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {3158#true} ~cond := #in~cond; {3158#true} is VALID [2022-02-20 14:25:52,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {3158#true} assume !(0 == ~cond); {3158#true} is VALID [2022-02-20 14:25:52,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {3158#true} assume true; {3158#true} is VALID [2022-02-20 14:25:52,409 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3158#true} {3158#true} #82#return; {3158#true} is VALID [2022-02-20 14:25:52,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {3158#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {3184#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:52,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#(<= 0 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {3184#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:52,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#(<= 0 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3191#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:52,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {3191#(<= 1 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {3191#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:52,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {3191#(<= 1 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3198#(<= 2 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:52,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {3198#(<= 2 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} main_~count~0#1 := 1; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,414 INFO L272 TraceCheckUtils]: 17: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} ~cond := #in~cond; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} assume !(0 == ~cond); {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} assume true; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,415 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3202#(< 2 ~ARR_SIZE~0)} {3202#(< 2 ~ARR_SIZE~0)} #84#return; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4); {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} assume !(0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2));main_#t~ite8#1 := main_~num~0#1 * main_~count~0#1; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} call write~int(main_#t~ite8#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~ite8#1;havoc main_#t~mem7#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} main_~count~0#1 := 0; {3245#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:25:52,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {3245#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {3245#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:25:52,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {3245#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3252#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:52,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {3252#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {3252#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:52,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {3252#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3259#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:52,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {3259#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (< 2 ~ARR_SIZE~0))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {3159#false} is VALID [2022-02-20 14:25:52,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {3159#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3159#false} is VALID [2022-02-20 14:25:52,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {3159#false} assume 0 == __VERIFIER_assert_~cond#1; {3159#false} is VALID [2022-02-20 14:25:52,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {3159#false} assume !false; {3159#false} is VALID [2022-02-20 14:25:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:52,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:52,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {3159#false} assume !false; {3159#false} is VALID [2022-02-20 14:25:52,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {3159#false} assume 0 == __VERIFIER_assert_~cond#1; {3159#false} is VALID [2022-02-20 14:25:52,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {3159#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3159#false} is VALID [2022-02-20 14:25:52,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {3281#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {3159#false} is VALID [2022-02-20 14:25:52,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {3285#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3281#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {3285#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {3285#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {3292#(< (+ 2 |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3285#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {3292#(< (+ 2 |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {3292#(< (+ 2 |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} main_~count~0#1 := 0; {3292#(< (+ 2 |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} call write~int(main_#t~ite8#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~ite8#1;havoc main_#t~mem7#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} assume !(0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2));main_#t~ite8#1 := main_~num~0#1 * main_~count~0#1; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4); {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,582 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3158#true} {3202#(< 2 ~ARR_SIZE~0)} #84#return; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {3158#true} assume true; {3158#true} is VALID [2022-02-20 14:25:52,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {3158#true} assume !(0 == ~cond); {3158#true} is VALID [2022-02-20 14:25:52,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {3158#true} ~cond := #in~cond; {3158#true} is VALID [2022-02-20 14:25:52,582 INFO L272 TraceCheckUtils]: 17: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {3158#true} is VALID [2022-02-20 14:25:52,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} main_~count~0#1 := 1; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {3202#(< 2 ~ARR_SIZE~0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {3198#(<= 2 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {3202#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:52,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {3191#(<= 1 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3198#(<= 2 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:52,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {3191#(<= 1 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {3191#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:52,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#(<= 0 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3191#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:52,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#(<= 0 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {3184#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:52,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {3158#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {3184#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:52,586 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3158#true} {3158#true} #82#return; {3158#true} is VALID [2022-02-20 14:25:52,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {3158#true} assume true; {3158#true} is VALID [2022-02-20 14:25:52,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {3158#true} assume !(0 == ~cond); {3158#true} is VALID [2022-02-20 14:25:52,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {3158#true} ~cond := #in~cond; {3158#true} is VALID [2022-02-20 14:25:52,586 INFO L272 TraceCheckUtils]: 2: Hoare triple {3158#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {3158#true} is VALID [2022-02-20 14:25:52,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {3158#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3158#true} is VALID [2022-02-20 14:25:52,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {3158#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {3158#true} is VALID [2022-02-20 14:25:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:25:52,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:52,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515854483] [2022-02-20 14:25:52,587 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:52,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130839252] [2022-02-20 14:25:52,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130839252] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:52,587 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:25:52,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-02-20 14:25:52,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607759446] [2022-02-20 14:25:52,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:52,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-02-20 14:25:52,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:52,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:52,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:52,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:25:52,619 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:52,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:25:52,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:25:52,619 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:53,132 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-02-20 14:25:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:25:53,132 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-02-20 14:25:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-02-20 14:25:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-02-20 14:25:53,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-02-20 14:25:53,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:53,192 INFO L225 Difference]: With dead ends: 90 [2022-02-20 14:25:53,192 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 14:25:53,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:25:53,193 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:53,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 132 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:25:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 14:25:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 65. [2022-02-20 14:25:53,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:53,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 65 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:53,319 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 65 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:53,320 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 65 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:53,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:53,321 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-02-20 14:25:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-02-20 14:25:53,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:53,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:53,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 86 states. [2022-02-20 14:25:53,322 INFO L87 Difference]: Start difference. First operand has 65 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 86 states. [2022-02-20 14:25:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:53,324 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-02-20 14:25:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-02-20 14:25:53,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:53,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:53,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:53,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:25:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-02-20 14:25:53,326 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 35 [2022-02-20 14:25:53,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:53,326 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-02-20 14:25:53,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-02-20 14:25:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 14:25:53,326 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:53,327 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:53,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 14:25:53,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-20 14:25:53,544 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:53,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1081807417, now seen corresponding path program 6 times [2022-02-20 14:25:53,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:53,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746495619] [2022-02-20 14:25:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:53,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:53,566 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:53,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [976385498] [2022-02-20 14:25:53,567 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 14:25:53,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:53,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:53,568 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:25:53,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 14:25:53,650 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-02-20 14:25:53,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:53,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 66 conjunts are in the unsatisfiable core [2022-02-20 14:25:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:53,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:53,705 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 10 treesize of output 8 [2022-02-20 14:25:53,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:53,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-02-20 14:25:53,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-02-20 14:25:53,815 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:25:53,832 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:25:53,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:53,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2022-02-20 14:25:54,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-02-20 14:25:54,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-02-20 14:25:54,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2022-02-20 14:25:54,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2022-02-20 14:25:54,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-02-20 14:25:55,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:55,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:55,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:55,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:55,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:55,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:56,010 INFO L356 Elim1Store]: treesize reduction 66, result has 40.0 percent of original size [2022-02-20 14:25:56,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 98 [2022-02-20 14:25:57,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:57,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:57,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:57,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:57,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:57,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:57,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:57,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:57,739 INFO L356 Elim1Store]: treesize reduction 106, result has 13.8 percent of original size [2022-02-20 14:25:57,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 106 [2022-02-20 14:26:03,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:26:03,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,144 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:26:03,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 5 disjoint index pairs (out of 36 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 65 [2022-02-20 14:26:03,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {3767#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {3767#true} is VALID [2022-02-20 14:26:03,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {3767#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;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3767#true} is VALID [2022-02-20 14:26:03,730 INFO L272 TraceCheckUtils]: 2: Hoare triple {3767#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {3767#true} is VALID [2022-02-20 14:26:03,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {3767#true} ~cond := #in~cond; {3767#true} is VALID [2022-02-20 14:26:03,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {3767#true} assume !(0 == ~cond); {3767#true} is VALID [2022-02-20 14:26:03,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {3767#true} assume true; {3767#true} is VALID [2022-02-20 14:26:03,730 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3767#true} {3767#true} #82#return; {3767#true} is VALID [2022-02-20 14:26:03,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {3767#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {3793#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:26:03,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {3793#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {3797#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:26:03,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {3797#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~count~0#1| 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3801#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:26:03,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {3801#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {3805#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:26:03,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {3805#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3809#(and (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 1) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0))} is VALID [2022-02-20 14:26:03,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {3809#(and (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 1) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {3813#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:26:03,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {3813#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3813#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:26:03,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {3813#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {3813#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:26:03,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {3813#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} main_~count~0#1 := 1; {3823#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:26:03,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {3823#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3823#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:26:03,740 INFO L272 TraceCheckUtils]: 17: Hoare triple {3823#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {3830#(and (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 0) 0))) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:26:03,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {3830#(and (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 0) 0))) (< 2 ~ARR_SIZE~0))} ~cond := #in~cond; {3834#(and (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 0) 0))) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:26:03,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {3834#(and (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 0) 0))) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (< 2 ~ARR_SIZE~0))} assume !(0 == ~cond); {3838#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 0) 0))) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:26:03,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {3838#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 0) 0))) (< 2 ~ARR_SIZE~0))} assume true; {3838#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 0) 0))) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:26:03,744 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3838#(and (not (= |assume_abort_if_not_#in~cond| 0)) (exists ((|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4| Int)) (and (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 4) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 8) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_4|) 0) 0))) (< 2 ~ARR_SIZE~0))} {3823#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} #84#return; {3845#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:26:03,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {3845#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4); {3849#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0)) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0)))} is VALID [2022-02-20 14:26:03,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {3849#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0)) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (< 2 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 4) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0)))} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2);call main_#t~mem7#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);main_#t~ite8#1 := main_#t~mem7#1; {3853#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0)) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) |ULTIMATE.start_main_#t~ite8#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (= (mod |ULTIMATE.start_main_~index~0#1| 2) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:26:03,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {3853#(and (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8)) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0)) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) |ULTIMATE.start_main_#t~ite8#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (= (mod |ULTIMATE.start_main_~index~0#1| 2) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} call write~int(main_#t~ite8#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4);havoc main_#t~ite8#1;havoc main_#t~mem7#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {3857#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:26:03,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {3857#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} assume 0 == main_~temp~0#1; {3857#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:26:03,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {3857#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} main_~count~0#1 := 0; {3864#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:26:03,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {3864#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {3868#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))))) (= |ULTIMATE.start_main_~count~0#1| 0) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:26:03,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {3868#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))))) (= |ULTIMATE.start_main_~count~0#1| 0) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3872#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))))))} is VALID [2022-02-20 14:26:03,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {3872#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))))))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {3876#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:26:03,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {3876#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= (+ (- 1) |ULTIMATE.start_main_~count~0#1|) 0) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (- 4) (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3880#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|))) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (= 2 |ULTIMATE.start_main_~count~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} is VALID [2022-02-20 14:26:03,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {3880#(and (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (or (= (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (< (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8))) 1) (<= 0 (* 2 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (or (= 8 (* |aux_div_ULTIMATE.start_main_~index~0#1_40| 8)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|))) (< 2 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (= 2 |ULTIMATE.start_main_~count~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem11#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem12#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem11#1 + main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1; {3884#(and (< 2 ~ARR_SIZE~0) (= 2 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:26:03,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {3884#(and (< 2 ~ARR_SIZE~0) (= 2 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| 1))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3888#(and (<= |ULTIMATE.start_main_~count~0#1| 3) (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:26:03,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {3888#(and (<= |ULTIMATE.start_main_~count~0#1| 3) (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {3892#(and (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:26:03,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {3892#(and (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~sum~0#1 <= 1 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3896#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:03,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {3896#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {3768#false} is VALID [2022-02-20 14:26:03,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2022-02-20 14:26:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:03,772 INFO L328 TraceCheckSpWp]: Computing backward predicates...