./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array15_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/array15_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 511c1484167d1d7d90ff27dae8a1569edd7c5a72fd917e4f05baeab770e0fcd4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:22:58,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:22:58,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:22:58,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:22:58,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:22:58,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:22:58,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:22:58,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:22:58,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:22:58,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:22:58,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:22:58,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:22:58,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:22:58,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:22:58,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:22:58,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:22:58,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:22:58,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:22:58,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:22:58,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:22:58,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:22:58,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:22:58,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:22:58,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:22:58,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:22:58,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:22:58,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:22:58,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:22:58,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:22:58,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:22:58,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:22:58,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:22:58,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:22:58,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:22:58,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:22:58,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:22:58,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:22:58,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:22:58,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:22:58,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:22:58,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:22:58,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:22:58,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:22:58,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:22:58,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:22:58,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:22:58,369 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:22:58,369 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:22:58,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:22:58,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:22:58,370 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:22:58,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:22:58,370 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:22:58,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:22:58,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:22:58,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:22:58,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:22:58,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:22:58,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:22:58,372 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:22:58,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:22:58,372 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:22:58,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:22:58,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:22:58,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:22:58,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:22:58,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:58,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:22:58,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:22:58,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:22:58,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:22:58,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:22:58,374 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:22:58,374 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:22:58,374 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:22:58,374 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 -> 511c1484167d1d7d90ff27dae8a1569edd7c5a72fd917e4f05baeab770e0fcd4 [2022-02-20 14:22:58,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:22:58,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:22:58,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:22:58,573 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:22:58,573 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:22:58,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array15_pattern.c [2022-02-20 14:22:58,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9855b11/51563312ad864d44b7818b35a024826d/FLAGb1abba8fd [2022-02-20 14:22:58,990 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:22:58,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array15_pattern.c [2022-02-20 14:22:58,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9855b11/51563312ad864d44b7818b35a024826d/FLAGb1abba8fd [2022-02-20 14:22:59,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9855b11/51563312ad864d44b7818b35a024826d [2022-02-20 14:22:59,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:22:59,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:22:59,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:59,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:22:59,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:22:59,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:59" (1/1) ... [2022-02-20 14:22:59,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a2d857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:59, skipping insertion in model container [2022-02-20 14:22:59,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:59" (1/1) ... [2022-02-20 14:22:59,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:22:59,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:22:59,141 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/array15_pattern.c[1424,1437] [2022-02-20 14:22:59,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:59,161 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:22:59,168 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/array15_pattern.c[1424,1437] [2022-02-20 14:22:59,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:59,185 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:22:59,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:59 WrapperNode [2022-02-20 14:22:59,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:59,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:59,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:22:59,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:22:59,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:59" (1/1) ... [2022-02-20 14:22:59,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:59" (1/1) ... [2022-02-20 14:22:59,213 INFO L137 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2022-02-20 14:22:59,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:59,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:22:59,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:22:59,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:22:59,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:59" (1/1) ... [2022-02-20 14:22:59,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:59" (1/1) ... [2022-02-20 14:22:59,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:59" (1/1) ... [2022-02-20 14:22:59,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:59" (1/1) ... [2022-02-20 14:22:59,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:59" (1/1) ... [2022-02-20 14:22:59,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:59" (1/1) ... [2022-02-20 14:22:59,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:59" (1/1) ... [2022-02-20 14:22:59,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:22:59,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:22:59,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:22:59,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:22:59,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:59" (1/1) ... [2022-02-20 14:22:59,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:59,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:59,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:22:59,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:22:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:22:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:22:59,288 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:22:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:22:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:22:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:22:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:22:59,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:22:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:22:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:22:59,333 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:22:59,334 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:22:59,557 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:22:59,562 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:22:59,563 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 14:22:59,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:22:59 BoogieIcfgContainer [2022-02-20 14:22:59,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:22:59,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:22:59,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:22:59,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:22:59,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:22:59" (1/3) ... [2022-02-20 14:22:59,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd2dd4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:22:59, skipping insertion in model container [2022-02-20 14:22:59,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:59" (2/3) ... [2022-02-20 14:22:59,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd2dd4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:22:59, skipping insertion in model container [2022-02-20 14:22:59,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:22:59" (3/3) ... [2022-02-20 14:22:59,571 INFO L111 eAbstractionObserver]: Analyzing ICFG array15_pattern.c [2022-02-20 14:22:59,574 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:22:59,574 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:22:59,603 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:22:59,608 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:22:59,615 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:22:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:22:59,641 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:59,641 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:59,642 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:59,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:59,646 INFO L85 PathProgramCache]: Analyzing trace with hash 179087049, now seen corresponding path program 1 times [2022-02-20 14:22:59,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:59,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334690459] [2022-02-20 14:22:59,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:59,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:22:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:59,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-02-20 14:22:59,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-02-20 14:22:59,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-02-20 14:22:59,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #105#return; {36#false} is VALID [2022-02-20 14:22:59,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {35#true} is VALID [2022-02-20 14:22:59,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {35#true} is VALID [2022-02-20 14:22:59,849 INFO L272 TraceCheckUtils]: 2: Hoare triple {35#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {35#true} is VALID [2022-02-20 14:22:59,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-02-20 14:22:59,850 INFO L290 TraceCheckUtils]: 4: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-02-20 14:22:59,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#false} assume true; {36#false} is VALID [2022-02-20 14:22:59,850 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {36#false} {35#true} #105#return; {36#false} is VALID [2022-02-20 14:22:59,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#false} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {36#false} is VALID [2022-02-20 14:22:59,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {36#false} is VALID [2022-02-20 14:22:59,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume false; {36#false} is VALID [2022-02-20 14:22:59,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {36#false} main_~row~0#1 := 0; {36#false} is VALID [2022-02-20 14:22:59,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-02-20 14:22:59,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {36#false} is VALID [2022-02-20 14:22:59,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#false} assume 0 == __VERIFIER_assert_~cond#1; {36#false} is VALID [2022-02-20 14:22:59,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-02-20 14:22:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:22:59,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:59,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334690459] [2022-02-20 14:22:59,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334690459] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:59,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:59,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:22:59,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283874778] [2022-02-20 14:22:59,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:59,865 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:22:59,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:59,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:59,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:59,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:22:59,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:59,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:22:59,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:22:59,910 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:59,975 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2022-02-20 14:22:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:22:59,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:22:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 93 transitions. [2022-02-20 14:22:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 93 transitions. [2022-02-20 14:22:59,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 93 transitions. [2022-02-20 14:23:00,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:00,094 INFO L225 Difference]: With dead ends: 61 [2022-02-20 14:23:00,095 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 14:23:00,097 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:23:00,100 INFO L933 BasicCegarLoop]: 39 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, 39 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:23:00,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:23:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 14:23:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 14:23:00,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:00,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:00,122 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:00,122 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:00,125 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-20 14:23:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-20 14:23:00,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:00,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:00,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-02-20 14:23:00,127 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-02-20 14:23:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:00,129 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-20 14:23:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-20 14:23:00,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:00,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:00,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:00,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-02-20 14:23:00,133 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2022-02-20 14:23:00,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:00,133 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-02-20 14:23:00,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:23:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-20 14:23:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:23:00,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:00,135 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:00,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:23:00,135 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:00,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1195633489, now seen corresponding path program 1 times [2022-02-20 14:23:00,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:00,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830481238] [2022-02-20 14:23:00,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:00,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:00,158 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:00,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755066686] [2022-02-20 14:23:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:00,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:00,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:00,162 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:23:00,163 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:23:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:00,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:23:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:00,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:00,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {213#true} is VALID [2022-02-20 14:23:00,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {213#true} is VALID [2022-02-20 14:23:00,364 INFO L272 TraceCheckUtils]: 2: Hoare triple {213#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {213#true} is VALID [2022-02-20 14:23:00,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {213#true} ~cond := #in~cond; {227#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 14:23:00,365 INFO L290 TraceCheckUtils]: 4: Hoare triple {227#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {231#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:00,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {231#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:00,366 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {231#(not (= |assume_abort_if_not_#in~cond| 0))} {213#true} #105#return; {238#(< 0 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:00,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#(< 0 ~ARR_SIZE~0)} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {242#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 0))} is VALID [2022-02-20 14:23:00,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {242#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 0))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {214#false} is VALID [2022-02-20 14:23:00,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {214#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {214#false} is VALID [2022-02-20 14:23:00,367 INFO L272 TraceCheckUtils]: 10: Hoare triple {214#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {214#false} is VALID [2022-02-20 14:23:00,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {214#false} ~cond := #in~cond; {214#false} is VALID [2022-02-20 14:23:00,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {214#false} assume !(0 == ~cond); {214#false} is VALID [2022-02-20 14:23:00,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {214#false} assume true; {214#false} is VALID [2022-02-20 14:23:00,368 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {214#false} {214#false} #107#return; {214#false} is VALID [2022-02-20 14:23:00,368 INFO L272 TraceCheckUtils]: 15: Hoare triple {214#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {214#false} is VALID [2022-02-20 14:23:00,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {214#false} ~cond := #in~cond; {214#false} is VALID [2022-02-20 14:23:00,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {214#false} assume !(0 == ~cond); {214#false} is VALID [2022-02-20 14:23:00,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {214#false} assume true; {214#false} is VALID [2022-02-20 14:23:00,369 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {214#false} {214#false} #109#return; {214#false} is VALID [2022-02-20 14:23:00,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {214#false} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {214#false} is VALID [2022-02-20 14:23:00,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {214#false} assume main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {214#false} is VALID [2022-02-20 14:23:00,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {214#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {214#false} is VALID [2022-02-20 14:23:00,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {214#false} assume 0 == main_~temp~0#1; {214#false} is VALID [2022-02-20 14:23:00,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {214#false} main_~row~0#1 := 0; {214#false} is VALID [2022-02-20 14:23:00,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {214#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {214#false} is VALID [2022-02-20 14:23:00,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {214#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {214#false} is VALID [2022-02-20 14:23:00,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {214#false} assume 0 == __VERIFIER_assert_~cond#1; {214#false} is VALID [2022-02-20 14:23:00,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {214#false} assume !false; {214#false} is VALID [2022-02-20 14:23:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:23:00,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:23:00,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:00,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830481238] [2022-02-20 14:23:00,372 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:00,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755066686] [2022-02-20 14:23:00,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755066686] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:00,372 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:00,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 14:23:00,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571686011] [2022-02-20 14:23:00,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:00,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 29 [2022-02-20 14:23:00,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:00,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:23:00,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:00,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 14:23:00,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:00,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 14:23:00,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 14:23:00,394 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:23:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:00,638 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-02-20 14:23:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:23:00,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 29 [2022-02-20 14:23:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:23:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-02-20 14:23:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:23:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-02-20 14:23:00,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-02-20 14:23:00,697 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:23:00,698 INFO L225 Difference]: With dead ends: 60 [2022-02-20 14:23:00,698 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 14:23:00,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 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:23:00,699 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:00,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 56 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:23:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 14:23:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-02-20 14:23:00,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:00,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:00,710 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:00,710 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:00,712 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-02-20 14:23:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-02-20 14:23:00,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:00,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:00,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-02-20 14:23:00,713 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-02-20 14:23:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:00,714 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-02-20 14:23:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-02-20 14:23:00,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:00,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:00,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:00,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-02-20 14:23:00,716 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 29 [2022-02-20 14:23:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:00,716 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-02-20 14:23:00,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:23:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-02-20 14:23:00,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 14:23:00,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:00,718 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 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:23:00,737 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:23:00,937 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:23:00,938 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:00,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash -712222617, now seen corresponding path program 1 times [2022-02-20 14:23:00,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:00,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030301710] [2022-02-20 14:23:00,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:00,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:00,955 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:00,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662824455] [2022-02-20 14:23:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:00,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:00,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:00,957 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:23:00,963 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:23:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:01,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:23:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:01,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:01,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {514#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {514#true} is VALID [2022-02-20 14:23:01,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {514#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {514#true} is VALID [2022-02-20 14:23:01,140 INFO L272 TraceCheckUtils]: 2: Hoare triple {514#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {514#true} is VALID [2022-02-20 14:23:01,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2022-02-20 14:23:01,140 INFO L290 TraceCheckUtils]: 4: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2022-02-20 14:23:01,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {514#true} assume true; {514#true} is VALID [2022-02-20 14:23:01,141 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {514#true} {514#true} #105#return; {514#true} is VALID [2022-02-20 14:23:01,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {540#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:01,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {540#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {544#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:23:01,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {515#false} is VALID [2022-02-20 14:23:01,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {515#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {515#false} is VALID [2022-02-20 14:23:01,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {515#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {515#false} is VALID [2022-02-20 14:23:01,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {515#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {515#false} is VALID [2022-02-20 14:23:01,145 INFO L272 TraceCheckUtils]: 13: Hoare triple {515#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {515#false} is VALID [2022-02-20 14:23:01,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {515#false} ~cond := #in~cond; {515#false} is VALID [2022-02-20 14:23:01,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {515#false} assume !(0 == ~cond); {515#false} is VALID [2022-02-20 14:23:01,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {515#false} assume true; {515#false} is VALID [2022-02-20 14:23:01,146 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {515#false} {515#false} #107#return; {515#false} is VALID [2022-02-20 14:23:01,146 INFO L272 TraceCheckUtils]: 18: Hoare triple {515#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {515#false} is VALID [2022-02-20 14:23:01,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {515#false} ~cond := #in~cond; {515#false} is VALID [2022-02-20 14:23:01,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {515#false} assume !(0 == ~cond); {515#false} is VALID [2022-02-20 14:23:01,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {515#false} assume true; {515#false} is VALID [2022-02-20 14:23:01,147 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {515#false} {515#false} #109#return; {515#false} is VALID [2022-02-20 14:23:01,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {515#false} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {515#false} is VALID [2022-02-20 14:23:01,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {515#false} assume main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {515#false} is VALID [2022-02-20 14:23:01,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {515#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {515#false} is VALID [2022-02-20 14:23:01,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {515#false} assume 0 == main_~temp~0#1; {515#false} is VALID [2022-02-20 14:23:01,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {515#false} main_~row~0#1 := 0; {515#false} is VALID [2022-02-20 14:23:01,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {515#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {515#false} is VALID [2022-02-20 14:23:01,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {515#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {515#false} is VALID [2022-02-20 14:23:01,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {515#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {515#false} is VALID [2022-02-20 14:23:01,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {515#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {515#false} is VALID [2022-02-20 14:23:01,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {515#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {515#false} is VALID [2022-02-20 14:23:01,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {515#false} assume 0 == __VERIFIER_assert_~cond#1; {515#false} is VALID [2022-02-20 14:23:01,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {515#false} assume !false; {515#false} is VALID [2022-02-20 14:23:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:23:01,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:23:01,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:01,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030301710] [2022-02-20 14:23:01,153 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:01,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662824455] [2022-02-20 14:23:01,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662824455] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:01,154 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:01,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:23:01,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603104819] [2022-02-20 14:23:01,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:01,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:23:01,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:01,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:23:01,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:01,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:23:01,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:01,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:23:01,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:23:01,178 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:23:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:01,283 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-02-20 14:23:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:23:01,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:23:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:23:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-02-20 14:23:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:23:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-02-20 14:23:01,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-02-20 14:23:01,347 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:23:01,348 INFO L225 Difference]: With dead ends: 63 [2022-02-20 14:23:01,348 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 14:23:01,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:23:01,349 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:01,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 49 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:23:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 14:23:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-02-20 14:23:01,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:01,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:01,367 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:01,367 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:01,368 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 14:23:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 14:23:01,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:01,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:01,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-02-20 14:23:01,369 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-02-20 14:23:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:01,375 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 14:23:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 14:23:01,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:01,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:01,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:01,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-02-20 14:23:01,378 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 35 [2022-02-20 14:23:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:01,378 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-02-20 14:23:01,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:23:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-02-20 14:23:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 14:23:01,381 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:01,381 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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:23:01,401 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:23:01,598 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:23:01,598 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:01,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:01,599 INFO L85 PathProgramCache]: Analyzing trace with hash -459431893, now seen corresponding path program 1 times [2022-02-20 14:23:01,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:01,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753629980] [2022-02-20 14:23:01,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:01,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:01,626 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:01,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151057159] [2022-02-20 14:23:01,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:01,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:01,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:01,627 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:23:01,629 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:23:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:01,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 14:23:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:01,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:02,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {833#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {833#true} is VALID [2022-02-20 14:23:02,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {833#true} is VALID [2022-02-20 14:23:02,129 INFO L272 TraceCheckUtils]: 2: Hoare triple {833#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {833#true} is VALID [2022-02-20 14:23:02,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-02-20 14:23:02,130 INFO L290 TraceCheckUtils]: 4: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-02-20 14:23:02,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} assume true; {833#true} is VALID [2022-02-20 14:23:02,130 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {833#true} {833#true} #105#return; {833#true} is VALID [2022-02-20 14:23:02,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {833#true} is VALID [2022-02-20 14:23:02,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {862#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:02,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {862#(<= |ULTIMATE.start_main_~column~0#1| 0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {862#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:02,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {862#(<= |ULTIMATE.start_main_~column~0#1| 0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {869#(<= |ULTIMATE.start_main_~column~0#1| 1)} is VALID [2022-02-20 14:23:02,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {869#(<= |ULTIMATE.start_main_~column~0#1| 1)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {873#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:02,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(<= ~ARR_SIZE~0 1)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {873#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:02,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#(<= ~ARR_SIZE~0 1)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {873#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:02,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {873#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:02,138 INFO L272 TraceCheckUtils]: 15: Hoare triple {873#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {873#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:02,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {889#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-02-20 14:23:02,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {889#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {893#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:23:02,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {893#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} assume true; {893#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:23:02,140 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {893#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} {873#(<= ~ARR_SIZE~0 1)} #107#return; {900#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:02,142 INFO L272 TraceCheckUtils]: 20: Hoare triple {900#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {904#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1))} is VALID [2022-02-20 14:23:02,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {904#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1))} ~cond := #in~cond; {908#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-02-20 14:23:02,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {908#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {912#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:23:02,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {912#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} assume true; {912#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:23:02,145 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {912#(and (< 0 ~ARR_SIZE~0) (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} {900#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} #109#return; {919#(and (<= ~ARR_SIZE~0 1) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:02,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {919#(and (<= ~ARR_SIZE~0 1) (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {923#(and (< (+ |ULTIMATE.start_main_~temp~0#1| 1) (* 2 ~ARR_SIZE~0)) (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~temp~0#1|))} is VALID [2022-02-20 14:23:02,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {923#(and (< (+ |ULTIMATE.start_main_~temp~0#1| 1) (* 2 ~ARR_SIZE~0)) (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~temp~0#1|))} assume main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {834#false} is VALID [2022-02-20 14:23:02,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {834#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {834#false} is VALID [2022-02-20 14:23:02,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {834#false} assume 0 == main_~temp~0#1; {834#false} is VALID [2022-02-20 14:23:02,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {834#false} main_~row~0#1 := 0; {834#false} is VALID [2022-02-20 14:23:02,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {834#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {834#false} is VALID [2022-02-20 14:23:02,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {834#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {834#false} is VALID [2022-02-20 14:23:02,148 INFO L290 TraceCheckUtils]: 32: Hoare triple {834#false} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {834#false} is VALID [2022-02-20 14:23:02,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {834#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {834#false} is VALID [2022-02-20 14:23:02,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {834#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {834#false} is VALID [2022-02-20 14:23:02,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {834#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {834#false} is VALID [2022-02-20 14:23:02,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {834#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {834#false} is VALID [2022-02-20 14:23:02,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {834#false} assume 0 == __VERIFIER_assert_~cond#1; {834#false} is VALID [2022-02-20 14:23:02,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-02-20 14:23:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:23:02,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:02,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-02-20 14:23:02,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {834#false} assume 0 == __VERIFIER_assert_~cond#1; {834#false} is VALID [2022-02-20 14:23:02,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {834#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {834#false} is VALID [2022-02-20 14:23:02,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {834#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {834#false} is VALID [2022-02-20 14:23:02,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {834#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {834#false} is VALID [2022-02-20 14:23:02,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {834#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {834#false} is VALID [2022-02-20 14:23:02,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {834#false} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {834#false} is VALID [2022-02-20 14:23:02,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {834#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {834#false} is VALID [2022-02-20 14:23:02,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {834#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {834#false} is VALID [2022-02-20 14:23:02,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {834#false} main_~row~0#1 := 0; {834#false} is VALID [2022-02-20 14:23:02,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {834#false} assume 0 == main_~temp~0#1; {834#false} is VALID [2022-02-20 14:23:02,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {834#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {834#false} is VALID [2022-02-20 14:23:02,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {999#(and (not (= (+ (- 2) ~ARR_SIZE~0) |ULTIMATE.start_main_~temp~0#1|)) (not (= ~ARR_SIZE~0 |ULTIMATE.start_main_~temp~0#1|)))} assume main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {834#false} is VALID [2022-02-20 14:23:02,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {1003#(and (not (= (+ (- 2) ~ARR_SIZE~0) (+ |ULTIMATE.start_main_~index1~0#1| |ULTIMATE.start_main_~index2~0#1|))) (not (= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~index1~0#1| |ULTIMATE.start_main_~index2~0#1|))))} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {999#(and (not (= (+ (- 2) ~ARR_SIZE~0) |ULTIMATE.start_main_~temp~0#1|)) (not (= ~ARR_SIZE~0 |ULTIMATE.start_main_~temp~0#1|)))} is VALID [2022-02-20 14:23:02,865 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1011#(not (= |assume_abort_if_not_#in~cond| 0))} {1007#(and (or (< ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~index1~0#1| 2)) (<= (+ |ULTIMATE.start_main_~index1~0#1| 2) 0)) (or (<= |ULTIMATE.start_main_~index1~0#1| 0) (< ~ARR_SIZE~0 |ULTIMATE.start_main_~index1~0#1|)))} #109#return; {1003#(and (not (= (+ (- 2) ~ARR_SIZE~0) (+ |ULTIMATE.start_main_~index1~0#1| |ULTIMATE.start_main_~index2~0#1|))) (not (= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~index1~0#1| |ULTIMATE.start_main_~index2~0#1|))))} is VALID [2022-02-20 14:23:02,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {1011#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1011#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:02,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1011#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:02,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {833#true} ~cond := #in~cond; {1018#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 14:23:02,866 INFO L272 TraceCheckUtils]: 20: Hoare triple {1007#(and (or (< ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~index1~0#1| 2)) (<= (+ |ULTIMATE.start_main_~index1~0#1| 2) 0)) (or (<= |ULTIMATE.start_main_~index1~0#1| 0) (< ~ARR_SIZE~0 |ULTIMATE.start_main_~index1~0#1|)))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {833#true} is VALID [2022-02-20 14:23:02,867 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1028#(or (not (= |assume_abort_if_not_#in~cond| 0)) (<= ~ARR_SIZE~0 0) (not (<= ~ARR_SIZE~0 1)))} {873#(<= ~ARR_SIZE~0 1)} #107#return; {1007#(and (or (< ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~index1~0#1| 2)) (<= (+ |ULTIMATE.start_main_~index1~0#1| 2) 0)) (or (<= |ULTIMATE.start_main_~index1~0#1| 0) (< ~ARR_SIZE~0 |ULTIMATE.start_main_~index1~0#1|)))} is VALID [2022-02-20 14:23:02,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {1028#(or (not (= |assume_abort_if_not_#in~cond| 0)) (<= ~ARR_SIZE~0 0) (not (<= ~ARR_SIZE~0 1)))} assume true; {1028#(or (not (= |assume_abort_if_not_#in~cond| 0)) (<= ~ARR_SIZE~0 0) (not (<= ~ARR_SIZE~0 1)))} is VALID [2022-02-20 14:23:02,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {1035#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0) (<= ~ARR_SIZE~0 0) (not (<= ~ARR_SIZE~0 1)))} assume !(0 == ~cond); {1028#(or (not (= |assume_abort_if_not_#in~cond| 0)) (<= ~ARR_SIZE~0 0) (not (<= ~ARR_SIZE~0 1)))} is VALID [2022-02-20 14:23:02,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#true} ~cond := #in~cond; {1035#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0) (<= ~ARR_SIZE~0 0) (not (<= ~ARR_SIZE~0 1)))} is VALID [2022-02-20 14:23:02,869 INFO L272 TraceCheckUtils]: 15: Hoare triple {873#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {833#true} is VALID [2022-02-20 14:23:02,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {873#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:02,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#(<= ~ARR_SIZE~0 1)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {873#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:02,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(<= ~ARR_SIZE~0 1)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {873#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:02,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {869#(<= |ULTIMATE.start_main_~column~0#1| 1)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {873#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:02,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {862#(<= |ULTIMATE.start_main_~column~0#1| 0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {869#(<= |ULTIMATE.start_main_~column~0#1| 1)} is VALID [2022-02-20 14:23:02,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {862#(<= |ULTIMATE.start_main_~column~0#1| 0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {862#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:02,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {862#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:02,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {833#true} is VALID [2022-02-20 14:23:02,871 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {833#true} {833#true} #105#return; {833#true} is VALID [2022-02-20 14:23:02,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} assume true; {833#true} is VALID [2022-02-20 14:23:02,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-02-20 14:23:02,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-02-20 14:23:02,872 INFO L272 TraceCheckUtils]: 2: Hoare triple {833#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {833#true} is VALID [2022-02-20 14:23:02,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {833#true} is VALID [2022-02-20 14:23:02,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {833#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {833#true} is VALID [2022-02-20 14:23:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:23:02,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:02,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753629980] [2022-02-20 14:23:02,872 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:02,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151057159] [2022-02-20 14:23:02,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151057159] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:02,873 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:02,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2022-02-20 14:23:02,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756150466] [2022-02-20 14:23:02,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:02,873 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 39 [2022-02-20 14:23:02,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:02,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:23:02,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:02,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 14:23:02,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:02,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 14:23:02,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-02-20 14:23:02,916 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:23:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:03,811 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2022-02-20 14:23:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-20 14:23:03,811 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 39 [2022-02-20 14:23:03,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:23:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 121 transitions. [2022-02-20 14:23:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:23:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 121 transitions. [2022-02-20 14:23:03,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 121 transitions. [2022-02-20 14:23:03,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:03,902 INFO L225 Difference]: With dead ends: 107 [2022-02-20 14:23:03,902 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 14:23:03,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2022-02-20 14:23:03,903 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 124 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:03,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 149 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:23:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 14:23:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 60. [2022-02-20 14:23:03,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:03,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 60 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:23:03,950 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 60 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:23:03,950 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 60 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:23:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:03,952 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-02-20 14:23:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-02-20 14:23:03,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:03,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:03,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 85 states. [2022-02-20 14:23:03,954 INFO L87 Difference]: Start difference. First operand has 60 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 85 states. [2022-02-20 14:23:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:03,956 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-02-20 14:23:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-02-20 14:23:03,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:03,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:03,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:03,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:23:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-02-20 14:23:03,958 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 39 [2022-02-20 14:23:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:03,959 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-02-20 14:23:03,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:23:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-02-20 14:23:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 14:23:03,960 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:03,960 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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:23:03,979 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:23:04,175 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:23:04,176 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:04,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1046237907, now seen corresponding path program 1 times [2022-02-20 14:23:04,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:04,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277228744] [2022-02-20 14:23:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:04,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:04,195 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:04,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071338364] [2022-02-20 14:23:04,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:04,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:04,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:04,197 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:23:04,198 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:23:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:04,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 14:23:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:04,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:04,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 37 treesize of output 32 [2022-02-20 14:23:04,388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-02-20 14:23:04,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 120 treesize of output 109 [2022-02-20 14:23:04,985 INFO L356 Elim1Store]: treesize reduction 265, result has 22.3 percent of original size [2022-02-20 14:23:04,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 108 treesize of output 218 [2022-02-20 14:23:05,059 INFO L356 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2022-02-20 14:23:05,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 52 [2022-02-20 14:23:05,133 INFO L356 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2022-02-20 14:23:05,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 55 [2022-02-20 14:23:06,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 28 [2022-02-20 14:23:07,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {1501#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1501#true} is VALID [2022-02-20 14:23:07,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {1501#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {1501#true} is VALID [2022-02-20 14:23:07,127 INFO L272 TraceCheckUtils]: 2: Hoare triple {1501#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1501#true} is VALID [2022-02-20 14:23:07,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {1501#true} ~cond := #in~cond; {1501#true} is VALID [2022-02-20 14:23:07,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {1501#true} assume !(0 == ~cond); {1501#true} is VALID [2022-02-20 14:23:07,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-02-20 14:23:07,127 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1501#true} {1501#true} #105#return; {1501#true} is VALID [2022-02-20 14:23:07,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {1501#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {1527#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0))} is VALID [2022-02-20 14:23:07,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1531#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:23:07,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {1531#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,132 INFO L272 TraceCheckUtils]: 15: Hoare triple {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:23:07,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} ~cond := #in~cond; {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:23:07,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} assume !(0 == ~cond); {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:23:07,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} assume true; {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:23:07,134 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} #107#return; {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,135 INFO L272 TraceCheckUtils]: 20: Hoare triple {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:23:07,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} ~cond := #in~cond; {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:23:07,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} assume !(0 == ~cond); {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:23:07,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} assume true; {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} is VALID [2022-02-20 14:23:07,137 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1554#(and (< 0 ~ARR_SIZE~0) (exists ((|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_1|) 0)))} {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} #109#return; {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !(main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);main_#t~ite10#1 := main_#t~mem9#1; {1588#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (or (and (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~ite10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))))) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) |ULTIMATE.start_main_#t~ite10#1|) (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {1588#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (or (and (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~ite10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4))))) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) |ULTIMATE.start_main_#t~ite10#1|) (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume 0 == main_~temp~0#1; {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {1535#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} main_~row~0#1 := 0; {1598#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {1598#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1602#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} is VALID [2022-02-20 14:23:07,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {1602#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {1606#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0))} is VALID [2022-02-20 14:23:07,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {1606#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1606#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0))} is VALID [2022-02-20 14:23:07,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {1606#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1606#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0))} is VALID [2022-02-20 14:23:07,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {1606#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0))} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1606#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0))} is VALID [2022-02-20 14:23:07,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {1606#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1606#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0))} is VALID [2022-02-20 14:23:07,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {1606#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 0))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1622#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:23:07,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {1622#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1502#false} is VALID [2022-02-20 14:23:07,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {1502#false} assume !false; {1502#false} is VALID [2022-02-20 14:23:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:23:07,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:08,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 56 treesize of output 52 [2022-02-20 14:23:08,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:23:08,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 121 [2022-02-20 14:23:08,507 INFO L356 Elim1Store]: treesize reduction 150, result has 27.9 percent of original size [2022-02-20 14:23:08,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 107 [2022-02-20 14:23:08,716 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:23:08,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 131 [2022-02-20 14:23:25,999 INFO L290 TraceCheckUtils]: 38: Hoare triple {1502#false} assume !false; {1502#false} is VALID [2022-02-20 14:23:26,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {1622#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1502#false} is VALID [2022-02-20 14:23:26,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {1635#(<= (+ 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1622#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:23:26,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {1635#(<= (+ 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1635#(<= (+ 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {1635#(<= (+ 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1635#(<= (+ 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {1635#(<= (+ 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1635#(<= (+ 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {1635#(<= (+ 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1635#(<= (+ 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {1651#(and (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))) (or (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {1635#(<= (+ 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {1655#(and (or (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0)) (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647))) (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1651#(and (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))) (or (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))))} is VALID [2022-02-20 14:23:26,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} main_~row~0#1 := 0; {1655#(and (or (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0)) (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647))) (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))))} is VALID [2022-02-20 14:23:26,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} assume 0 == main_~temp~0#1; {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {1666#(and (or (<= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) |ULTIMATE.start_main_#t~ite10#1|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0)) (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647))) (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (<= (+ 2 |ULTIMATE.start_main_~sum~0#1| (select (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) |ULTIMATE.start_main_#t~ite10#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) (* 2 ~ARR_SIZE~0))))} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} assume !(main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);main_#t~ite10#1 := main_#t~mem9#1; {1666#(and (or (<= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* |ULTIMATE.start_main_~index2~0#1| 4)) |ULTIMATE.start_main_#t~ite10#1|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0)) (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647))) (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (<= (+ 2 |ULTIMATE.start_main_~sum~0#1| (select (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index2~0#1| 4) (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))) |ULTIMATE.start_main_#t~ite10#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) (* 2 ~ARR_SIZE~0))))} is VALID [2022-02-20 14:23:26,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,034 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1501#true} {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} #109#return; {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-02-20 14:23:26,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {1501#true} assume !(0 == ~cond); {1501#true} is VALID [2022-02-20 14:23:26,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {1501#true} ~cond := #in~cond; {1501#true} is VALID [2022-02-20 14:23:26,034 INFO L272 TraceCheckUtils]: 20: Hoare triple {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1501#true} is VALID [2022-02-20 14:23:26,035 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1501#true} {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} #107#return; {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-02-20 14:23:26,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {1501#true} assume !(0 == ~cond); {1501#true} is VALID [2022-02-20 14:23:26,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {1501#true} ~cond := #in~cond; {1501#true} is VALID [2022-02-20 14:23:26,035 INFO L272 TraceCheckUtils]: 15: Hoare triple {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1501#true} is VALID [2022-02-20 14:23:26,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {1721#(and (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (= (* 17179869184 |ULTIMATE.start_main_~row~0#1|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) (* (* (mod ~ARR_SIZE~0 4294967296) |ULTIMATE.start_main_~row~0#1|) 4)))) (or (= 0 (+ (* |ULTIMATE.start_main_~column~0#1| 4) (* (* (mod ~ARR_SIZE~0 4294967296) |ULTIMATE.start_main_~row~0#1|) 4))) (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647))) (<= (+ 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0)))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1659#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:26,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1721#(and (or (<= (mod ~ARR_SIZE~0 4294967296) 2147483647) (= (* 17179869184 |ULTIMATE.start_main_~row~0#1|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) (* (* (mod ~ARR_SIZE~0 4294967296) |ULTIMATE.start_main_~row~0#1|) 4)))) (or (= 0 (+ (* |ULTIMATE.start_main_~column~0#1| 4) (* (* (mod ~ARR_SIZE~0 4294967296) |ULTIMATE.start_main_~row~0#1|) 4))) (not (<= (mod ~ARR_SIZE~0 4294967296) 2147483647))) (<= (+ 2 |ULTIMATE.start_main_~sum~0#1|) (* 2 ~ARR_SIZE~0)))} is VALID [2022-02-20 14:23:26,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {1501#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {1527#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~row~0#1| 0))} is VALID [2022-02-20 14:23:26,047 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1501#true} {1501#true} #105#return; {1501#true} is VALID [2022-02-20 14:23:26,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-02-20 14:23:26,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {1501#true} assume !(0 == ~cond); {1501#true} is VALID [2022-02-20 14:23:26,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {1501#true} ~cond := #in~cond; {1501#true} is VALID [2022-02-20 14:23:26,047 INFO L272 TraceCheckUtils]: 2: Hoare triple {1501#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1501#true} is VALID [2022-02-20 14:23:26,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {1501#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {1501#true} is VALID [2022-02-20 14:23:26,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {1501#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1501#true} is VALID [2022-02-20 14:23:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:23:26,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:26,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277228744] [2022-02-20 14:23:26,048 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:26,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071338364] [2022-02-20 14:23:26,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071338364] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:26,048 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:26,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2022-02-20 14:23:26,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934563371] [2022-02-20 14:23:26,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:26,049 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-02-20 14:23:26,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:26,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:26,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:26,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 14:23:26,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:26,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 14:23:26,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-02-20 14:23:26,241 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:28,882 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-02-20 14:23:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:23:28,882 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-02-20 14:23:28,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 72 transitions. [2022-02-20 14:23:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 72 transitions. [2022-02-20 14:23:28,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 72 transitions. [2022-02-20 14:23:28,987 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:23:28,988 INFO L225 Difference]: With dead ends: 92 [2022-02-20 14:23:28,989 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 14:23:28,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-02-20 14:23:28,990 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 76 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:28,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 159 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 204 Invalid, 0 Unknown, 25 Unchecked, 0.7s Time] [2022-02-20 14:23:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 14:23:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2022-02-20 14:23:29,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:29,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 77 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:29,070 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 77 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:29,070 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 77 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:29,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:29,072 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2022-02-20 14:23:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2022-02-20 14:23:29,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:29,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:29,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 88 states. [2022-02-20 14:23:29,073 INFO L87 Difference]: Start difference. First operand has 77 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 88 states. [2022-02-20 14:23:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:29,076 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2022-02-20 14:23:29,076 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2022-02-20 14:23:29,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:29,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:29,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:29,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 64 states have internal predecessors, (76), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2022-02-20 14:23:29,079 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 39 [2022-02-20 14:23:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:29,079 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2022-02-20 14:23:29,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2022-02-20 14:23:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 14:23:29,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:29,080 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-02-20 14:23:29,104 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:23:29,281 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:23:29,281 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash -252023569, now seen corresponding path program 2 times [2022-02-20 14:23:29,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:29,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830837538] [2022-02-20 14:23:29,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:29,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:29,304 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:29,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662246571] [2022-02-20 14:23:29,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:23:29,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:29,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:29,309 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:23:29,310 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:23:29,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:23:29,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:29,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:23:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:29,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:29,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {2163#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2163#true} is VALID [2022-02-20 14:23:29,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {2163#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {2163#true} is VALID [2022-02-20 14:23:29,528 INFO L272 TraceCheckUtils]: 2: Hoare triple {2163#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2163#true} is VALID [2022-02-20 14:23:29,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {2163#true} ~cond := #in~cond; {2163#true} is VALID [2022-02-20 14:23:29,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {2163#true} assume !(0 == ~cond); {2163#true} is VALID [2022-02-20 14:23:29,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {2163#true} assume true; {2163#true} is VALID [2022-02-20 14:23:29,529 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2163#true} {2163#true} #105#return; {2163#true} is VALID [2022-02-20 14:23:29,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {2163#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {2163#true} is VALID [2022-02-20 14:23:29,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {2163#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2192#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:29,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {2192#(<= |ULTIMATE.start_main_~column~0#1| 0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {2192#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:29,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {2192#(<= |ULTIMATE.start_main_~column~0#1| 0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2199#(<= |ULTIMATE.start_main_~column~0#1| 1)} is VALID [2022-02-20 14:23:29,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {2199#(<= |ULTIMATE.start_main_~column~0#1| 1)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,533 INFO L272 TraceCheckUtils]: 15: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume !(0 == ~cond); {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume true; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,534 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2203#(<= ~ARR_SIZE~0 1)} {2203#(<= ~ARR_SIZE~0 1)} #107#return; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,535 INFO L272 TraceCheckUtils]: 20: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume !(0 == ~cond); {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume true; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,536 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2203#(<= ~ARR_SIZE~0 1)} {2203#(<= ~ARR_SIZE~0 1)} #109#return; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume !(main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);main_#t~ite10#1 := main_#t~mem9#1; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume 0 == main_~temp~0#1; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} main_~row~0#1 := 0; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2261#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:29,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {2261#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {2261#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:29,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {2261#(and (<= ~ARR_SIZE~0 1) (<= 0 |ULTIMATE.start_main_~column~0#1|))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2268#(and (<= ~ARR_SIZE~0 1) (<= 1 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:29,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {2268#(and (<= ~ARR_SIZE~0 1) (<= 1 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {2164#false} is VALID [2022-02-20 14:23:29,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {2164#false} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2164#false} is VALID [2022-02-20 14:23:29,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {2164#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2164#false} is VALID [2022-02-20 14:23:29,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {2164#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2164#false} is VALID [2022-02-20 14:23:29,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {2164#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2164#false} is VALID [2022-02-20 14:23:29,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {2164#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2164#false} is VALID [2022-02-20 14:23:29,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {2164#false} assume 0 == __VERIFIER_assert_~cond#1; {2164#false} is VALID [2022-02-20 14:23:29,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {2164#false} assume !false; {2164#false} is VALID [2022-02-20 14:23:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:23:29,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:29,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {2164#false} assume !false; {2164#false} is VALID [2022-02-20 14:23:29,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {2164#false} assume 0 == __VERIFIER_assert_~cond#1; {2164#false} is VALID [2022-02-20 14:23:29,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {2164#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2164#false} is VALID [2022-02-20 14:23:29,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {2164#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2164#false} is VALID [2022-02-20 14:23:29,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {2164#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2164#false} is VALID [2022-02-20 14:23:29,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {2164#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2164#false} is VALID [2022-02-20 14:23:29,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {2164#false} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2164#false} is VALID [2022-02-20 14:23:29,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {2314#(not (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {2164#false} is VALID [2022-02-20 14:23:29,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {2318#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~column~0#1| 1))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2314#(not (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:29,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {2318#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~column~0#1| 1))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {2318#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~column~0#1| 1))} is VALID [2022-02-20 14:23:29,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2318#(<= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~column~0#1| 1))} is VALID [2022-02-20 14:23:29,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} main_~row~0#1 := 0; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume 0 == main_~temp~0#1; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume !(main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);main_#t~ite10#1 := main_#t~mem9#1; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,682 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2163#true} {2203#(<= ~ARR_SIZE~0 1)} #109#return; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {2163#true} assume true; {2163#true} is VALID [2022-02-20 14:23:29,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {2163#true} assume !(0 == ~cond); {2163#true} is VALID [2022-02-20 14:23:29,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {2163#true} ~cond := #in~cond; {2163#true} is VALID [2022-02-20 14:23:29,682 INFO L272 TraceCheckUtils]: 20: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2163#true} is VALID [2022-02-20 14:23:29,683 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2163#true} {2203#(<= ~ARR_SIZE~0 1)} #107#return; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {2163#true} assume true; {2163#true} is VALID [2022-02-20 14:23:29,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {2163#true} assume !(0 == ~cond); {2163#true} is VALID [2022-02-20 14:23:29,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {2163#true} ~cond := #in~cond; {2163#true} is VALID [2022-02-20 14:23:29,683 INFO L272 TraceCheckUtils]: 15: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2163#true} is VALID [2022-02-20 14:23:29,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {2203#(<= ~ARR_SIZE~0 1)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {2199#(<= |ULTIMATE.start_main_~column~0#1| 1)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2203#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:23:29,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {2192#(<= |ULTIMATE.start_main_~column~0#1| 0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2199#(<= |ULTIMATE.start_main_~column~0#1| 1)} is VALID [2022-02-20 14:23:29,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {2192#(<= |ULTIMATE.start_main_~column~0#1| 0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {2192#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:29,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {2163#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2192#(<= |ULTIMATE.start_main_~column~0#1| 0)} is VALID [2022-02-20 14:23:29,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {2163#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {2163#true} is VALID [2022-02-20 14:23:29,687 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2163#true} {2163#true} #105#return; {2163#true} is VALID [2022-02-20 14:23:29,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {2163#true} assume true; {2163#true} is VALID [2022-02-20 14:23:29,687 INFO L290 TraceCheckUtils]: 4: Hoare triple {2163#true} assume !(0 == ~cond); {2163#true} is VALID [2022-02-20 14:23:29,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {2163#true} ~cond := #in~cond; {2163#true} is VALID [2022-02-20 14:23:29,687 INFO L272 TraceCheckUtils]: 2: Hoare triple {2163#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2163#true} is VALID [2022-02-20 14:23:29,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {2163#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {2163#true} is VALID [2022-02-20 14:23:29,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {2163#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2163#true} is VALID [2022-02-20 14:23:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:23:29,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:29,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830837538] [2022-02-20 14:23:29,688 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:29,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662246571] [2022-02-20 14:23:29,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662246571] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:29,688 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:29,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:23:29,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004765971] [2022-02-20 14:23:29,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:29,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-02-20 14:23:29,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:29,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:29,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:29,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:23:29,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:29,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:23:29,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:23:29,722 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:30,254 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2022-02-20 14:23:30,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 14:23:30,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-02-20 14:23:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2022-02-20 14:23:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2022-02-20 14:23:30,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 126 transitions. [2022-02-20 14:23:30,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:30,357 INFO L225 Difference]: With dead ends: 155 [2022-02-20 14:23:30,357 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 14:23:30,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:23:30,358 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 145 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:30,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 114 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:23:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 14:23:30,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2022-02-20 14:23:30,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:30,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 90 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:30,497 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 90 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:30,497 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 90 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:30,500 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2022-02-20 14:23:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2022-02-20 14:23:30,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:30,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:30,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 117 states. [2022-02-20 14:23:30,501 INFO L87 Difference]: Start difference. First operand has 90 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 117 states. [2022-02-20 14:23:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:30,504 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2022-02-20 14:23:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2022-02-20 14:23:30,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:30,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:30,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:30,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-02-20 14:23:30,507 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 41 [2022-02-20 14:23:30,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:30,508 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-02-20 14:23:30,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-02-20 14:23:30,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 14:23:30,509 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:30,509 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-02-20 14:23:30,543 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:23:30,725 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:23:30,726 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:30,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash 796161581, now seen corresponding path program 2 times [2022-02-20 14:23:30,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:30,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59285630] [2022-02-20 14:23:30,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:30,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:30,743 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:30,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880036913] [2022-02-20 14:23:30,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:23:30,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:30,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:30,745 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:23:30,746 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:23:30,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:23:30,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:30,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:23:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:30,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:30,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {2993#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2993#true} is VALID [2022-02-20 14:23:30,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {2993#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {2993#true} is VALID [2022-02-20 14:23:30,974 INFO L272 TraceCheckUtils]: 2: Hoare triple {2993#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2993#true} is VALID [2022-02-20 14:23:30,974 INFO L290 TraceCheckUtils]: 3: Hoare triple {2993#true} ~cond := #in~cond; {2993#true} is VALID [2022-02-20 14:23:30,974 INFO L290 TraceCheckUtils]: 4: Hoare triple {2993#true} assume !(0 == ~cond); {2993#true} is VALID [2022-02-20 14:23:30,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {2993#true} assume true; {2993#true} is VALID [2022-02-20 14:23:30,974 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2993#true} {2993#true} #105#return; {2993#true} is VALID [2022-02-20 14:23:30,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {2993#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {3019#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:23:30,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {3019#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {3023#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:30,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {3023#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {3023#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:30,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {3023#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3030#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:30,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {3030#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {3034#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:30,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {3034#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3034#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:30,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {3034#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {3034#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:30,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {3034#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3044#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:30,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {3044#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2994#false} is VALID [2022-02-20 14:23:30,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {2994#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2994#false} is VALID [2022-02-20 14:23:30,979 INFO L272 TraceCheckUtils]: 17: Hoare triple {2994#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2994#false} is VALID [2022-02-20 14:23:30,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {2994#false} ~cond := #in~cond; {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {2994#false} assume !(0 == ~cond); {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {2994#false} assume true; {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2994#false} {2994#false} #107#return; {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L272 TraceCheckUtils]: 22: Hoare triple {2994#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {2994#false} ~cond := #in~cond; {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {2994#false} assume !(0 == ~cond); {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {2994#false} assume true; {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2994#false} {2994#false} #109#return; {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {2994#false} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {2994#false} assume main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {2994#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {2994#false} assume 0 == main_~temp~0#1; {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {2994#false} main_~row~0#1 := 0; {2994#false} is VALID [2022-02-20 14:23:30,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {2994#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2994#false} is VALID [2022-02-20 14:23:30,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {2994#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {2994#false} is VALID [2022-02-20 14:23:30,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {2994#false} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2994#false} is VALID [2022-02-20 14:23:30,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {2994#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2994#false} is VALID [2022-02-20 14:23:30,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {2994#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2994#false} is VALID [2022-02-20 14:23:30,981 INFO L290 TraceCheckUtils]: 37: Hoare triple {2994#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2994#false} is VALID [2022-02-20 14:23:30,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {2994#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2994#false} is VALID [2022-02-20 14:23:30,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {2994#false} assume 0 == __VERIFIER_assert_~cond#1; {2994#false} is VALID [2022-02-20 14:23:30,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {2994#false} assume !false; {2994#false} is VALID [2022-02-20 14:23:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:23:30,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:31,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {2994#false} assume !false; {2994#false} is VALID [2022-02-20 14:23:31,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {2994#false} assume 0 == __VERIFIER_assert_~cond#1; {2994#false} is VALID [2022-02-20 14:23:31,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {2994#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2994#false} is VALID [2022-02-20 14:23:31,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {2994#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2994#false} is VALID [2022-02-20 14:23:31,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {2994#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2994#false} is VALID [2022-02-20 14:23:31,135 INFO L290 TraceCheckUtils]: 35: Hoare triple {2994#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2994#false} is VALID [2022-02-20 14:23:31,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {2994#false} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2994#false} is VALID [2022-02-20 14:23:31,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {2994#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {2994#false} is VALID [2022-02-20 14:23:31,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {2994#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2994#false} is VALID [2022-02-20 14:23:31,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {2994#false} main_~row~0#1 := 0; {2994#false} is VALID [2022-02-20 14:23:31,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {2994#false} assume 0 == main_~temp~0#1; {2994#false} is VALID [2022-02-20 14:23:31,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {2994#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2994#false} is VALID [2022-02-20 14:23:31,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {2994#false} assume main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {2994#false} is VALID [2022-02-20 14:23:31,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {2994#false} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {2994#false} is VALID [2022-02-20 14:23:31,141 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2993#true} {2994#false} #109#return; {2994#false} is VALID [2022-02-20 14:23:31,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {2993#true} assume true; {2993#true} is VALID [2022-02-20 14:23:31,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {2993#true} assume !(0 == ~cond); {2993#true} is VALID [2022-02-20 14:23:31,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {2993#true} ~cond := #in~cond; {2993#true} is VALID [2022-02-20 14:23:31,143 INFO L272 TraceCheckUtils]: 22: Hoare triple {2994#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2993#true} is VALID [2022-02-20 14:23:31,144 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2993#true} {2994#false} #107#return; {2994#false} is VALID [2022-02-20 14:23:31,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {2993#true} assume true; {2993#true} is VALID [2022-02-20 14:23:31,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {2993#true} assume !(0 == ~cond); {2993#true} is VALID [2022-02-20 14:23:31,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {2993#true} ~cond := #in~cond; {2993#true} is VALID [2022-02-20 14:23:31,144 INFO L272 TraceCheckUtils]: 17: Hoare triple {2994#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2993#true} is VALID [2022-02-20 14:23:31,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {2994#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2994#false} is VALID [2022-02-20 14:23:31,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {3198#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2994#false} is VALID [2022-02-20 14:23:31,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {3202#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3198#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:31,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {3202#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {3202#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:31,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {3202#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3202#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:31,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {3212#(<= (+ |ULTIMATE.start_main_~row~0#1| 1) |ULTIMATE.start_main_~column~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {3202#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:31,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {3216#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3212#(<= (+ |ULTIMATE.start_main_~row~0#1| 1) |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:23:31,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {3216#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {3216#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:23:31,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {3019#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {3216#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:23:31,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {2993#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {3019#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:23:31,150 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2993#true} {2993#true} #105#return; {2993#true} is VALID [2022-02-20 14:23:31,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {2993#true} assume true; {2993#true} is VALID [2022-02-20 14:23:31,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {2993#true} assume !(0 == ~cond); {2993#true} is VALID [2022-02-20 14:23:31,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {2993#true} ~cond := #in~cond; {2993#true} is VALID [2022-02-20 14:23:31,150 INFO L272 TraceCheckUtils]: 2: Hoare triple {2993#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2993#true} is VALID [2022-02-20 14:23:31,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {2993#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {2993#true} is VALID [2022-02-20 14:23:31,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {2993#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2993#true} is VALID [2022-02-20 14:23:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 14:23:31,154 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:31,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59285630] [2022-02-20 14:23:31,155 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:31,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880036913] [2022-02-20 14:23:31,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880036913] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:31,155 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:31,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-02-20 14:23:31,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660794721] [2022-02-20 14:23:31,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:31,157 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-02-20 14:23:31,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:31,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:31,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:31,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:23:31,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:31,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:23:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:23:31,193 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:31,828 INFO L93 Difference]: Finished difference Result 167 states and 203 transitions. [2022-02-20 14:23:31,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:23:31,828 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-02-20 14:23:31,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2022-02-20 14:23:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2022-02-20 14:23:31,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 91 transitions. [2022-02-20 14:23:31,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:31,926 INFO L225 Difference]: With dead ends: 167 [2022-02-20 14:23:31,926 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 14:23:31,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-02-20 14:23:31,932 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 41 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:31,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 124 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:23:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 14:23:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2022-02-20 14:23:32,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:32,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 104 states, 90 states have (on average 1.2) internal successors, (108), 91 states have internal predecessors, (108), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:32,124 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 104 states, 90 states have (on average 1.2) internal successors, (108), 91 states have internal predecessors, (108), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:32,124 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 104 states, 90 states have (on average 1.2) internal successors, (108), 91 states have internal predecessors, (108), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:32,127 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2022-02-20 14:23:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 144 transitions. [2022-02-20 14:23:32,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:32,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:32,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 90 states have (on average 1.2) internal successors, (108), 91 states have internal predecessors, (108), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 120 states. [2022-02-20 14:23:32,128 INFO L87 Difference]: Start difference. First operand has 104 states, 90 states have (on average 1.2) internal successors, (108), 91 states have internal predecessors, (108), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 120 states. [2022-02-20 14:23:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:32,131 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2022-02-20 14:23:32,131 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 144 transitions. [2022-02-20 14:23:32,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:32,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:32,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:32,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.2) internal successors, (108), 91 states have internal predecessors, (108), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 14:23:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2022-02-20 14:23:32,134 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 41 [2022-02-20 14:23:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:32,134 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2022-02-20 14:23:32,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2022-02-20 14:23:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 14:23:32,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:32,135 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:32,152 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:23:32,343 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:23:32,343 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:32,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:32,344 INFO L85 PathProgramCache]: Analyzing trace with hash 178867369, now seen corresponding path program 3 times [2022-02-20 14:23:32,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:32,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838303856] [2022-02-20 14:23:32,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:32,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:32,359 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:32,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999235138] [2022-02-20 14:23:32,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:23:32,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:32,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:32,360 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:23:32,361 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:23:32,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-20 14:23:32,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:32,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:23:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:32,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:32,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {3881#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {3881#true} is VALID [2022-02-20 14:23:32,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {3881#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {3881#true} is VALID [2022-02-20 14:23:32,576 INFO L272 TraceCheckUtils]: 2: Hoare triple {3881#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {3881#true} is VALID [2022-02-20 14:23:32,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2022-02-20 14:23:32,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2022-02-20 14:23:32,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {3881#true} assume true; {3881#true} is VALID [2022-02-20 14:23:32,576 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3881#true} {3881#true} #105#return; {3881#true} is VALID [2022-02-20 14:23:32,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {3881#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {3881#true} is VALID [2022-02-20 14:23:32,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {3881#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {3881#true} is VALID [2022-02-20 14:23:32,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {3881#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {3881#true} is VALID [2022-02-20 14:23:32,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {3881#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3881#true} is VALID [2022-02-20 14:23:32,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {3881#true} assume !(main_~column~0#1 < ~ARR_SIZE~0); {3881#true} is VALID [2022-02-20 14:23:32,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {3881#true} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3881#true} is VALID [2022-02-20 14:23:32,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {3881#true} assume !(main_~row~0#1 < ~ARR_SIZE~0); {3881#true} is VALID [2022-02-20 14:23:32,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {3881#true} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {3881#true} is VALID [2022-02-20 14:23:32,577 INFO L272 TraceCheckUtils]: 15: Hoare triple {3881#true} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {3881#true} is VALID [2022-02-20 14:23:32,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2022-02-20 14:23:32,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2022-02-20 14:23:32,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {3881#true} assume true; {3881#true} is VALID [2022-02-20 14:23:32,578 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3881#true} {3881#true} #107#return; {3881#true} is VALID [2022-02-20 14:23:32,578 INFO L272 TraceCheckUtils]: 20: Hoare triple {3881#true} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {3881#true} is VALID [2022-02-20 14:23:32,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2022-02-20 14:23:32,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2022-02-20 14:23:32,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {3881#true} assume true; {3881#true} is VALID [2022-02-20 14:23:32,578 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3881#true} {3881#true} #109#return; {3881#true} is VALID [2022-02-20 14:23:32,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {3881#true} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {3881#true} is VALID [2022-02-20 14:23:32,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {3881#true} assume !(main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);main_#t~ite10#1 := main_#t~mem9#1; {3881#true} is VALID [2022-02-20 14:23:32,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {3881#true} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {3881#true} is VALID [2022-02-20 14:23:32,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {3881#true} assume 0 == main_~temp~0#1; {3881#true} is VALID [2022-02-20 14:23:32,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {3881#true} main_~row~0#1 := 0; {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:32,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:32,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:32,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:32,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:32,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3989#(<= 1 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:32,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {3989#(<= 1 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {3993#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:23:32,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {3993#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {3993#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:23:32,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {3993#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4000#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 1))} is VALID [2022-02-20 14:23:32,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {4000#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 1))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {3882#false} is VALID [2022-02-20 14:23:32,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {3882#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3882#false} is VALID [2022-02-20 14:23:32,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {3882#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {3882#false} is VALID [2022-02-20 14:23:32,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {3882#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3882#false} is VALID [2022-02-20 14:23:32,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {3882#false} assume 0 == __VERIFIER_assert_~cond#1; {3882#false} is VALID [2022-02-20 14:23:32,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {3882#false} assume !false; {3882#false} is VALID [2022-02-20 14:23:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 14:23:32,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:32,721 INFO L290 TraceCheckUtils]: 43: Hoare triple {3882#false} assume !false; {3882#false} is VALID [2022-02-20 14:23:32,721 INFO L290 TraceCheckUtils]: 42: Hoare triple {3882#false} assume 0 == __VERIFIER_assert_~cond#1; {3882#false} is VALID [2022-02-20 14:23:32,721 INFO L290 TraceCheckUtils]: 41: Hoare triple {3882#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3882#false} is VALID [2022-02-20 14:23:32,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {3882#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {3882#false} is VALID [2022-02-20 14:23:32,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {3882#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3882#false} is VALID [2022-02-20 14:23:32,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {4034#(< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {3882#false} is VALID [2022-02-20 14:23:32,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {4038#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4034#(< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:32,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {4038#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {4038#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:32,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {3989#(<= 1 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4038#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:32,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3989#(<= 1 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:32,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:32,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:32,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:32,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:32,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {3881#true} main_~row~0#1 := 0; {3973#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:32,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {3881#true} assume 0 == main_~temp~0#1; {3881#true} is VALID [2022-02-20 14:23:32,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {3881#true} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {3881#true} is VALID [2022-02-20 14:23:32,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {3881#true} assume !(main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);main_#t~ite10#1 := main_#t~mem9#1; {3881#true} is VALID [2022-02-20 14:23:32,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {3881#true} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {3881#true} is VALID [2022-02-20 14:23:32,727 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3881#true} {3881#true} #109#return; {3881#true} is VALID [2022-02-20 14:23:32,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {3881#true} assume true; {3881#true} is VALID [2022-02-20 14:23:32,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2022-02-20 14:23:32,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2022-02-20 14:23:32,727 INFO L272 TraceCheckUtils]: 20: Hoare triple {3881#true} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {3881#true} is VALID [2022-02-20 14:23:32,727 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3881#true} {3881#true} #107#return; {3881#true} is VALID [2022-02-20 14:23:32,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {3881#true} assume true; {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L272 TraceCheckUtils]: 15: Hoare triple {3881#true} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {3881#true} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {3881#true} assume !(main_~row~0#1 < ~ARR_SIZE~0); {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {3881#true} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {3881#true} assume !(main_~column~0#1 < ~ARR_SIZE~0); {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {3881#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {3881#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {3881#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {3881#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3881#true} {3881#true} #105#return; {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {3881#true} assume true; {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L290 TraceCheckUtils]: 4: Hoare triple {3881#true} assume !(0 == ~cond); {3881#true} is VALID [2022-02-20 14:23:32,728 INFO L290 TraceCheckUtils]: 3: Hoare triple {3881#true} ~cond := #in~cond; {3881#true} is VALID [2022-02-20 14:23:32,729 INFO L272 TraceCheckUtils]: 2: Hoare triple {3881#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {3881#true} is VALID [2022-02-20 14:23:32,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {3881#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {3881#true} is VALID [2022-02-20 14:23:32,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {3881#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {3881#true} is VALID [2022-02-20 14:23:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 14:23:32,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:32,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838303856] [2022-02-20 14:23:32,729 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:32,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999235138] [2022-02-20 14:23:32,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999235138] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:32,729 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:32,729 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-20 14:23:32,729 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319410157] [2022-02-20 14:23:32,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:32,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-02-20 14:23:32,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:32,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:23:32,762 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:23:32,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 14:23:32,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:32,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 14:23:32,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:23:32,763 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:23:33,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:33,241 INFO L93 Difference]: Finished difference Result 144 states and 167 transitions. [2022-02-20 14:23:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:23:33,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-02-20 14:23:33,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:23:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2022-02-20 14:23:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:23:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2022-02-20 14:23:33,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 86 transitions. [2022-02-20 14:23:33,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:33,323 INFO L225 Difference]: With dead ends: 144 [2022-02-20 14:23:33,323 INFO L226 Difference]: Without dead ends: 74 [2022-02-20 14:23:33,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:23:33,324 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:33,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 85 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:23:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-20 14:23:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2022-02-20 14:23:33,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:33,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 72 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 63 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:33,444 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 72 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 63 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:33,445 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 72 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 63 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:33,446 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-02-20 14:23:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-02-20 14:23:33,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:33,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:33,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 63 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 74 states. [2022-02-20 14:23:33,447 INFO L87 Difference]: Start difference. First operand has 72 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 63 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 74 states. [2022-02-20 14:23:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:33,449 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-02-20 14:23:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-02-20 14:23:33,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:33,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:33,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:33,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 63 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2022-02-20 14:23:33,451 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 44 [2022-02-20 14:23:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:33,451 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2022-02-20 14:23:33,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 14:23:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-02-20 14:23:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 14:23:33,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:33,452 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:33,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 14:23:33,661 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:23:33,661 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:33,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:33,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1693722629, now seen corresponding path program 3 times [2022-02-20 14:23:33,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:33,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487776006] [2022-02-20 14:23:33,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:33,677 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:33,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132514037] [2022-02-20 14:23:33,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:23:33,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:33,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:33,679 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:23:33,683 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:23:33,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:23:33,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:33,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 14:23:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:33,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:34,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {4614#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {4614#true} is VALID [2022-02-20 14:23:34,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {4614#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {4614#true} is VALID [2022-02-20 14:23:34,078 INFO L272 TraceCheckUtils]: 2: Hoare triple {4614#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {4614#true} is VALID [2022-02-20 14:23:34,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {4614#true} ~cond := #in~cond; {4614#true} is VALID [2022-02-20 14:23:34,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {4614#true} assume !(0 == ~cond); {4614#true} is VALID [2022-02-20 14:23:34,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {4614#true} assume true; {4614#true} is VALID [2022-02-20 14:23:34,078 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4614#true} {4614#true} #105#return; {4614#true} is VALID [2022-02-20 14:23:34,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {4614#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {4614#true} is VALID [2022-02-20 14:23:34,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {4614#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4614#true} is VALID [2022-02-20 14:23:34,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {4614#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4614#true} is VALID [2022-02-20 14:23:34,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {4614#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4614#true} is VALID [2022-02-20 14:23:34,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {4614#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4614#true} is VALID [2022-02-20 14:23:34,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {4614#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4614#true} is VALID [2022-02-20 14:23:34,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {4614#true} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4614#true} is VALID [2022-02-20 14:23:34,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {4614#true} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4614#true} is VALID [2022-02-20 14:23:34,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {4614#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4614#true} is VALID [2022-02-20 14:23:34,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {4614#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4614#true} is VALID [2022-02-20 14:23:34,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {4614#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4614#true} is VALID [2022-02-20 14:23:34,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {4614#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4614#true} is VALID [2022-02-20 14:23:34,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {4614#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4614#true} is VALID [2022-02-20 14:23:34,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {4614#true} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4614#true} is VALID [2022-02-20 14:23:34,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {4614#true} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4614#true} is VALID [2022-02-20 14:23:34,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {4614#true} assume !(main_~row~0#1 < ~ARR_SIZE~0); {4614#true} is VALID [2022-02-20 14:23:34,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {4614#true} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4614#true} is VALID [2022-02-20 14:23:34,080 INFO L272 TraceCheckUtils]: 24: Hoare triple {4614#true} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {4614#true} is VALID [2022-02-20 14:23:34,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {4614#true} ~cond := #in~cond; {4694#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 14:23:34,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {4694#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4698#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:34,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {4698#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4698#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:34,084 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4698#(not (= |assume_abort_if_not_#in~cond| 0))} {4614#true} #107#return; {4705#(and (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:34,085 INFO L272 TraceCheckUtils]: 29: Hoare triple {4705#(and (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {4709#(< 0 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:34,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {4709#(< 0 ~ARR_SIZE~0)} ~cond := #in~cond; {4713#(and (< 0 ~ARR_SIZE~0) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-02-20 14:23:34,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {4713#(and (< 0 ~ARR_SIZE~0) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {4717#(and (< 0 ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:23:34,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {4717#(and (< 0 ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| 0)))} assume true; {4717#(and (< 0 ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:23:34,087 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4717#(and (< 0 ~ARR_SIZE~0) (not (= |assume_abort_if_not_#in~cond| 0)))} {4705#(and (<= 0 |ULTIMATE.start_main_~index1~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} #109#return; {4724#(and (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:34,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {4724#(and (< |ULTIMATE.start_main_~index2~0#1| ~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (<= 0 |ULTIMATE.start_main_~index2~0#1|) (< |ULTIMATE.start_main_~index1~0#1| ~ARR_SIZE~0))} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {4728#(and (< (+ |ULTIMATE.start_main_~temp~0#1| 1) (* 2 ~ARR_SIZE~0)) (<= 0 |ULTIMATE.start_main_~temp~0#1|))} is VALID [2022-02-20 14:23:34,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {4728#(and (< (+ |ULTIMATE.start_main_~temp~0#1| 1) (* 2 ~ARR_SIZE~0)) (<= 0 |ULTIMATE.start_main_~temp~0#1|))} assume main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {4732#(<= 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:34,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {4732#(<= 2 ~ARR_SIZE~0)} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {4732#(<= 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:34,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {4732#(<= 2 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {4732#(<= 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:34,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {4732#(<= 2 ~ARR_SIZE~0)} main_~row~0#1 := 0; {4742#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:34,089 INFO L290 TraceCheckUtils]: 39: Hoare triple {4742#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 2 ~ARR_SIZE~0))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4742#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:34,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {4742#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 2 ~ARR_SIZE~0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {4742#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:34,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {4742#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 2 ~ARR_SIZE~0))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4742#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:34,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {4742#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 2 ~ARR_SIZE~0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4742#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:34,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {4742#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 2 ~ARR_SIZE~0))} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4758#(and (<= 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:34,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {4758#(and (<= 2 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {4615#false} is VALID [2022-02-20 14:23:34,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {4615#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4615#false} is VALID [2022-02-20 14:23:34,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {4615#false} assume 0 == __VERIFIER_assert_~cond#1; {4615#false} is VALID [2022-02-20 14:23:34,092 INFO L290 TraceCheckUtils]: 47: Hoare triple {4615#false} assume !false; {4615#false} is VALID [2022-02-20 14:23:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 14:23:34,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:34,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {4615#false} assume !false; {4615#false} is VALID [2022-02-20 14:23:34,731 INFO L290 TraceCheckUtils]: 46: Hoare triple {4615#false} assume 0 == __VERIFIER_assert_~cond#1; {4615#false} is VALID [2022-02-20 14:23:34,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {4615#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4615#false} is VALID [2022-02-20 14:23:34,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {4780#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {4615#false} is VALID [2022-02-20 14:23:34,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {4784#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4780#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:34,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {4784#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4784#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:34,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {4784#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4784#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:34,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {4784#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {4784#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:34,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {4784#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4784#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:34,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {4732#(<= 2 ~ARR_SIZE~0)} main_~row~0#1 := 0; {4784#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:34,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {4732#(<= 2 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {4732#(<= 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:34,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {4732#(<= 2 ~ARR_SIZE~0)} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {4732#(<= 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:34,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {4809#(or (and (not (= (+ (- 2) ~ARR_SIZE~0) |ULTIMATE.start_main_~temp~0#1|)) (not (= ~ARR_SIZE~0 |ULTIMATE.start_main_~temp~0#1|))) (<= 2 ~ARR_SIZE~0))} assume main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {4732#(<= 2 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:34,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {4813#(or (and (not (= (+ (- 2) ~ARR_SIZE~0) (+ |ULTIMATE.start_main_~index1~0#1| |ULTIMATE.start_main_~index2~0#1|))) (not (= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~index1~0#1| |ULTIMATE.start_main_~index2~0#1|)))) (<= 2 ~ARR_SIZE~0))} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {4809#(or (and (not (= (+ (- 2) ~ARR_SIZE~0) |ULTIMATE.start_main_~temp~0#1|)) (not (= ~ARR_SIZE~0 |ULTIMATE.start_main_~temp~0#1|))) (<= 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:34,736 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4821#(or (not (= |assume_abort_if_not_#in~cond| 0)) (<= 2 ~ARR_SIZE~0))} {4817#(or (and (or (< ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~index1~0#1| 2)) (<= (+ |ULTIMATE.start_main_~index1~0#1| 2) 0)) (or (<= |ULTIMATE.start_main_~index1~0#1| 0) (< ~ARR_SIZE~0 |ULTIMATE.start_main_~index1~0#1|))) (<= 2 ~ARR_SIZE~0))} #109#return; {4813#(or (and (not (= (+ (- 2) ~ARR_SIZE~0) (+ |ULTIMATE.start_main_~index1~0#1| |ULTIMATE.start_main_~index2~0#1|))) (not (= ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~index1~0#1| |ULTIMATE.start_main_~index2~0#1|)))) (<= 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:34,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {4821#(or (not (= |assume_abort_if_not_#in~cond| 0)) (<= 2 ~ARR_SIZE~0))} assume true; {4821#(or (not (= |assume_abort_if_not_#in~cond| 0)) (<= 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:34,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {4828#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0) (<= 2 ~ARR_SIZE~0))} assume !(0 == ~cond); {4821#(or (not (= |assume_abort_if_not_#in~cond| 0)) (<= 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:34,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {4614#true} ~cond := #in~cond; {4828#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0) (<= 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:34,738 INFO L272 TraceCheckUtils]: 29: Hoare triple {4817#(or (and (or (< ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~index1~0#1| 2)) (<= (+ |ULTIMATE.start_main_~index1~0#1| 2) 0)) (or (<= |ULTIMATE.start_main_~index1~0#1| 0) (< ~ARR_SIZE~0 |ULTIMATE.start_main_~index1~0#1|))) (<= 2 ~ARR_SIZE~0))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {4614#true} is VALID [2022-02-20 14:23:34,738 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4698#(not (= |assume_abort_if_not_#in~cond| 0))} {4614#true} #107#return; {4817#(or (and (or (< ~ARR_SIZE~0 (+ |ULTIMATE.start_main_~index1~0#1| 2)) (<= (+ |ULTIMATE.start_main_~index1~0#1| 2) 0)) (or (<= |ULTIMATE.start_main_~index1~0#1| 0) (< ~ARR_SIZE~0 |ULTIMATE.start_main_~index1~0#1|))) (<= 2 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:34,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {4698#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4698#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:34,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {4844#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4698#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:34,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {4614#true} ~cond := #in~cond; {4844#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 14:23:34,739 INFO L272 TraceCheckUtils]: 24: Hoare triple {4614#true} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {4614#true} is VALID [2022-02-20 14:23:34,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {4614#true} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4614#true} is VALID [2022-02-20 14:23:34,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {4614#true} assume !(main_~row~0#1 < ~ARR_SIZE~0); {4614#true} is VALID [2022-02-20 14:23:34,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {4614#true} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4614#true} is VALID [2022-02-20 14:23:34,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {4614#true} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4614#true} is VALID [2022-02-20 14:23:34,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {4614#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4614#true} is VALID [2022-02-20 14:23:34,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {4614#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4614#true} is VALID [2022-02-20 14:23:34,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {4614#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4614#true} is VALID [2022-02-20 14:23:34,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {4614#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4614#true} is VALID [2022-02-20 14:23:34,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {4614#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4614#true} is VALID [2022-02-20 14:23:34,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {4614#true} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4614#true} is VALID [2022-02-20 14:23:34,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {4614#true} assume !(main_~column~0#1 < ~ARR_SIZE~0); {4614#true} is VALID [2022-02-20 14:23:34,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {4614#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4614#true} is VALID [2022-02-20 14:23:34,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {4614#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4614#true} is VALID [2022-02-20 14:23:34,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {4614#true} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4614#true} is VALID [2022-02-20 14:23:34,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {4614#true} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {4614#true} is VALID [2022-02-20 14:23:34,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {4614#true} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {4614#true} is VALID [2022-02-20 14:23:34,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {4614#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {4614#true} is VALID [2022-02-20 14:23:34,741 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4614#true} {4614#true} #105#return; {4614#true} is VALID [2022-02-20 14:23:34,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {4614#true} assume true; {4614#true} is VALID [2022-02-20 14:23:34,741 INFO L290 TraceCheckUtils]: 4: Hoare triple {4614#true} assume !(0 == ~cond); {4614#true} is VALID [2022-02-20 14:23:34,741 INFO L290 TraceCheckUtils]: 3: Hoare triple {4614#true} ~cond := #in~cond; {4614#true} is VALID [2022-02-20 14:23:34,741 INFO L272 TraceCheckUtils]: 2: Hoare triple {4614#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {4614#true} is VALID [2022-02-20 14:23:34,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {4614#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {4614#true} is VALID [2022-02-20 14:23:34,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {4614#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {4614#true} is VALID [2022-02-20 14:23:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-02-20 14:23:34,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:34,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487776006] [2022-02-20 14:23:34,742 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:34,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132514037] [2022-02-20 14:23:34,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132514037] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:34,742 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:34,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2022-02-20 14:23:34,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460092486] [2022-02-20 14:23:34,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:34,742 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2022-02-20 14:23:34,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:34,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:34,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:34,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 14:23:34,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:34,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 14:23:34,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-02-20 14:23:34,789 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:35,950 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2022-02-20 14:23:35,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 14:23:35,951 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2022-02-20 14:23:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 79 transitions. [2022-02-20 14:23:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 79 transitions. [2022-02-20 14:23:35,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 79 transitions. [2022-02-20 14:23:36,026 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:23:36,027 INFO L225 Difference]: With dead ends: 98 [2022-02-20 14:23:36,027 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 14:23:36,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 14:23:36,028 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 150 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:36,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 148 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:23:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 14:23:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 54. [2022-02-20 14:23:36,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:36,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:36,128 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:36,128 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:36,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:36,131 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2022-02-20 14:23:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2022-02-20 14:23:36,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:36,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:36,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 92 states. [2022-02-20 14:23:36,132 INFO L87 Difference]: Start difference. First operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 92 states. [2022-02-20 14:23:36,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:36,133 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2022-02-20 14:23:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2022-02-20 14:23:36,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:36,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:36,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:36,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:23:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-02-20 14:23:36,134 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 48 [2022-02-20 14:23:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:36,134 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-02-20 14:23:36,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 14:23:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-02-20 14:23:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 14:23:36,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:36,135 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1] [2022-02-20 14:23:36,154 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:23:36,339 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:23:36,339 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:36,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:36,340 INFO L85 PathProgramCache]: Analyzing trace with hash 11450257, now seen corresponding path program 4 times [2022-02-20 14:23:36,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:36,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233404400] [2022-02-20 14:23:36,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:36,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:36,357 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:36,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142471449] [2022-02-20 14:23:36,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:23:36,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:36,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:36,358 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:23:36,359 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:23:36,557 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:23:36,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:36,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-20 14:23:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:36,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:36,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 61 treesize of output 56 [2022-02-20 14:23:36,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 120 [2022-02-20 14:23:36,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:36,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:36,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 93 treesize of output 16 [2022-02-20 14:23:36,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 80 treesize of output 73 [2022-02-20 14:23:36,914 INFO L356 Elim1Store]: treesize reduction 166, result has 9.3 percent of original size [2022-02-20 14:23:36,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 140 [2022-02-20 14:23:36,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:36,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:36,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:36,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 118 treesize of output 43 [2022-02-20 14:23:37,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 96 treesize of output 87 [2022-02-20 14:23:37,414 INFO L356 Elim1Store]: treesize reduction 338, result has 8.6 percent of original size [2022-02-20 14:23:37,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 157 [2022-02-20 14:23:37,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:37,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 20 [2022-02-20 14:23:37,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 80 treesize of output 69 [2022-02-20 14:23:37,764 INFO L356 Elim1Store]: treesize reduction 279, result has 7.9 percent of original size [2022-02-20 14:23:37,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 122 [2022-02-20 14:23:39,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 135 treesize of output 120 [2022-02-20 14:23:40,120 INFO L356 Elim1Store]: treesize reduction 342, result has 38.7 percent of original size [2022-02-20 14:23:40,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 225 treesize of output 464 [2022-02-20 14:23:45,784 INFO L356 Elim1Store]: treesize reduction 670, result has 28.9 percent of original size [2022-02-20 14:23:45,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 893 treesize of output 824 [2022-02-20 14:23:52,257 INFO L356 Elim1Store]: treesize reduction 747, result has 1.3 percent of original size [2022-02-20 14:23:52,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 296 treesize of output 93 [2022-02-20 14:23:52,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {5343#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {5343#true} is VALID [2022-02-20 14:23:52,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {5343#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~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; {5351#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:23:52,708 INFO L272 TraceCheckUtils]: 2: Hoare triple {5351#(<= ~ARR_SIZE~0 32767)} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {5351#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:23:52,708 INFO L290 TraceCheckUtils]: 3: Hoare triple {5351#(<= ~ARR_SIZE~0 32767)} ~cond := #in~cond; {5351#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:23:52,708 INFO L290 TraceCheckUtils]: 4: Hoare triple {5351#(<= ~ARR_SIZE~0 32767)} assume !(0 == ~cond); {5351#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:23:52,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {5351#(<= ~ARR_SIZE~0 32767)} assume true; {5351#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:23:52,709 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5351#(<= ~ARR_SIZE~0 32767)} {5351#(<= ~ARR_SIZE~0 32767)} #105#return; {5351#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:23:52,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {5351#(<= ~ARR_SIZE~0 32767)} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {5370#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:23:52,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {5370#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {5374#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:23:52,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {5374#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {5378#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:23:52,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {5378#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 32767))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5382#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:23:52,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {5382#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 32767))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {5386#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:23:52,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {5386#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 32767))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5390#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~column~0#1| 2) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:23:52,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {5390#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~column~0#1| 2) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {5394#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {5394#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5398#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {5398#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {5402#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {5402#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {5406#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {5406#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (<= ~ARR_SIZE~0 2))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5410#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {5410#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (<= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4))) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,738 INFO L272 TraceCheckUtils]: 24: Hoare triple {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} ~cond := #in~cond; {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} assume !(0 == ~cond); {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} assume true; {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,742 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} #107#return; {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,744 INFO L272 TraceCheckUtils]: 29: Hoare triple {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} ~cond := #in~cond; {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} assume !(0 == ~cond); {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} assume true; {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,748 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5433#(and (< 1 ~ARR_SIZE~0) (exists ((v_DerPreprocessor_7 Int) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (store (store (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) (- 17179869180) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) 4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) 0) (<= (select (select |#memory_int| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|) 0))) (<= ~ARR_SIZE~0 2))} {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} #109#return; {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} main_~temp~0#1 := main_~index1~0#1 + main_~index2~0#1; {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {5414#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} assume main_~temp~0#1 == ~ARR_SIZE~0 - 2 || main_~temp~0#1 == ~ARR_SIZE~0;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {5467#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_#t~ite10#1| 1) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {5467#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= |ULTIMATE.start_main_#t~ite10#1| 1) (exists ((v_DerPreprocessor_7 Int)) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4) v_DerPreprocessor_7) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 17179869180)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4))) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= ~ARR_SIZE~0 2))} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {5471#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {5471#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= ~ARR_SIZE~0 2))} assume 0 == main_~temp~0#1; {5471#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {5471#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= ~ARR_SIZE~0 2))} main_~row~0#1 := 0; {5478#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {5478#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {5482#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {5482#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {5486#(and (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|))) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,761 INFO L290 TraceCheckUtils]: 41: Hoare triple {5486#(and (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|))) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5490#(and (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4)))) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {5490#(and (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4)))) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {5494#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)))) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {5494#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)))) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5494#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)))) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {5494#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)))) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {5494#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)))) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,769 INFO L290 TraceCheckUtils]: 45: Hoare triple {5494#(and (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)))) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 2))} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {5504#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,771 INFO L290 TraceCheckUtils]: 46: Hoare triple {5504#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (<= ~ARR_SIZE~0 2))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {5508#(and (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:52,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {5508#(and (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {5512#(and (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:52,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {5512#(and (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5516#(and (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (= |ULTIMATE.start_main_~column~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:52,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {5516#(and (< 1 ~ARR_SIZE~0) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) 4 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~index1~0#1| (* (mod ~ARR_SIZE~0 4294967296) 4)) (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| (mod ~ARR_SIZE~0 4294967296)) 4))) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 0))) (= |ULTIMATE.start_main_~column~0#1| 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4)))) (<= ~ARR_SIZE~0 2) (= |ULTIMATE.start_main_~row~0#1| 1))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem14#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem14#1;havoc main_#t~mem14#1; {5520#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {5520#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} main_#t~post13#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5520#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,778 INFO L290 TraceCheckUtils]: 51: Hoare triple {5520#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {5520#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {5520#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {5520#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,779 INFO L290 TraceCheckUtils]: 53: Hoare triple {5520#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {5520#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~sum~0#1| 1) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:23:52,779 INFO L290 TraceCheckUtils]: 54: Hoare triple {5520#(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 main_~sum~0#1 <= 2 * (~ARR_SIZE~0 - 1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5536#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:23:52,779 INFO L290 TraceCheckUtils]: 55: Hoare triple {5536#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {5344#false} is VALID [2022-02-20 14:23:52,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {5344#false} assume !false; {5344#false} is VALID [2022-02-20 14:23:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:23:52,780 INFO L328 TraceCheckSpWp]: Computing backward predicates...