./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array9_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/array9_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 8ae6792b63619c19d32145c9c656ded5ce2ab653945337eaf95cf4eb94965d3b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:24:56,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:24:56,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:24:56,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:24:56,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:24:56,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:24:56,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:24:56,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:24:56,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:24:56,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:24:56,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:24:56,315 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:24:56,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:24:56,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:24:56,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:24:56,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:24:56,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:24:56,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:24:56,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:24:56,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:24:56,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:24:56,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:24:56,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:24:56,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:24:56,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:24:56,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:24:56,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:24:56,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:24:56,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:24:56,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:24:56,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:24:56,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:24:56,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:24:56,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:24:56,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:24:56,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:24:56,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:24:56,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:24:56,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:24:56,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:24:56,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:24:56,355 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:56,383 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:24:56,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:24:56,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:24:56,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:24:56,385 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:24:56,385 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:24:56,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:24:56,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:24:56,386 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:24:56,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:24:56,387 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:24:56,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:24:56,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:24:56,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:24:56,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:24:56,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:24:56,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:24:56,389 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:24:56,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:24:56,389 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:24:56,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:24:56,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:24:56,390 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:24:56,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:24:56,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:56,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:24:56,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:24:56,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:24:56,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:24:56,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:24:56,391 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:24:56,391 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:24:56,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:24:56,392 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 -> 8ae6792b63619c19d32145c9c656ded5ce2ab653945337eaf95cf4eb94965d3b [2022-02-20 14:24:56,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:24:56,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:24:56,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:24:56,642 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:24:56,643 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:24:56,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array9_pattern.c [2022-02-20 14:24:56,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f62b8962b/2fc197bf426b4bcca1af4a775764c288/FLAGe38aab672 [2022-02-20 14:24:57,053 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:24:57,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array9_pattern.c [2022-02-20 14:24:57,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f62b8962b/2fc197bf426b4bcca1af4a775764c288/FLAGe38aab672 [2022-02-20 14:24:57,073 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f62b8962b/2fc197bf426b4bcca1af4a775764c288 [2022-02-20 14:24:57,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:24:57,076 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:24:57,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:57,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:24:57,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:24:57,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:57" (1/1) ... [2022-02-20 14:24:57,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7901a176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:57, skipping insertion in model container [2022-02-20 14:24:57,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:57" (1/1) ... [2022-02-20 14:24:57,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:24:57,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:24:57,236 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/array9_pattern.c[1352,1365] [2022-02-20 14:24:57,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:57,279 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:24:57,290 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/array9_pattern.c[1352,1365] [2022-02-20 14:24:57,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:57,323 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:24:57,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:57 WrapperNode [2022-02-20 14:24:57,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:57,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:57,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:24:57,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:24:57,329 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:57" (1/1) ... [2022-02-20 14:24:57,341 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:57" (1/1) ... [2022-02-20 14:24:57,367 INFO L137 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2022-02-20 14:24:57,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:57,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:24:57,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:24:57,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:24:57,375 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:57" (1/1) ... [2022-02-20 14:24:57,375 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:57" (1/1) ... [2022-02-20 14:24:57,378 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:57" (1/1) ... [2022-02-20 14:24:57,379 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:57" (1/1) ... [2022-02-20 14:24:57,395 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:57" (1/1) ... [2022-02-20 14:24:57,400 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:57" (1/1) ... [2022-02-20 14:24:57,402 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:57" (1/1) ... [2022-02-20 14:24:57,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:24:57,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:24:57,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:24:57,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:24:57,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:57" (1/1) ... [2022-02-20 14:24:57,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:57,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:57,436 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:57,442 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:57,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:24:57,467 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:24:57,467 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:24:57,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:24:57,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:24:57,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:24:57,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:24:57,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:24:57,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:24:57,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:24:57,514 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:24:57,516 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:24:57,689 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:24:57,694 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:24:57,694 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:24:57,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:57 BoogieIcfgContainer [2022-02-20 14:24:57,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:24:57,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:24:57,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:24:57,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:24:57,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:24:57" (1/3) ... [2022-02-20 14:24:57,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503a1150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:57, skipping insertion in model container [2022-02-20 14:24:57,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:57" (2/3) ... [2022-02-20 14:24:57,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503a1150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:57, skipping insertion in model container [2022-02-20 14:24:57,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:57" (3/3) ... [2022-02-20 14:24:57,716 INFO L111 eAbstractionObserver]: Analyzing ICFG array9_pattern.c [2022-02-20 14:24:57,721 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:24:57,724 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:24:57,785 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:24:57,794 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:57,795 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:24:57,811 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:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:24:57,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:57,817 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:57,817 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:57,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1127586545, now seen corresponding path program 1 times [2022-02-20 14:24:57,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:57,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902149918] [2022-02-20 14:24:57,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:57,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:24:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 14:24:58,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 14:24:58,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 14:24:58,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #82#return; {32#false} is VALID [2022-02-20 14:24:58,048 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:58,049 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:58,049 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:58,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 14:24:58,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 14:24:58,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 14:24:58,052 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {32#false} {31#true} #82#return; {32#false} is VALID [2022-02-20 14:24:58,052 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:58,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 14:24:58,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} main_~count~0#1 := 1; {32#false} is VALID [2022-02-20 14:24:58,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} assume false; {32#false} is VALID [2022-02-20 14:24:58,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} main_~count~0#1 := 0; {32#false} is VALID [2022-02-20 14:24:58,053 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:58,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 3 * main_~sum~0#1 <= 2 + ~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:58,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume 0 == __VERIFIER_assert_~cond#1; {32#false} is VALID [2022-02-20 14:24:58,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 14:24:58,055 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:58,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:58,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902149918] [2022-02-20 14:24:58,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902149918] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:58,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:58,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:24:58,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134817100] [2022-02-20 14:24:58,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:58,064 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:58,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:58,067 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:58,094 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:58,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:24:58,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:58,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:24:58,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:24:58,117 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:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:58,184 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2022-02-20 14:24:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:24:58,184 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:58,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:58,186 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:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 14:24:58,201 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:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 14:24:58,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2022-02-20 14:24:58,272 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:58,279 INFO L225 Difference]: With dead ends: 53 [2022-02-20 14:24:58,279 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 14:24:58,281 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:58,284 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:58,285 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:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 14:24:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 14:24:58,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:58,309 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:58,310 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:58,310 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:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:58,313 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 14:24:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:24:58,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:58,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:58,315 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:58,315 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:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:58,317 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 14:24:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:24:58,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:58,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:58,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:58,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:58,319 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:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-02-20 14:24:58,321 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-02-20 14:24:58,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:58,322 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-02-20 14:24:58,322 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:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 14:24:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:24:58,323 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:58,323 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:58,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:24:58,324 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:58,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1008571545, now seen corresponding path program 1 times [2022-02-20 14:24:58,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:58,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737883697] [2022-02-20 14:24:58,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:58,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:58,359 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:58,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139658462] [2022-02-20 14:24:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:58,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:58,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:58,407 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:58,411 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:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:24:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:58,632 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:58,632 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:58,633 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:58,633 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:58,634 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:58,634 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:58,635 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:58,636 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:58,637 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:58,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#false} main_~count~0#1 := 1; {184#false} is VALID [2022-02-20 14:24:58,637 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:58,638 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:58,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#false} ~cond := #in~cond; {184#false} is VALID [2022-02-20 14:24:58,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {184#false} assume !(0 == ~cond); {184#false} is VALID [2022-02-20 14:24:58,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {184#false} assume true; {184#false} is VALID [2022-02-20 14:24:58,639 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {184#false} {184#false} #84#return; {184#false} is VALID [2022-02-20 14:24:58,639 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:58,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {184#false} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3);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:58,639 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:58,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {184#false} assume 0 == main_~temp~0#1; {184#false} is VALID [2022-02-20 14:24:58,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {184#false} main_~count~0#1 := 0; {184#false} is VALID [2022-02-20 14:24:58,640 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:58,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {184#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 3 * main_~sum~0#1 <= 2 + ~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:58,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {184#false} assume 0 == __VERIFIER_assert_~cond#1; {184#false} is VALID [2022-02-20 14:24:58,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-02-20 14:24:58,641 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:58,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:58,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:58,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737883697] [2022-02-20 14:24:58,642 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:58,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139658462] [2022-02-20 14:24:58,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139658462] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:58,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:58,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 14:24:58,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065540426] [2022-02-20 14:24:58,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:58,650 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:58,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:58,651 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:58,674 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:58,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 14:24:58,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:58,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 14:24:58,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 14:24:58,678 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:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:58,856 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-02-20 14:24:58,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:24:58,857 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:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:58,858 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:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-02-20 14:24:58,860 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:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-02-20 14:24:58,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2022-02-20 14:24:58,909 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:58,910 INFO L225 Difference]: With dead ends: 50 [2022-02-20 14:24:58,910 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 14:24:58,911 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:58,913 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.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:58,914 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.1s Time] [2022-02-20 14:24:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 14:24:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-02-20 14:24:58,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:58,927 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:58,929 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:58,930 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:58,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:58,934 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 14:24:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 14:24:58,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:58,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:58,935 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:58,935 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:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:58,937 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 14:24:58,937 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 14:24:58,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:58,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:58,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:58,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:58,939 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:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-20 14:24:58,940 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-02-20 14:24:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:58,940 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-20 14:24:58,940 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:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 14:24:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:24:58,942 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:58,943 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:58,966 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:59,162 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:59,165 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:59,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:59,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1890411897, now seen corresponding path program 1 times [2022-02-20 14:24:59,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:59,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718922257] [2022-02-20 14:24:59,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:59,212 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:59,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [412637464] [2022-02-20 14:24:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:59,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:59,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:59,224 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:59,225 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:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:59,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-20 14:24:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:59,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:59,389 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:59,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:59,515 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:59,526 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:00,075 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:25:00,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:25:00,358 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:25:00,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:25:00,848 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:25:01,080 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:25:01,080 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:25:01,080 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:25:01,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {435#true} ~cond := #in~cond; {435#true} is VALID [2022-02-20 14:25:01,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {435#true} assume !(0 == ~cond); {435#true} is VALID [2022-02-20 14:25:01,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {435#true} assume true; {435#true} is VALID [2022-02-20 14:25:01,081 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {435#true} {435#true} #82#return; {435#true} is VALID [2022-02-20 14:25:01,086 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:25:01,087 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:25:01,088 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:25:01,088 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:25:01,090 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:25:01,091 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:25:01,093 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:25:01,093 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:25:01,094 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:25:01,095 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:25:01,097 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:25:01,099 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:25:01,100 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 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3);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:25:01,102 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:25:01,103 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:25:01,104 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:25:01,105 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:25:01,106 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:25:01,106 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:25:01,107 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 3 * main_~sum~0#1 <= 2 + ~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:25:01,107 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:25:01,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {436#false} assume !false; {436#false} is VALID [2022-02-20 14:25:01,108 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:25:01,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:01,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:01,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718922257] [2022-02-20 14:25:01,881 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:01,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412637464] [2022-02-20 14:25:01,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412637464] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:25:01,881 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:25:01,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-02-20 14:25:01,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061658133] [2022-02-20 14:25:01,882 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:01,882 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,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:01,883 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:01,922 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:01,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 14:25:01,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:01,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 14:25:01,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-02-20 14:25:01,924 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:02,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:02,576 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-02-20 14:25:02,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 14:25:02,576 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:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:02,576 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:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2022-02-20 14:25:02,578 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:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2022-02-20 14:25:02,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 75 transitions. [2022-02-20 14:25:02,643 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:02,644 INFO L225 Difference]: With dead ends: 70 [2022-02-20 14:25:02,644 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 14:25:02,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2022-02-20 14:25:02,645 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:02,646 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:02,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 14:25:02,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-02-20 14:25:02,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:02,677 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:02,678 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:02,678 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:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:02,680 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-02-20 14:25:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-02-20 14:25:02,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:02,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:02,681 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:02,681 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:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:02,684 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-02-20 14:25:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-02-20 14:25:02,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:02,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:02,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:02,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:02,685 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:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-02-20 14:25:02,687 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 29 [2022-02-20 14:25:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:02,688 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-02-20 14:25:02,688 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:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-02-20 14:25:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:25:02,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:02,689 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,707 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:02,905 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:02,905 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:02,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:02,906 INFO L85 PathProgramCache]: Analyzing trace with hash -32099493, now seen corresponding path program 2 times [2022-02-20 14:25:02,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:02,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699288108] [2022-02-20 14:25:02,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:02,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:02,925 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:02,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759449537] [2022-02-20 14:25:02,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:25:02,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:02,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:02,929 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:02,932 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:02,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:25:02,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:02,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:25:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:02,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:03,158 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:03,158 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:03,159 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:03,159 INFO L290 TraceCheckUtils]: 3: Hoare triple {841#true} ~cond := #in~cond; {841#true} is VALID [2022-02-20 14:25:03,159 INFO L290 TraceCheckUtils]: 4: Hoare triple {841#true} assume !(0 == ~cond); {841#true} is VALID [2022-02-20 14:25:03,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {841#true} assume true; {841#true} is VALID [2022-02-20 14:25:03,159 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {841#true} {841#true} #82#return; {841#true} is VALID [2022-02-20 14:25:03,160 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:03,160 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:03,161 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:03,161 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:03,162 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:03,162 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:03,163 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:03,163 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:03,164 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:03,164 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:03,164 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:03,165 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:03,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {878#(<= ~ARR_SIZE~0 1)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3);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:03,166 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:03,166 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:03,166 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:03,167 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:03,168 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:03,168 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:03,168 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:03,169 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:03,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {842#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 3 * main_~sum~0#1 <= 2 + ~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:03,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {842#false} assume 0 == __VERIFIER_assert_~cond#1; {842#false} is VALID [2022-02-20 14:25:03,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {842#false} assume !false; {842#false} is VALID [2022-02-20 14:25:03,169 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:03,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:03,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {842#false} assume !false; {842#false} is VALID [2022-02-20 14:25:03,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {842#false} assume 0 == __VERIFIER_assert_~cond#1; {842#false} is VALID [2022-02-20 14:25:03,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {842#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 3 * main_~sum~0#1 <= 2 + ~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:03,301 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:03,301 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:03,301 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:03,302 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:03,302 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:03,303 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:03,303 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:03,304 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:03,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {878#(<= ~ARR_SIZE~0 1)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3);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:03,304 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:03,305 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:03,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#true} assume true; {841#true} is VALID [2022-02-20 14:25:03,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {841#true} assume !(0 == ~cond); {841#true} is VALID [2022-02-20 14:25:03,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {841#true} ~cond := #in~cond; {841#true} is VALID [2022-02-20 14:25:03,306 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:03,306 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:03,306 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:03,307 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:03,308 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:03,308 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:03,309 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:03,309 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {841#true} {841#true} #82#return; {841#true} is VALID [2022-02-20 14:25:03,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {841#true} assume true; {841#true} is VALID [2022-02-20 14:25:03,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {841#true} assume !(0 == ~cond); {841#true} is VALID [2022-02-20 14:25:03,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {841#true} ~cond := #in~cond; {841#true} is VALID [2022-02-20 14:25:03,309 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:03,310 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:03,310 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:03,310 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:03,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:03,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699288108] [2022-02-20 14:25:03,311 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:03,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759449537] [2022-02-20 14:25:03,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759449537] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:03,311 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:25:03,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:25:03,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79060391] [2022-02-20 14:25:03,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:03,312 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,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:03,312 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,356 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,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:25:03,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:03,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:25:03,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:25:03,357 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:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:03,599 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-02-20 14:25:03,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 14:25:03,599 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,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:03,599 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,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-02-20 14:25:03,601 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,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-02-20 14:25:03,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 63 transitions. [2022-02-20 14:25:03,648 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:03,649 INFO L225 Difference]: With dead ends: 61 [2022-02-20 14:25:03,649 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 14:25:03,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:25:03,650 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:03,650 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:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 14:25:03,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-02-20 14:25:03,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:03,663 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:03,663 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:03,664 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:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:03,665 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-02-20 14:25:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-02-20 14:25:03,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:03,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:03,665 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:03,666 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:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:03,667 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-02-20 14:25:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-02-20 14:25:03,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:03,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:03,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:03,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:03,668 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:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-02-20 14:25:03,669 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 31 [2022-02-20 14:25:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:03,669 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-02-20 14:25:03,669 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,669 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 14:25:03,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:25:03,670 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:03,670 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:03,691 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:03,884 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:03,884 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:03,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:03,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1857874167, now seen corresponding path program 3 times [2022-02-20 14:25:03,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:03,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682496188] [2022-02-20 14:25:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:03,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:03,917 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:03,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342635398] [2022-02-20 14:25:03,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:25:03,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:03,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:03,931 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:03,932 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:04,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 14:25:04,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:04,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:25:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:04,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:04,186 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:04,186 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:04,186 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:04,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {1238#true} ~cond := #in~cond; {1238#true} is VALID [2022-02-20 14:25:04,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {1238#true} assume !(0 == ~cond); {1238#true} is VALID [2022-02-20 14:25:04,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-02-20 14:25:04,187 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1238#true} {1238#true} #82#return; {1238#true} is VALID [2022-02-20 14:25:04,187 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:04,188 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:04,188 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:04,189 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:04,189 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:04,190 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:04,190 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:04,191 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:04,191 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:04,191 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:04,192 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:04,192 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:04,193 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:04,193 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:04,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3);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:04,194 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:04,194 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:04,194 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:04,195 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:04,195 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:04,196 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:04,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {1239#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 3 * main_~sum~0#1 <= 2 + ~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:04,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {1239#false} assume 0 == __VERIFIER_assert_~cond#1; {1239#false} is VALID [2022-02-20 14:25:04,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {1239#false} assume !false; {1239#false} is VALID [2022-02-20 14:25:04,197 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:04,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:04,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {1239#false} assume !false; {1239#false} is VALID [2022-02-20 14:25:04,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {1239#false} assume 0 == __VERIFIER_assert_~cond#1; {1239#false} is VALID [2022-02-20 14:25:04,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {1239#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 3 * main_~sum~0#1 <= 2 + ~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:04,333 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:04,333 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:04,334 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:04,334 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:04,334 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:04,335 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:04,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {1275#(< 1 ~ARR_SIZE~0)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3);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:04,335 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:04,336 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:04,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-02-20 14:25:04,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {1238#true} assume !(0 == ~cond); {1238#true} is VALID [2022-02-20 14:25:04,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {1238#true} ~cond := #in~cond; {1238#true} is VALID [2022-02-20 14:25:04,337 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:04,337 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:04,337 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:04,338 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:04,338 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:04,339 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:04,339 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:04,340 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:04,340 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:04,340 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1238#true} {1238#true} #82#return; {1238#true} is VALID [2022-02-20 14:25:04,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {1238#true} assume true; {1238#true} is VALID [2022-02-20 14:25:04,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {1238#true} assume !(0 == ~cond); {1238#true} is VALID [2022-02-20 14:25:04,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {1238#true} ~cond := #in~cond; {1238#true} is VALID [2022-02-20 14:25:04,341 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:04,341 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:04,341 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:04,342 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:04,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:04,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682496188] [2022-02-20 14:25:04,342 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:04,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342635398] [2022-02-20 14:25:04,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342635398] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:04,342 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:25:04,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:25:04,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187415672] [2022-02-20 14:25:04,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:04,343 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:04,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:04,344 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:04,370 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:04,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:25:04,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:04,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:25:04,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:25:04,371 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:04,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:04,609 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 14:25:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 14:25:04,609 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:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:04,610 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:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-02-20 14:25:04,611 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:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-02-20 14:25:04,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-02-20 14:25:04,645 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:04,646 INFO L225 Difference]: With dead ends: 39 [2022-02-20 14:25:04,646 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 14:25:04,646 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:04,647 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:04,647 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:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 14:25:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-02-20 14:25:04,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:04,669 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:04,669 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:04,670 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:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:04,671 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-02-20 14:25:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-02-20 14:25:04,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:04,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:04,671 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:04,672 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:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:04,673 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-02-20 14:25:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-02-20 14:25:04,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:04,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:04,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:04,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:04,673 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:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-02-20 14:25:04,674 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 31 [2022-02-20 14:25:04,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:04,675 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-02-20 14:25:04,675 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:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-02-20 14:25:04,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:25:04,676 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:04,676 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:04,694 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:04,891 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:04,891 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:04,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1236086951, now seen corresponding path program 4 times [2022-02-20 14:25:04,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:04,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221238725] [2022-02-20 14:25:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:04,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:04,928 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:04,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079573985] [2022-02-20 14:25:04,928 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:25:04,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:04,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:04,930 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:04,970 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:05,014 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:25:05,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:05,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 56 conjunts are in the unsatisfiable core [2022-02-20 14:25:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:05,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:05,066 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:05,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:05,119 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:05,130 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:05,247 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 14:25:05,248 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 1 case distinctions, treesize of input 47 treesize of output 33 [2022-02-20 14:25:06,974 INFO L356 Elim1Store]: treesize reduction 35, result has 30.0 percent of original size [2022-02-20 14:25:06,975 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 52 [2022-02-20 14:25:07,611 INFO L356 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-02-20 14:25:07,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 59 [2022-02-20 14:25:08,569 INFO L356 Elim1Store]: treesize reduction 174, result has 7.0 percent of original size [2022-02-20 14:25:08,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 82 treesize of output 32 [2022-02-20 14:25:08,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:08,920 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:08,920 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:08,920 INFO L290 TraceCheckUtils]: 3: Hoare triple {1604#true} ~cond := #in~cond; {1604#true} is VALID [2022-02-20 14:25:08,920 INFO L290 TraceCheckUtils]: 4: Hoare triple {1604#true} assume !(0 == ~cond); {1604#true} is VALID [2022-02-20 14:25:08,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {1604#true} assume true; {1604#true} is VALID [2022-02-20 14:25:08,920 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1604#true} {1604#true} #82#return; {1604#true} is VALID [2022-02-20 14:25:08,921 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 (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:08,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {1630#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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 (<= |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_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:08,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {1634#(and (<= |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_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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_~count~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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:08,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {1638#(and (= |ULTIMATE.start_main_~count~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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); {1642#(and (= |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| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~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:08,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {1642#(and (= |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| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~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; {1646#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~count~0#1| 2) (<= |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) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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:08,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {1646#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_~count~0#1| 2) (<= |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) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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); {1650#(and (<= (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) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {1650#(and (<= (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) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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|)) (<= ~ARR_SIZE~0 2))} main_~count~0#1 := 1; {1654#(and (<= (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) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#(and (<= (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) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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|)) (<= ~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; {1654#(and (<= (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) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,928 INFO L272 TraceCheckUtils]: 15: Hoare triple {1654#(and (<= (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) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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|)) (<= ~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)); {1661#(and (exists ((|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 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|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| 4)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 4)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2|) 0))) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {1661#(and (exists ((|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 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|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| 4)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 4)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2|) 0))) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} ~cond := #in~cond; {1665#(and (exists ((|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 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|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| 4)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 4)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2|) 0))) (< 1 ~ARR_SIZE~0) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {1665#(and (exists ((|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 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|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| 4)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 4)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2|) 0))) (< 1 ~ARR_SIZE~0) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (<= ~ARR_SIZE~0 2))} assume !(0 == ~cond); {1669#(and (exists ((|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 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|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| 4)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 4)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2|) 0))) (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {1669#(and (exists ((|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 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|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| 4)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 4)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2|) 0))) (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} assume true; {1669#(and (exists ((|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 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|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| 4)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 4)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2|) 0))) (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,932 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1669#(and (exists ((|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 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|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2| 4)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_2| 4)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_2|) 0))) (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 2))} {1654#(and (<= (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) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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|)) (<= ~ARR_SIZE~0 2))} #84#return; {1676#(and (<= (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) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {1676#(and (<= (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) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 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|)) (<= ~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); {1680#(and (<= (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) (<= (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) (<= (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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {1680#(and (<= (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) (<= (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) (<= (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|)) (<= ~ARR_SIZE~0 2))} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3);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 (<= (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|) (= (mod |ULTIMATE.start_main_~index~0#1| 3) 0) (< 1 ~ARR_SIZE~0) (<= |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)) 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) (<= (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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {1684#(and (<= (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|) (= (mod |ULTIMATE.start_main_~index~0#1| 3) 0) (< 1 ~ARR_SIZE~0) (<= |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)) 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) (<= (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|)) (<= ~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; {1688#(and (<= (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) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= (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| 12))) 1) (<= (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| 12))) 0) (<= 0 (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (< (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~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) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {1688#(and (<= (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) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= (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| 12))) 1) (<= (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| 12))) 0) (<= 0 (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (< (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~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) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= ~ARR_SIZE~0 2))} assume 0 == main_~temp~0#1; {1688#(and (<= (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) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= (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| 12))) 1) (<= (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| 12))) 0) (<= 0 (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (< (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~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) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {1688#(and (<= (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) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= (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| 12))) 1) (<= (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| 12))) 0) (<= 0 (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (< (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~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) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= ~ARR_SIZE~0 2))} main_~count~0#1 := 0; {1695#(and (<= (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) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= (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| 12))) 1) (<= (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| 12))) 0) (<= 0 (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (< (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0))) (< 1 ~ARR_SIZE~0) (= |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| 4)) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {1695#(and (<= (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) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= (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| 12))) 1) (<= (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| 12))) 0) (<= 0 (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (< (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0))) (< 1 ~ARR_SIZE~0) (= |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| 4)) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= ~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; {1699#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= (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| 12))) 1) (<= (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| 12))) 0) (<= 0 (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (< (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0))) (< 1 ~ARR_SIZE~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) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {1699#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= (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| 12))) 1) (<= (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| 12))) 0) (<= 0 (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (< (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0))) (< 1 ~ARR_SIZE~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) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= ~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; {1703#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= (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| 12))) 1) (<= (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| 12))) 0) (<= 0 (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (< (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0))) (< 1 ~ARR_SIZE~0) (= (+ (- 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| 4)) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= ~ARR_SIZE~0 2) (<= |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:08,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {1703#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (exists ((|aux_div_ULTIMATE.start_main_~index~0#1_40| Int)) (and (<= (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| 12))) 1) (<= (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| 12))) 0) (<= 0 (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|)) (< (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0))) (< 1 ~ARR_SIZE~0) (= (+ (- 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| 4)) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)) (<= ~ARR_SIZE~0 2) (<= |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 (= |ULTIMATE.start_main_~count~0#1| 1) (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {1707#(and (= |ULTIMATE.start_main_~count~0#1| 1) (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 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; {1711#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:08,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {1711#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} 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:08,947 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 3 * main_~sum~0#1 <= 2 + ~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:08,947 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:08,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {1605#false} assume !false; {1605#false} is VALID [2022-02-20 14:25:08,947 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:08,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:21,783 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:21,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221238725] [2022-02-20 14:25:21,784 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:21,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079573985] [2022-02-20 14:25:21,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079573985] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:25:21,784 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:25:21,784 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-02-20 14:25:21,784 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887693448] [2022-02-20 14:25:21,784 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:21,784 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:21,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:21,785 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:21,827 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:21,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-20 14:25:21,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:21,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-20 14:25:21,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=927, Unknown=5, NotChecked=0, Total=1122 [2022-02-20 14:25:21,828 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:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:22,851 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2022-02-20 14:25:22,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-20 14:25:22,851 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:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:22,852 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:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 71 transitions. [2022-02-20 14:25:22,853 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:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 71 transitions. [2022-02-20 14:25:22,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 71 transitions. [2022-02-20 14:25:22,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:22,933 INFO L225 Difference]: With dead ends: 68 [2022-02-20 14:25:22,933 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 14:25:22,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=264, Invalid=1213, Unknown=5, NotChecked=0, Total=1482 [2022-02-20 14:25:22,934 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:22,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 207 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 156 Invalid, 0 Unknown, 111 Unchecked, 0.2s Time] [2022-02-20 14:25:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 14:25:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2022-02-20 14:25:23,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:23,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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:23,002 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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:23,002 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:23,005 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-02-20 14:25:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-02-20 14:25:23,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:23,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:23,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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 64 states. [2022-02-20 14:25:23,007 INFO L87 Difference]: Start difference. First operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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 64 states. [2022-02-20 14:25:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:23,009 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-02-20 14:25:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-02-20 14:25:23,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:23,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:23,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:23,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-02-20 14:25:23,012 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 33 [2022-02-20 14:25:23,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:23,013 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-02-20 14:25:23,013 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:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-02-20 14:25:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:25:23,013 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:23,014 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:23,034 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:23,231 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:23,232 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:23,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash -977921513, now seen corresponding path program 1 times [2022-02-20 14:25:23,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:23,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274852409] [2022-02-20 14:25:23,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:23,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:23,266 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:23,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807801683] [2022-02-20 14:25:23,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:23,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:23,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:23,272 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:23,275 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:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:23,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 61 conjunts are in the unsatisfiable core [2022-02-20 14:25:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:23,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:23,416 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:23,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:23,499 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:23,511 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:23,523 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:23,529 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:23,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:23,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:23,663 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 64 treesize of output 53 [2022-02-20 14:25:25,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:25,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:25,066 INFO L356 Elim1Store]: treesize reduction 42, result has 40.8 percent of original size [2022-02-20 14:25:25,066 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:26,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:26,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:26,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:26,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:25:26,599 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 0 case distinctions, treesize of input 56 treesize of output 55 [2022-02-20 14:25:30,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:30,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:25:30,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 22 [2022-02-20 14:25:31,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {2073#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; {2073#true} is VALID [2022-02-20 14:25:31,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {2073#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; {2073#true} is VALID [2022-02-20 14:25:31,041 INFO L272 TraceCheckUtils]: 2: Hoare triple {2073#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2073#true} is VALID [2022-02-20 14:25:31,041 INFO L290 TraceCheckUtils]: 3: Hoare triple {2073#true} ~cond := #in~cond; {2073#true} is VALID [2022-02-20 14:25:31,041 INFO L290 TraceCheckUtils]: 4: Hoare triple {2073#true} assume !(0 == ~cond); {2073#true} is VALID [2022-02-20 14:25:31,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {2073#true} assume true; {2073#true} is VALID [2022-02-20 14:25:31,042 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2073#true} {2073#true} #82#return; {2073#true} is VALID [2022-02-20 14:25:31,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {2073#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; {2099#(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:31,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {2099#(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); {2103#(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:31,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {2103#(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; {2107#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ (- 1) |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|)) (= (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:31,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {2107#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ (- 1) |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|)) (= (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); {2111#(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_~count~0#1|) 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|)) (= (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:31,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {2111#(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_~count~0#1|) 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|)) (= (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))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2115#(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_~count~0#1| 2) (<= |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:31,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {2115#(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_~count~0#1| 2) (<= |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); {2119#(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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {2119#(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|)) (<= ~ARR_SIZE~0 2))} main_~count~0#1 := 1; {2123#(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_~count~0#1| 1) (<= |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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {2123#(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_~count~0#1| 1) (<= |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|)) (<= ~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; {2123#(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_~count~0#1| 1) (<= |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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,050 INFO L272 TraceCheckUtils]: 15: Hoare triple {2123#(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_~count~0#1| 1) (<= |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|)) (<= ~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)); {2130#(and (< 1 ~ARR_SIZE~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 (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (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_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {2130#(and (< 1 ~ARR_SIZE~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 (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (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_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (<= ~ARR_SIZE~0 2))} ~cond := #in~cond; {2134#(and (< 1 ~ARR_SIZE~0) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (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 (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (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_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {2134#(and (< 1 ~ARR_SIZE~0) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (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 (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (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_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (<= ~ARR_SIZE~0 2))} assume !(0 == ~cond); {2138#(and (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~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 (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (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_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {2138#(and (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~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 (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (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_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (<= ~ARR_SIZE~0 2))} assume true; {2138#(and (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~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 (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (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_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,063 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2138#(and (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~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 (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_3|) 4) 0) (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_~#array1~0#1.base_BEFORE_CALL_3|) 0) 0))) (<= ~ARR_SIZE~0 2))} {2123#(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_~count~0#1| 1) (<= |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|)) (<= ~ARR_SIZE~0 2))} #84#return; {2145#(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_~count~0#1| 1) (<= |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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {2145#(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_~count~0#1| 1) (<= |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|)) (<= ~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); {2149#(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) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~count~0#1| 1) (<= |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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {2149#(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) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~count~0#1| 1) (<= |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|)) (<= ~ARR_SIZE~0 2))} assume !(0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3));main_#t~ite8#1 := main_~num~0#1 * main_~count~0#1; {2153#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_#t~ite8#1| 1) 0) (not (= (mod |ULTIMATE.start_main_~index~0#1| 3) 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) (= (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) (= |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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {2153#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_#t~ite8#1| 1) 0) (not (= (mod |ULTIMATE.start_main_~index~0#1| 3) 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) (= (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) (= |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|)) (<= ~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; {2157#(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|) (<= (+ (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 3) (<= (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) (< (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= 0 (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (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|) 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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {2157#(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|) (<= (+ (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 3) (<= (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) (< (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= 0 (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (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|) 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|)) (<= ~ARR_SIZE~0 2))} assume 0 == main_~temp~0#1; {2157#(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|) (<= (+ (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 3) (<= (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) (< (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= 0 (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (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|) 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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {2157#(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|) (<= (+ (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 3) (<= (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) (< (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= 0 (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (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|) 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|)) (<= ~ARR_SIZE~0 2))} main_~count~0#1 := 0; {2164#(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|) (<= (+ (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 3) (<= (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) (< (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= 0 (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)))) (= |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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {2164#(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|) (<= (+ (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 3) (<= (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) (< (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= 0 (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 0)))) (= |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|)) (<= ~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; {2168#(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|) (<= (+ (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 3) (<= (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) (< (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= 0 (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 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) (= (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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {2168#(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|) (<= (+ (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 3) (<= (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) (< (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= 0 (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (not (= |aux_mod_ULTIMATE.start_main_~index~0#1_40| 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) (= (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|)) (<= ~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; {2172#(and (<= |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_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (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|) (<= (+ (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 3) (<= (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) (< (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= 0 (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (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|) 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|)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {2172#(and (<= |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_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|))) (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |ULTIMATE.start_main_~count~0#1| 1) (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|) (<= (+ (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_40| 3) (<= (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| 12) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_40|))) 1) (< (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|) ~ARR_SIZE~0) (<= 0 (+ (* 3 |aux_div_ULTIMATE.start_main_~index~0#1_40|) |aux_mod_ULTIMATE.start_main_~index~0#1_40|)) (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|) 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|)) (<= ~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; {2176#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ (div (+ (- 2) ~ARR_SIZE~0) 3) 1)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {2176#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ (div (+ (- 2) ~ARR_SIZE~0) 3) 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; {2176#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ (div (+ (- 2) ~ARR_SIZE~0) 3) 1)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {2176#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ (div (+ (- 2) ~ARR_SIZE~0) 3) 1)) (<= ~ARR_SIZE~0 2))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2176#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ (div (+ (- 2) ~ARR_SIZE~0) 3) 1)) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:31,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {2176#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ (div (+ (- 2) ~ARR_SIZE~0) 3) 1)) (<= ~ARR_SIZE~0 2))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 3 * main_~sum~0#1 <= 2 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2186#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:25:31,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {2186#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2074#false} is VALID [2022-02-20 14:25:31,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {2074#false} assume !false; {2074#false} is VALID [2022-02-20 14:25:31,088 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:31,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:45,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:45,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274852409] [2022-02-20 14:25:45,505 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:45,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807801683] [2022-02-20 14:25:45,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807801683] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:25:45,505 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:25:45,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-02-20 14:25:45,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362798052] [2022-02-20 14:25:45,506 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:45,506 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 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:45,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:45,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:25:45,568 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:45,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 14:25:45,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:45,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 14:25:45,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=716, Unknown=9, NotChecked=0, Total=870 [2022-02-20 14:25:45,569 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:25:48,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:48,577 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-02-20 14:25:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 14:25:48,577 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 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:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:25:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2022-02-20 14:25:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:25:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2022-02-20 14:25:48,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 72 transitions. [2022-02-20 14:25:48,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:48,675 INFO L225 Difference]: With dead ends: 73 [2022-02-20 14:25:48,676 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 14:25:48,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=204, Invalid=1044, Unknown=12, NotChecked=0, Total=1260 [2022-02-20 14:25:48,676 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:48,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 240 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 164 Invalid, 0 Unknown, 182 Unchecked, 0.3s Time] [2022-02-20 14:25:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 14:25:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2022-02-20 14:25:48,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:48,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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:48,760 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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:48,760 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:48,771 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-02-20 14:25:48,771 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-02-20 14:25:48,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:48,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:48,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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 69 states. [2022-02-20 14:25:48,772 INFO L87 Difference]: Start difference. First operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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 69 states. [2022-02-20 14:25:48,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:48,783 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-02-20 14:25:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-02-20 14:25:48,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:48,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:48,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:48,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-02-20 14:25:48,796 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 33 [2022-02-20 14:25:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:48,796 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-02-20 14:25:48,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:25:48,797 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-02-20 14:25:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 14:25:48,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:48,797 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:48,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 14:25:49,013 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:49,014 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:49,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:49,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1879614779, now seen corresponding path program 5 times [2022-02-20 14:25:49,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:49,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499329881] [2022-02-20 14:25:49,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:49,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:49,049 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:49,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [553823931] [2022-02-20 14:25:49,057 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:25:49,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:49,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:49,059 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:49,059 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:49,151 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-02-20 14:25:49,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:49,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:25:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:49,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:49,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {2556#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; {2556#true} is VALID [2022-02-20 14:25:49,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {2556#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; {2556#true} is VALID [2022-02-20 14:25:49,369 INFO L272 TraceCheckUtils]: 2: Hoare triple {2556#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2556#true} is VALID [2022-02-20 14:25:49,369 INFO L290 TraceCheckUtils]: 3: Hoare triple {2556#true} ~cond := #in~cond; {2556#true} is VALID [2022-02-20 14:25:49,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {2556#true} assume !(0 == ~cond); {2556#true} is VALID [2022-02-20 14:25:49,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {2556#true} assume true; {2556#true} is VALID [2022-02-20 14:25:49,370 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2556#true} {2556#true} #82#return; {2556#true} is VALID [2022-02-20 14:25:49,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {2556#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; {2582#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:49,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {2582#(<= |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); {2582#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:49,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {2582#(<= |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; {2589#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:49,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {2589#(<= |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); {2589#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:49,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {2589#(<= |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; {2596#(<= |ULTIMATE.start_main_~count~0#1| 2)} is VALID [2022-02-20 14:25:49,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {2596#(<= |ULTIMATE.start_main_~count~0#1| 2)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {2600#(<= ~ARR_SIZE~0 2)} main_~count~0#1 := 1; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {2600#(<= ~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; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,375 INFO L272 TraceCheckUtils]: 15: Hoare triple {2600#(<= ~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)); {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {2600#(<= ~ARR_SIZE~0 2)} ~cond := #in~cond; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {2600#(<= ~ARR_SIZE~0 2)} assume !(0 == ~cond); {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {2600#(<= ~ARR_SIZE~0 2)} assume true; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,377 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2600#(<= ~ARR_SIZE~0 2)} {2600#(<= ~ARR_SIZE~0 2)} #84#return; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {2600#(<= ~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); {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {2600#(<= ~ARR_SIZE~0 2)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3);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; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {2600#(<= ~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; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {2600#(<= ~ARR_SIZE~0 2)} assume 0 == main_~temp~0#1; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {2600#(<= ~ARR_SIZE~0 2)} main_~count~0#1 := 0; {2637#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:49,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {2637#(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; {2637#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:49,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {2637#(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; {2644#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:49,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {2644#(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; {2644#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:49,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {2644#(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; {2651#(and (<= 2 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:25:49,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {2651#(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; {2557#false} is VALID [2022-02-20 14:25:49,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {2557#false} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2557#false} is VALID [2022-02-20 14:25:49,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {2557#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2557#false} is VALID [2022-02-20 14:25:49,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {2557#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 3 * main_~sum~0#1 <= 2 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2557#false} is VALID [2022-02-20 14:25:49,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {2557#false} assume 0 == __VERIFIER_assert_~cond#1; {2557#false} is VALID [2022-02-20 14:25:49,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {2557#false} assume !false; {2557#false} is VALID [2022-02-20 14:25:49,384 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:49,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:49,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {2557#false} assume !false; {2557#false} is VALID [2022-02-20 14:25:49,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {2557#false} assume 0 == __VERIFIER_assert_~cond#1; {2557#false} is VALID [2022-02-20 14:25:49,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {2557#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 3 * main_~sum~0#1 <= 2 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2557#false} is VALID [2022-02-20 14:25:49,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {2557#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2557#false} is VALID [2022-02-20 14:25:49,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {2557#false} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2557#false} is VALID [2022-02-20 14:25:49,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {2685#(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; {2557#false} is VALID [2022-02-20 14:25:49,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {2689#(<= ~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; {2685#(not (< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:49,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {2689#(<= ~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; {2689#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:25:49,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {2696#(<= ~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; {2689#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:25:49,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {2696#(<= ~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; {2696#(<= ~ARR_SIZE~0 (+ 2 |ULTIMATE.start_main_~count~0#1|))} is VALID [2022-02-20 14:25:49,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {2600#(<= ~ARR_SIZE~0 2)} main_~count~0#1 := 0; {2696#(<= ~ARR_SIZE~0 (+ 2 |ULTIMATE.start_main_~count~0#1|))} is VALID [2022-02-20 14:25:49,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {2600#(<= ~ARR_SIZE~0 2)} assume 0 == main_~temp~0#1; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {2600#(<= ~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; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {2600#(<= ~ARR_SIZE~0 2)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3);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; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {2600#(<= ~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); {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,561 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2556#true} {2600#(<= ~ARR_SIZE~0 2)} #84#return; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {2556#true} assume true; {2556#true} is VALID [2022-02-20 14:25:49,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {2556#true} assume !(0 == ~cond); {2556#true} is VALID [2022-02-20 14:25:49,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {2556#true} ~cond := #in~cond; {2556#true} is VALID [2022-02-20 14:25:49,562 INFO L272 TraceCheckUtils]: 15: Hoare triple {2600#(<= ~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)); {2556#true} is VALID [2022-02-20 14:25:49,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {2600#(<= ~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; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {2600#(<= ~ARR_SIZE~0 2)} main_~count~0#1 := 1; {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {2596#(<= |ULTIMATE.start_main_~count~0#1| 2)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2600#(<= ~ARR_SIZE~0 2)} is VALID [2022-02-20 14:25:49,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {2589#(<= |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; {2596#(<= |ULTIMATE.start_main_~count~0#1| 2)} is VALID [2022-02-20 14:25:49,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {2589#(<= |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); {2589#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:49,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {2582#(<= |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; {2589#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:25:49,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {2582#(<= |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); {2582#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:49,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {2556#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; {2582#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:25:49,572 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2556#true} {2556#true} #82#return; {2556#true} is VALID [2022-02-20 14:25:49,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {2556#true} assume true; {2556#true} is VALID [2022-02-20 14:25:49,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {2556#true} assume !(0 == ~cond); {2556#true} is VALID [2022-02-20 14:25:49,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {2556#true} ~cond := #in~cond; {2556#true} is VALID [2022-02-20 14:25:49,572 INFO L272 TraceCheckUtils]: 2: Hoare triple {2556#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2556#true} is VALID [2022-02-20 14:25:49,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {2556#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; {2556#true} is VALID [2022-02-20 14:25:49,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {2556#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; {2556#true} is VALID [2022-02-20 14:25:49,573 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:49,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:49,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499329881] [2022-02-20 14:25:49,574 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:49,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553823931] [2022-02-20 14:25:49,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553823931] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:49,574 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:25:49,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-02-20 14:25:49,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984851438] [2022-02-20 14:25:49,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:49,575 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:49,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:49,575 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:49,606 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:49,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:25:49,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:49,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:25:49,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:25:49,607 INFO L87 Difference]: Start difference. First operand 50 states and 56 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:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:50,084 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-02-20 14:25:50,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 14:25:50,085 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:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:50,086 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:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2022-02-20 14:25:50,098 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:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2022-02-20 14:25:50,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2022-02-20 14:25:50,168 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:50,169 INFO L225 Difference]: With dead ends: 87 [2022-02-20 14:25:50,169 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 14:25:50,170 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:50,170 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 62 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:50,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 127 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:25:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 14:25:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2022-02-20 14:25:50,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:50,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 63 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 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,259 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 63 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 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,266 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 63 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 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,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:50,269 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-02-20 14:25:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-02-20 14:25:50,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:50,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:50,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 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 75 states. [2022-02-20 14:25:50,273 INFO L87 Difference]: Start difference. First operand has 63 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 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 75 states. [2022-02-20 14:25:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:50,275 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-02-20 14:25:50,275 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-02-20 14:25:50,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:50,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:50,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:50,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:50,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 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,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-02-20 14:25:50,278 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 35 [2022-02-20 14:25:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:50,279 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-02-20 14:25:50,280 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:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-02-20 14:25:50,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 14:25:50,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:50,281 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,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-20 14:25:50,505 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:50,506 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:50,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1373135831, now seen corresponding path program 6 times [2022-02-20 14:25:50,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:50,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104651327] [2022-02-20 14:25:50,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:50,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:50,533 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:50,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [163182652] [2022-02-20 14:25:50,542 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 14:25:50,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:50,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:50,544 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:50,545 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:50,640 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-02-20 14:25:50,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:50,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:25:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:50,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:50,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {3129#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; {3129#true} is VALID [2022-02-20 14:25:50,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#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; {3129#true} is VALID [2022-02-20 14:25:50,838 INFO L272 TraceCheckUtils]: 2: Hoare triple {3129#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {3129#true} is VALID [2022-02-20 14:25:50,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {3129#true} ~cond := #in~cond; {3129#true} is VALID [2022-02-20 14:25:50,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {3129#true} assume !(0 == ~cond); {3129#true} is VALID [2022-02-20 14:25:50,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-02-20 14:25:50,839 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3129#true} {3129#true} #82#return; {3129#true} is VALID [2022-02-20 14:25:50,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#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; {3155#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:50,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {3155#(<= 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); {3155#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:50,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {3155#(<= 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; {3162#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:50,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {3162#(<= 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); {3162#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:50,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {3162#(<= 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; {3169#(<= 2 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:50,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {3169#(<= 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); {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {3173#(< 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; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {3173#(< 2 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {3173#(< 2 ~ARR_SIZE~0)} main_~count~0#1 := 1; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {3173#(< 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; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,844 INFO L272 TraceCheckUtils]: 17: Hoare triple {3173#(< 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)); {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {3173#(< 2 ~ARR_SIZE~0)} ~cond := #in~cond; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {3173#(< 2 ~ARR_SIZE~0)} assume !(0 == ~cond); {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {3173#(< 2 ~ARR_SIZE~0)} assume true; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,846 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3173#(< 2 ~ARR_SIZE~0)} {3173#(< 2 ~ARR_SIZE~0)} #84#return; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {3173#(< 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); {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {3173#(< 2 ~ARR_SIZE~0)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3);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; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {3173#(< 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; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {3173#(< 2 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {3173#(< 2 ~ARR_SIZE~0)} main_~count~0#1 := 0; {3216#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:25:50,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {3216#(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; {3216#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:25:50,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {3216#(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; {3223#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:50,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {3223#(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; {3223#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:50,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {3223#(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; {3230#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:50,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {3230#(and (<= |ULTIMATE.start_main_~count~0#1| 2) (< 2 ~ARR_SIZE~0))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {3130#false} is VALID [2022-02-20 14:25:50,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {3130#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 3 * main_~sum~0#1 <= 2 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3130#false} is VALID [2022-02-20 14:25:50,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {3130#false} assume 0 == __VERIFIER_assert_~cond#1; {3130#false} is VALID [2022-02-20 14:25:50,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-02-20 14:25:50,852 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:50,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:50,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-02-20 14:25:50,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {3130#false} assume 0 == __VERIFIER_assert_~cond#1; {3130#false} is VALID [2022-02-20 14:25:50,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {3130#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 3 * main_~sum~0#1 <= 2 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3130#false} is VALID [2022-02-20 14:25:50,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {3252#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {3130#false} is VALID [2022-02-20 14:25:50,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {3256#(< (+ |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; {3252#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {3256#(< (+ |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; {3256#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {3263#(< (+ 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; {3256#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {3263#(< (+ 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; {3263#(< (+ 2 |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {3173#(< 2 ~ARR_SIZE~0)} main_~count~0#1 := 0; {3263#(< (+ 2 |ULTIMATE.start_main_~count~0#1|) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {3173#(< 2 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {3173#(< 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; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {3173#(< 2 ~ARR_SIZE~0)} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3);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; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {3173#(< 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); {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,980 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3129#true} {3173#(< 2 ~ARR_SIZE~0)} #84#return; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-02-20 14:25:50,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {3129#true} assume !(0 == ~cond); {3129#true} is VALID [2022-02-20 14:25:50,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {3129#true} ~cond := #in~cond; {3129#true} is VALID [2022-02-20 14:25:50,981 INFO L272 TraceCheckUtils]: 17: Hoare triple {3173#(< 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)); {3129#true} is VALID [2022-02-20 14:25:50,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {3173#(< 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; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {3173#(< 2 ~ARR_SIZE~0)} main_~count~0#1 := 1; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {3173#(< 2 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {3173#(< 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; {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {3169#(<= 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); {3173#(< 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:50,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {3162#(<= 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; {3169#(<= 2 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:50,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {3162#(<= 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); {3162#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:50,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {3155#(<= 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; {3162#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:50,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {3155#(<= 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); {3155#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:50,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#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; {3155#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:50,988 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3129#true} {3129#true} #82#return; {3129#true} is VALID [2022-02-20 14:25:50,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-02-20 14:25:50,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {3129#true} assume !(0 == ~cond); {3129#true} is VALID [2022-02-20 14:25:50,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {3129#true} ~cond := #in~cond; {3129#true} is VALID [2022-02-20 14:25:50,989 INFO L272 TraceCheckUtils]: 2: Hoare triple {3129#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {3129#true} is VALID [2022-02-20 14:25:50,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#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; {3129#true} is VALID [2022-02-20 14:25:50,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {3129#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; {3129#true} is VALID [2022-02-20 14:25:50,989 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:50,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:50,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104651327] [2022-02-20 14:25:50,990 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:50,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163182652] [2022-02-20 14:25:50,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163182652] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:50,990 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:25:50,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-02-20 14:25:50,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321891138] [2022-02-20 14:25:50,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:50,991 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:50,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:50,992 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,022 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,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:25:51,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:51,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:25:51,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:25:51,023 INFO L87 Difference]: Start difference. First operand 63 states and 70 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,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:51,520 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-02-20 14:25:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:25:51,520 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,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:51,521 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,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-02-20 14:25:51,529 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,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-02-20 14:25:51,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-02-20 14:25:51,593 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:51,594 INFO L225 Difference]: With dead ends: 74 [2022-02-20 14:25:51,594 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 14:25:51,595 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:51,597 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 65 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:51,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 116 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:25:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 14:25:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-02-20 14:25:51,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:51,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 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:51,683 INFO L74 IsIncluded]: Start isIncluded. First operand 70 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:51,684 INFO L87 Difference]: Start difference. First operand 70 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:51,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:51,685 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-02-20 14:25:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-02-20 14:25:51,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:51,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:51,686 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 70 states. [2022-02-20 14:25:51,687 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 70 states. [2022-02-20 14:25:51,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:51,688 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-02-20 14:25:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-02-20 14:25:51,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:51,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:51,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:51,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:51,690 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:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-02-20 14:25:51,691 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 35 [2022-02-20 14:25:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:51,691 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-02-20 14:25:51,691 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,691 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-02-20 14:25:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 14:25:51,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:51,692 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:51,715 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:51,911 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:51,911 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:51,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:51,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1081807417, now seen corresponding path program 7 times [2022-02-20 14:25:51,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:51,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821822228] [2022-02-20 14:25:51,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:51,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:51,949 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:51,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1997544365] [2022-02-20 14:25:51,950 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 14:25:51,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:51,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:51,951 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:51,952 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:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:52,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-20 14:25:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:52,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:52,085 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:52,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:52,164 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:52,181 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:52,195 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 27 treesize of output 26 [2022-02-20 14:25:52,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:52,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:52,354 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 64 treesize of output 53 [2022-02-20 14:25:52,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:52,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:52,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:52,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:52,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:52,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:52,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 63 [2022-02-20 14:25:54,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,045 INFO L356 Elim1Store]: treesize reduction 66, result has 40.0 percent of original size [2022-02-20 14:25:54,045 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:54,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:54,390 INFO L356 Elim1Store]: treesize reduction 164, result has 13.7 percent of original size [2022-02-20 14:25:54,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 103 treesize of output 112 [2022-02-20 14:25:55,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 49 [2022-02-20 14:25:55,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {3684#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; {3684#true} is VALID [2022-02-20 14:25:55,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {3684#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; {3684#true} is VALID [2022-02-20 14:25:55,877 INFO L272 TraceCheckUtils]: 2: Hoare triple {3684#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {3684#true} is VALID [2022-02-20 14:25:55,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {3684#true} ~cond := #in~cond; {3684#true} is VALID [2022-02-20 14:25:55,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {3684#true} assume !(0 == ~cond); {3684#true} is VALID [2022-02-20 14:25:55,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {3684#true} assume true; {3684#true} is VALID [2022-02-20 14:25:55,877 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3684#true} {3684#true} #82#return; {3684#true} is VALID [2022-02-20 14:25:55,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {3684#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; {3710#(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:25:55,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {3710#(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); {3714#(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:25:55,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {3714#(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; {3718#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (+ (- 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|)) (<= (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:55,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {3718#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (+ (- 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|)) (<= (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); {3722#(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|) (= (+ (- 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|)) (<= (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:55,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {3722#(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|) (= (+ (- 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|)) (<= (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))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3726#(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|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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|)))} is VALID [2022-02-20 14:25:55,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {3726#(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|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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|)))} 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); {3730#(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|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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| 8)) 0))} is VALID [2022-02-20 14:25:55,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {3730#(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|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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| 8)) 0))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3730#(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|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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| 8)) 0))} is VALID [2022-02-20 14:25:55,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {3730#(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|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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| 8)) 0))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {3730#(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|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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| 8)) 0))} is VALID [2022-02-20 14:25:55,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {3730#(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|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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| 8)) 0))} main_~count~0#1 := 1; {3740#(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) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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| 8)) 0))} is VALID [2022-02-20 14:25:55,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {3740#(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) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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| 8)) 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; {3740#(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) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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| 8)) 0))} is VALID [2022-02-20 14:25:55,888 INFO L272 TraceCheckUtils]: 17: Hoare triple {3740#(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) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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| 8)) 0))} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {3747#(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|) 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_~#array2~0#1.base_BEFORE_CALL_4|) 8) 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|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0))) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:55,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {3747#(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|) 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_~#array2~0#1.base_BEFORE_CALL_4|) 8) 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|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0))) (< 2 ~ARR_SIZE~0))} ~cond := #in~cond; {3747#(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|) 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_~#array2~0#1.base_BEFORE_CALL_4|) 8) 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|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0))) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:55,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {3747#(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|) 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_~#array2~0#1.base_BEFORE_CALL_4|) 8) 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|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0))) (< 2 ~ARR_SIZE~0))} assume !(0 == ~cond); {3747#(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|) 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_~#array2~0#1.base_BEFORE_CALL_4|) 8) 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|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0))) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:55,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {3747#(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|) 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_~#array2~0#1.base_BEFORE_CALL_4|) 8) 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|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0))) (< 2 ~ARR_SIZE~0))} assume true; {3747#(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|) 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_~#array2~0#1.base_BEFORE_CALL_4|) 8) 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|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0))) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:25:55,891 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3747#(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|) 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_~#array2~0#1.base_BEFORE_CALL_4|) 8) 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|) 0) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_4|) 8) 0))) (< 2 ~ARR_SIZE~0))} {3740#(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) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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| 8)) 0))} #84#return; {3740#(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) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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| 8)) 0))} is VALID [2022-02-20 14:25:55,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {3740#(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) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 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| 8)) 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); {3763#(and (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) (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)) (< 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) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 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))} is VALID [2022-02-20 14:25:55,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {3763#(and (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) (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)) (< 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) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 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))} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3);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; {3767#(and (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) (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)) (< 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) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 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))} is VALID [2022-02-20 14:25:55,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {3767#(and (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) (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)) (< 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) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 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))} 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; {3771#(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) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 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))} is VALID [2022-02-20 14:25:55,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {3771#(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) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 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))} assume 0 == main_~temp~0#1; {3771#(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) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 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))} is VALID [2022-02-20 14:25:55,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {3771#(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) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 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))} main_~count~0#1 := 0; {3778#(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) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 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))} is VALID [2022-02-20 14:25:55,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {3778#(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) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 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))} 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; {3782#(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) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 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))} is VALID [2022-02-20 14:25:55,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {3782#(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) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 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))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3786#(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) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 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) (<= |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:55,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {3786#(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) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 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) (<= |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; {3790#(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) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 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))} is VALID [2022-02-20 14:25:55,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {3790#(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) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 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))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3794#(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| (+ (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|))) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 0))) (< 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))} is VALID [2022-02-20 14:25:55,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {3794#(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| (+ (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|))) (or (and (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (and (= (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| 8)) 1))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) 1) (= (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| 8)) 0))) (< 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))} 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; {3798#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:25:55,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {3798#(and (< 2 ~ARR_SIZE~0) (<= |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; {3798#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:25:55,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {3798#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {3798#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:25:55,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {3798#(and (< 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 3 * main_~sum~0#1 <= 2 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3808#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:25:55,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {3808#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {3685#false} is VALID [2022-02-20 14:25:55,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {3685#false} assume !false; {3685#false} is VALID [2022-02-20 14:25:55,915 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:25:55,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:58,610 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_421 Int) (|ULTIMATE.start_main_~index~0#1| Int)) (or (<= (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) (+ (* 4 |ULTIMATE.start_main_~index~0#1|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) v_ArrVal_421))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| .cse0) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 8)) (select .cse1 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 4)) (select .cse1 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 8))))) (div (+ c_~ARR_SIZE~0 2) 3)) (not (<= v_ArrVal_421 (* |c_ULTIMATE.start_main_~count~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))))) is different from false [2022-02-20 14:25:58,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:58,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821822228] [2022-02-20 14:25:58,708 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:58,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997544365] [2022-02-20 14:25:58,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997544365] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:25:58,708 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:25:58,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-02-20 14:25:58,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628318589] [2022-02-20 14:25:58,708 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:58,708 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 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) Word has length 37 [2022-02-20 14:25:58,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:58,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 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:58,756 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:58,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 14:25:58,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:58,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 14:25:58,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=653, Unknown=1, NotChecked=52, Total=812 [2022-02-20 14:25:58,757 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 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:26:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:00,761 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2022-02-20 14:26:00,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 14:26:00,761 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 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) Word has length 37 [2022-02-20 14:26:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 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:26:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 79 transitions. [2022-02-20 14:26:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 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:26:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 79 transitions. [2022-02-20 14:26:00,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 79 transitions. [2022-02-20 14:26:00,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:00,853 INFO L225 Difference]: With dead ends: 92 [2022-02-20 14:26:00,853 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 14:26:00,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=148, Invalid=847, Unknown=1, NotChecked=60, Total=1056 [2022-02-20 14:26:00,853 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 29 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:00,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 297 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 428 Invalid, 0 Unknown, 37 Unchecked, 0.7s Time] [2022-02-20 14:26:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 14:26:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2022-02-20 14:26:01,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:01,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 78 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 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:26:01,012 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 78 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 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:26:01,013 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 78 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 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:26:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:01,014 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-02-20 14:26:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2022-02-20 14:26:01,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:01,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:01,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 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 88 states. [2022-02-20 14:26:01,015 INFO L87 Difference]: Start difference. First operand has 78 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 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 88 states. [2022-02-20 14:26:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:01,016 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-02-20 14:26:01,016 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2022-02-20 14:26:01,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:01,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:01,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:01,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 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:26:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2022-02-20 14:26:01,017 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 37 [2022-02-20 14:26:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:01,018 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2022-02-20 14:26:01,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 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:26:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2022-02-20 14:26:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 14:26:01,018 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:01,018 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:26:01,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:01,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 14:26:01,219 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:01,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:01,220 INFO L85 PathProgramCache]: Analyzing trace with hash 70690167, now seen corresponding path program 2 times [2022-02-20 14:26:01,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:01,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535369853] [2022-02-20 14:26:01,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:01,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:01,236 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:26:01,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1138538060] [2022-02-20 14:26:01,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:26:01,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:01,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:01,238 INFO L229 MonitoredProcess]: Starting monitored process 11 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:26:01,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 14:26:01,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:26:01,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:01,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-20 14:26:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:01,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:01,385 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:26:01,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:01,460 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:26:01,474 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:26:01,482 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 27 treesize of output 26 [2022-02-20 14:26:01,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:01,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:01,612 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 64 treesize of output 53 [2022-02-20 14:26:01,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:01,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:01,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:01,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:01,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:01,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:01,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-02-20 14:26:03,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,495 INFO L356 Elim1Store]: treesize reduction 66, result has 40.0 percent of original size [2022-02-20 14:26:03,495 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:26:03,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:03,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:04,006 INFO L356 Elim1Store]: treesize reduction 106, result has 29.3 percent of original size [2022-02-20 14:26:04,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 130 [2022-02-20 14:26:07,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:07,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:26:07,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:07,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:26:07,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 4 disjoint index pairs (out of 45 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 124 treesize of output 124 [2022-02-20 14:26:08,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {4282#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; {4282#true} is VALID [2022-02-20 14:26:08,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {4282#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; {4282#true} is VALID [2022-02-20 14:26:08,832 INFO L272 TraceCheckUtils]: 2: Hoare triple {4282#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {4282#true} is VALID [2022-02-20 14:26:08,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {4282#true} ~cond := #in~cond; {4282#true} is VALID [2022-02-20 14:26:08,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {4282#true} assume !(0 == ~cond); {4282#true} is VALID [2022-02-20 14:26:08,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {4282#true} assume true; {4282#true} is VALID [2022-02-20 14:26:08,832 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4282#true} {4282#true} #82#return; {4282#true} is VALID [2022-02-20 14:26:08,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {4282#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; {4308#(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:08,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {4308#(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); {4312#(and (= |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| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~count~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_~#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:08,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {4312#(and (= |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| (* |ULTIMATE.start_main_~count~0#1| 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~count~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_~#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; {4316#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~count~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_~#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))} is VALID [2022-02-20 14:26:08,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {4316#(and (= |ULTIMATE.start_main_~#array2~0#1.offset| 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~count~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_~#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))} 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); {4320#(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|) (= (+ (- 1) |ULTIMATE.start_main_~count~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_~#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))} is VALID [2022-02-20 14:26:08,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {4320#(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|) (= (+ (- 1) |ULTIMATE.start_main_~count~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_~#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))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4324#(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) (<= (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) (- 8))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (+ (- 2) |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|)) (= (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:08,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {4324#(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) (<= (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) (- 8))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (+ (- 2) |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|)) (= (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); {4328#(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) (<= (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_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (+ (- 2) |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|)) (= (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:08,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {4328#(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) (<= (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_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4) (- 8))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (+ (- 2) |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|)) (= (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))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4332#(and (<= |ULTIMATE.start_main_~count~0#1| 3) (= |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|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |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_~#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| 8)) 0))} is VALID [2022-02-20 14:26:08,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {4332#(and (<= |ULTIMATE.start_main_~count~0#1| 3) (= |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|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |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_~#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| 8)) 0))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {4336#(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) (<= ~ARR_SIZE~0 3) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |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_~#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| 8)) 0))} is VALID [2022-02-20 14:26:08,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {4336#(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) (<= ~ARR_SIZE~0 3) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |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_~#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| 8)) 0))} main_~count~0#1 := 1; {4340#(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_~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) (<= ~ARR_SIZE~0 3) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |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_~#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| 8)) 0))} is VALID [2022-02-20 14:26:08,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {4340#(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_~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) (<= ~ARR_SIZE~0 3) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |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_~#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| 8)) 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; {4340#(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_~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) (<= ~ARR_SIZE~0 3) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |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_~#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| 8)) 0))} is VALID [2022-02-20 14:26:08,846 INFO L272 TraceCheckUtils]: 17: Hoare triple {4340#(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_~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) (<= ~ARR_SIZE~0 3) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |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_~#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| 8)) 0))} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {4347#(and (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 8) 0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 4) 0))))} is VALID [2022-02-20 14:26:08,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {4347#(and (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 8) 0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 4) 0))))} ~cond := #in~cond; {4351#(and (<= ~ARR_SIZE~0 3) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (< 2 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 8) 0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 4) 0))))} is VALID [2022-02-20 14:26:08,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {4351#(and (<= ~ARR_SIZE~0 3) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (< 2 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 8) 0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 4) 0))))} assume !(0 == ~cond); {4355#(and (not (= |assume_abort_if_not_#in~cond| 0)) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 8) 0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 4) 0))))} is VALID [2022-02-20 14:26:08,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {4355#(and (not (= |assume_abort_if_not_#in~cond| 0)) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 8) 0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 4) 0))))} assume true; {4355#(and (not (= |assume_abort_if_not_#in~cond| 0)) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 8) 0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 4) 0))))} is VALID [2022-02-20 14:26:08,852 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4355#(and (not (= |assume_abort_if_not_#in~cond| 0)) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 8) 0) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 0) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) 4) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|) 4) 0))))} {4340#(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_~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) (<= ~ARR_SIZE~0 3) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 4)) 0) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |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_~#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| 8)) 0))} #84#return; {4362#(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_~count~0#1| 1) (<= |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) (<= ~ARR_SIZE~0 3) (< |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) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 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|)) (<= (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| 8)) 0))} is VALID [2022-02-20 14:26:08,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {4362#(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_~count~0#1| 1) (<= |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) (<= ~ARR_SIZE~0 3) (< |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) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 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|)) (<= (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| 8)) 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); {4366#(and (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_~count~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= ~ARR_SIZE~0 3) (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) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 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|)) (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))} is VALID [2022-02-20 14:26:08,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {4366#(and (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_~count~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= 0 |ULTIMATE.start_main_~index~0#1|) (<= ~ARR_SIZE~0 3) (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) (< 2 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 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|)) (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))} assume !(0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 3 then main_~index~0#1 % 3 - 3 else main_~index~0#1 % 3));main_#t~ite8#1 := main_~num~0#1 * main_~count~0#1; {4370#(and (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) (<= (+ |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|) (<= ~ARR_SIZE~0 3) (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) (< 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) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 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))} is VALID [2022-02-20 14:26:08,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {4370#(and (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) (<= (+ |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|) (<= ~ARR_SIZE~0 3) (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) (< 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) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 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))} 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; {4374#(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) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |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_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0))} is VALID [2022-02-20 14:26:08,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {4374#(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) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |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_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0))} assume 0 == main_~temp~0#1; {4374#(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) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |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_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0))} is VALID [2022-02-20 14:26:08,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {4374#(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) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |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_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0))} main_~count~0#1 := 0; {4381#(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) (<= ~ARR_SIZE~0 3) (= |ULTIMATE.start_main_~count~0#1| 0) (< 2 ~ARR_SIZE~0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |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_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0))} is VALID [2022-02-20 14:26:08,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {4381#(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) (<= ~ARR_SIZE~0 3) (= |ULTIMATE.start_main_~count~0#1| 0) (< 2 ~ARR_SIZE~0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |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_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 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; {4385#(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) (<= ~ARR_SIZE~0 3) (<= |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) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |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_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0))} is VALID [2022-02-20 14:26:08,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {4385#(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) (<= ~ARR_SIZE~0 3) (<= |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) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |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_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {4389#(and (<= |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_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|))) (= |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_~count~0#1| 1) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |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_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0))} is VALID [2022-02-20 14:26:08,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {4389#(and (<= |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_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|))) (= |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_~count~0#1| 1) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |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_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 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; {4393#(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_~count~0#1| 1) (<= |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_~#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_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) (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))))) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |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_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0))} is VALID [2022-02-20 14:26:08,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {4393#(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_~count~0#1| 1) (<= |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_~#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_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) (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))))) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |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_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| 8)) 0))} main_#t~post10#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {4397#(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) (<= ~ARR_SIZE~0 3) (<= |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) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (= 2 |ULTIMATE.start_main_~count~0#1|) (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))} is VALID [2022-02-20 14:26:08,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {4397#(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) (<= ~ARR_SIZE~0 3) (<= |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) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (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)) (<= (+ (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|))) 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| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| 8)) 0)) (or (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~#array1~0#1.offset| 0) (= 2 |ULTIMATE.start_main_~count~0#1|) (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))} 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; {4401#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0) (= 2 |ULTIMATE.start_main_~count~0#1|))} is VALID [2022-02-20 14:26:08,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {4401#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 3) (< 2 ~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; {4405#(and (<= |ULTIMATE.start_main_~count~0#1| 3) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:26:08,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {4405#(and (<= |ULTIMATE.start_main_~count~0#1| 3) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {4409#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:26:08,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {4409#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= ~ARR_SIZE~0 3) (< 2 ~ARR_SIZE~0))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 3 * main_~sum~0#1 <= 2 + ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4413#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:08,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {4413#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {4283#false} is VALID [2022-02-20 14:26:08,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {4283#false} assume !false; {4283#false} is VALID [2022-02-20 14:26:08,874 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:08,874 INFO L328 TraceCheckSpWp]: Computing backward predicates...